Search

In the face of complex user behavior patterns and massive data, improving the performance of recommender system models is an urgent challenge. Traditional methods often struggle to effectively handle feature interactions and complex user-item relationships. Combining the advantages of graph neural networks and the Deep Crossing network, this paper proposes a recommendation method based on hybrid neural networks with Deep Crossing (Deep Crossing with Graph Convolution and GRU, DCGCN-GRU). First, by constructing the graph structure of users and items, higher-order feature representations are extracted, and node features are updated using a multilayer graph convolution operation. Then, the higher-order features learned by the graph convolution network are spliced and weighted with the original features to form new feature inputs. Next, a Gated Recurrent Unit (GRU) is introduced to capture the inter-feature temporal dynamic relationships and sequence information. Finally, the Deep Crossing model is utilized to learn the interactions between the fused features at multiple levels and enhance the interactions between the features. Comparative experiments on three public datasets, MovieLens-ml-25m, Book-Crossings, and Amazon Reviews'23, show that the model achieves significant improvements in accuracy, mean square error (MSE), and mean absolute error (MAE). [ABSTRACT FROM AUTHOR]

With the widespread adoption of social media, the rapid dissemination of rumors poses a severe threat to public perception and social stability, emerging as a major challenge confronting society. Hence, the development of efficient and accurate rumor detection models has become an urgent need. Given the challenges of rumor detection tasks, including data scarcity, feature complexity, and difficulties in cross-task knowledge transfer, this paper proposes a BERT–GCN–Transfer Learning model, an integrated rumor detection model that combines BERT (Bidirectional Encoder Representations from Transformers), Graph Convolutional Networks (GCNs), and transfer learning techniques. By harnessing BERT's robust text representation capabilities, the GCN's feature extraction prowess on graph-structured data, and the advantage of transfer learning in cross-task knowledge sharing, the model achieves effective rumor detection on social media platforms. Experimental results indicate that this model achieves accuracies of 0.878 and 0.892 on the Twitter15 and Twitter16 datasets, respectively, significantly enhancing the accuracy of rumor detection compared to baseline models. Moreover, it greatly improves the efficiency of model training. [ABSTRACT FROM AUTHOR]

Despite notable advancements in bot detection methods based on Graph Neural Networks (GNNs). The efficacy of Graph Neural Networks relies heavily on the homophily assumption, which posits that nodes with the same label are more likely to form connections between them. However, the latest social bots are capable of concealing themselves by extensively interacting with authentic user accounts, forging extensive connections on social graphs, and thus deviating from the homophily assumption. Consequently, conventional Graph Neural Network methods continue to face significant challenges in detecting these novel types of social bots. To address this issue, we proposed SqueezeGCN, an adaptive neighborhood aggregation with the Squeeze Module for Twitter bot detection based on a GCN. The Squeeze Module uses a parallel multi-layer perceptron (MLP) to squeeze feature vectors into a one-dimensional representation. Subsequently, we adopted the sigmoid activation function, which normalizes values between 0 and 1, serving as node aggregation weights. The aggregation weight vector is processed by a linear layer to obtain the aggregation embedding, and the classification result is generated using a MLP classifier. This design generates adaptive aggregation weights for each node, diverging from the traditional singular neighbor aggregation approach. Our experiments demonstrate that SqueezeGCN performs well on three widely acknowledged Twitter bot detection benchmarks. Comparisons with a GCN reveal improvements of 2.37%, 15.59%, and 1.33% for the respective datasets. Furthermore, our approach demonstrates improvements when compared to state-of-the-art algorithms on the three benchmark datasets. The experimental results further affirm the exceptional effectiveness of our proposed algorithm for Twitter bot detection. [ABSTRACT FROM AUTHOR]

This paper proposes an interpretable geometry solution based on the formal language set of text and diagram. Geometry problems are solved using machines; however, machines encounter challenges in natural language processing and computer vision. Significant progress has improved existing methods in the extraction of geometric formal languages. However, the neglect of the graph structure information in the formal language and the lack of further refinement of the extracted language set can lead to poor theorem prediction and poor accuracy in problem solving. In this paper, a formal language graph is constructed using the extracted formal language set and applied to theorem prediction using a graph convolutional network. To better extract the relationship set of diagram elements, an improved diagram parser is proposed. The test results indicate that the improved method has good results when solving interpretable geometry problems. [ABSTRACT FROM AUTHOR]

Accurate traffic forecasting is crucial for the advancement of smart cities. Although there have been many studies on traffic forecasting, the accurate forecasting of traffic volume is still a challenge. To effectively capture the spatio-temporal correlations of traffic data, a deep learning-based traffic volume forecasting model called the Enhanced Information Graph Recursive Network (EIGRN) is presented in this paper. The model consists of three main parts: a Graph Embedding Adaptive Graph Convolution Network (GE-AGCN), a Modified Gated Recursive Unit (MGRU), and a local information enhancement module. The local information enhancement module is composed of a convolutional neural network (CNN), a transposed convolutional neural network, and an attention mechanism. In the EIGRN, the GE-AGCN is used to capture the spatial correlation of the traffic network by adaptively learning the hidden information of the complex topology, the MGRU is employed to capture the temporal correlation by learning the time change of the traffic volume, and the local information enhancement module is employed to capture the global and local correlations of the traffic volume. The EIGRN was evaluated using the real datasets PEMS-BAY and PeMSD7(M) to assess its predictive performance The results indicate that the forecasting performance of the EIGRN is better than the comparison models. [ABSTRACT FROM AUTHOR]

