Compared to the conventional covariance-based SEM (CB-SEM), partial-least-squares SEM (PLS-SEM) has an advantage in computation, which obtains parameter estimates by repeated least squares regression with a single dependent variable each time. Such an advantage becomes increasingly important with big data. However, the estimates of regression coefficients by PLS-SEM are biased in general. This article analytically compares the size of the bias in the regression coefficient estimators of the following methods: PLS-SEM; regression analysis using the Bartlett-factor-scores; regression analysis using the separate and joint regression-factor-scores, respectively; and regression analysis using the unweighted composite scores. A correction to parameter estimates following mode A of PLS-SEM is also proposed. Monte Carlo results indicate that regression analysis using other composite scores can be as good as PLS-SEM with respect to bias and efficiency/accuracy. Results also indicate that corrected estimates following PLS-SEM can be as good as the normal-distribution-based maximum likelihood estimates under CB-SEM.
Graph neural networks (GNNs) have been very successful at solving fraud detection tasks. The GNN-based detection algorithms learn node embeddings by aggregating neighboring information. Recently, CAmouflage-REsistant GNN (CARE-GNN) is proposed, and this algorithm achieves state-of-the-art results on fraud detection tasks by dealing with relation camouflages and feature camouflages. However, stacking multiple layers in a traditional way defined by hop leads to a rapid performance drop. As the single-layer CARE-GNN cannot extract more information to fix the potential mistakes, the performance heavily relies on the only one layer. In order to avoid the case of single-layer learning, in this paper, we consider a multi-layer architecture which can form a complementary relationship with residual structure. We propose an improved algorithm named Residual Layered CARE-GNN (RLC-GNN). The new algorithm learns layer by layer progressively and corrects mistakes continuously. We choose three metrics—recall, AUC, and F1-score—to evaluate proposed algorithm. Numerical experiments are conducted. We obtain up to 5.66%, 7.72%, and 9.09% improvements in recall, AUC, and F1-score, respectively, on Yelp dataset. Moreover, we also obtain up to 3.66%, 4.27%, and 3.25% improvements in the same three metrics on the Amazon dataset.
We focus on the performance analysis of the buffer-aided relaying system which allows data and energy packets to arrive independently and depart interactively. First, we profile the cooperative relaying system model as a data arrival and energy arrival coupling queuing model. Considering the influence of channel condition on the data departure rate, a new relay transmit protocol which permits exhausting more energy packet to send one data packet in the bad channel environment is proposed. Second, the joint data packet and energy packet handling problem is ascribed to a Coupled Processor Queuing Model which could achieve its steady state transition probability by Quasi-Birth and Death method. Third, the expressions of throughput, delay, and packet drop rate for both data queue and energy queue are also derived. Simulations are demonstrated to verify the analytical results under different data arrival rate, energy arrival rate, and relaying strategy.