As human actions can be characterized by the trajectories of skeleton joints, skeleton-based action recognition techniques have gained increasing attention in the field of intelligent recognition and behavior analysis. With the emergence of large datasets, graph convolutional network (GCN) approaches have been widely applied for skeleton-based action recognition and have achieved remarkable performances. In this paper, a novel GCN-based approach is proposed by introducing a convolutional block attention module (CBAM)-based graph attention block to compute the semantic correlations between any two vertices. By considering semantic correlations, our model can effectively identify the most discriminative vertex connections associated with specific actions, even when the two vertices are physically unconnected. Experimental results demonstrate that the proposed model is effective and outperforms existing methods. [ABSTRACT FROM AUTHOR]

In recent times, there has been a swift advancement in the field of cryptocurrency. The advent of cryptocurrency has provided us with convenience and prosperity, but has also given rise to certain illicit and unlawful activities. Unlike classical currency, cryptocurrency conceals the activities of criminals and exposes their behavioral patterns, allowing us to determine whether present cryptocurrency transactions are legitimate by analyzing their behavioral patterns. There are two issues to consider when determining whether cryptocurrency transactions are legitimate. One is that most cryptocurrency transactions comply with laws and regulations, but only a small portion of them are used for illegal activities, which is related to the sample imbalance problem. The other issue concerns the excessive volume of data, and there are some unknown illegal transactions, so the data set contains an abundance of unlabeled data. As a result, it is critical to accurately distinguish between which transactions among the plethora of cryptocurrency transactions are legitimate and which are illegal. This presents quite a difficult challenge. Consequently, this paper combines mutual information and self-supervised learning to create a self-supervised model on the basis of mutual information that is used to improve the massive amount of untagged data that exist in the data set. Simultaneously, by merging the conventional cross-entropy loss function with mutual information, a novel loss function is created. It is employed to address the issue of sample imbalance in data sets. The F1-Score results obtained from our experimentation demonstrate that the novel loss function in the GCN method improves the performance of cryptocurrency illegal behavior detection by four points compared with the traditional loss function of cross-entropy; use of the self-supervised network that relies on mutual information improves the performance by three points compared with the original GCN method; using both together improves the performance by six points. [ABSTRACT FROM AUTHOR]

Aspect-based sentiment analysis (ABSA) plays a significant role in the field of big data and aims to distinguish the sentiment polarity of specific aspects in given sentences; however, the previous works on ABSA had two limitations. They mainly considered semantic features, rather than syntactic dependency features, and paid too much attention to the context words, while ignoring the high-level interaction of multiple representations of aspects themselves. To cope with these limitations, we propose a new method based on the graph convolutional network (GCN) and the multi-head attention mechanism, called the attention interactive encoder network (AIEN). The GCN was used to obtain the syntactic information that has the greatest syntactic impact on the aspect based on the syntax dependency tree. The multi-head attention mechanism can not only obtain the context-aware information of the given aspects, but also the interaction information between multiple representations of the aspect itself. The high-level information generated by the interaction of multi-dimensional features can produce a stronger representation ability for the aspect. Our experiments with the proposed model on five benchmark datasets showed that our model outperformed other works significantly. The experimental results further demonstrated the feasibility and applicability of our proposed model in the ABSA task. [ABSTRACT FROM AUTHOR]

In recent years, great progress has been made in the recognition of skeletal behaviors based on graph convolutional networks (GCNs). In most existing methods, however, the fixed adjacency matrix and fixed graph structure are used for skeleton data feature extraction in the spatial dimension, which usually leads to weak spatial modeling ability, unsatisfactory generalization performance, and an excessive number of model parameters. Most of these methods follow the ST-GCN approach in the temporal dimension, which inevitably leads to a number of non-key frames, increasing the cost of feature extraction and causing the model to be slower in terms of feature extraction and the required computational burden. In this paper, a gated temporally and spatially adaptive graph convolutional network is proposed. On the one hand, a learnable parameter matrix which can adaptively learn the key information of the skeleton data in spatial dimension is added to the graph convolution layer, improving the feature extraction and generalizability of the model and reducing the number of parameters. On the other hand, a gated unit is added to the temporal feature extraction module to alleviate interference from non-critical frames and reduce computational complexity. A channel attention mechanism based on an SE module and a frame attention mechanism are used to enhance the model's feature extraction ability. To prevent model degradation and ensure more stable training, residual links are added to each feature extraction module. The proposed approach was ultimately able to achieve 0.63% higher accuracy on the X-Sub benchmark with 4.46 M fewer parameters than GAT, one of the best SOTA methods. Inference speed of our model reaches as fast as 86.23 sequences/(second × GPU). Extensive experimental results further validate the effectiveness of our proposed approach on three large-scale datasets, namely, NTU RGB+D 60, NTU RGB+D 120, and Kinetics Skeleton. [ABSTRACT FROM AUTHOR]