Search

Crime report clustering plays a critical role in modern law enforcement, enabling the identification of patterns and trends essential for proactive policing. However, traditional clustering approaches face significant challenges with the complex, unstructured nature of crime reports and their inherent sparse relationships. While graph-based clustering shows promise, issues of noise sensitivity and data sparsity persist. This study introduces a unified approach integrating spectral graph-based clustering with Graph Convolutional Networks (GCN) to address these challenges. The proposed approach encompasses data collection, preprocessing, linguistic feature extraction, vectorization, graph construction, graph learning, and clustering to effectively capture the intricate similarities between crime reports. The proposed approach achieved significant improvements over existing methods: a Silhouette Score of 0.77, a Davies–Bouldin Index of 0.51, and consistent performance across varying dataset sizes (100–1000 nodes). These results demonstrate the potential for enhanced crime pattern detection in law enforcement operations. [ABSTRACT FROM AUTHOR]

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]

Due to the vigorous development of big data, news topic text classification has received extensive attention, and the accuracy of news topic text classification and the semantic analysis of text are worth us to explore. The semantic information contained in news topic text has an important impact on the classification results. Traditional text classification methods tend to default the text structure to the sequential linear structure, then classify by giving weight to words or according to the frequency value of words, while ignoring the semantic information in the text, which eventually leads to poor classification results. In order to solve the above problems, this paper proposes a BiLSTM-GCN (Bidirectional Long Short-Term Memory and Graph Convolutional Network) hybrid neural network text classification model based on dependency parsing. Firstly, we use BiLSTM to complete the extraction of feature vectors in the text; Then, we employ dependency parsing to strengthen the influence of words with semantic relationship, and obtain the global information of the text through GCN; Finally, aim to prevent the overfitting problem of the hybrid neural network which may be caused by too many network layers, we add a global average pooling layer. Our experimental results show that this method has a good performance on the THUCNews and SogouCS datasets, and the F-score reaches 91.37% and 91.76% respectively. [ABSTRACT FROM AUTHOR]

Multisensor data fusion method can improve the accuracy of bearing fault diagnosis, in order to address the problems of single-sensor data types and the insufficient exploration of redundancy and complementarity between different modal data in most existing multisensor data fusion methods for bearing fault diagnosis, a bearing fault diagnosis method based on a Multiple-Constraint Modal-Invariant Graph Convolutional Fusion Network (MCMI-GCFN) is proposed in this paper. Firstly, a Convolutional Autoencoder (CAE) and Squeeze-and-Excitation Block (SE block) are used to extract features of raw current and vibration signals. Secondly, the model introduces source domain classifiers and domain discriminators to capture modal invariance between different modal data based on domain adversarial training, making use of the redundancy and complementarity between multimodal data. Then, the spatial aggregation property of Graph Convolutional Neural Networks (GCN) is utilized to capture the dependency relationship between current and vibration modes with similar time step features for accurately fusing contextual semantic information. Finally, the validation is conducted on the public bearing damage current and vibration dataset from Paderborn University. The experimental results showed that the delivered fusion method achieved a bearing fault diagnosis accuracy of 99.6 %, which was about 9 %–11.4 % better than that with nonfusion methods. [ABSTRACT FROM AUTHOR]

In the development of image forensics, detection of Copy-Move Forgery (CMF) has become a major challenge due to the proliferation of image forgery techniques. The CMF is widely utilized to alter the content of the original image to spread false information or to use such forged digital images for illegal purposes e.g. false evidence in the court of law, or to blackmailing any individual. This paper presents a new method for CMF Detection (CMFD) that uses the power of Graph Convolution Networks (GCNs) and its multiple layers with ReLU activation, for CMFD and analysis. The aim to use GCN is due to its ability to improve the feature extraction process by utilizing the spatial and structural affiliation between elements in the digital images. Also, the GCN aims to store information about images and use it to graphically describe images with pixels or image areas as features, spatial and correlation relationships as edges. By pulling data from this image, GCN is able to obtain content rich features that are very powerful at detecting CMF regions. In proposed methodology, we utilized Support Vector machine (SVM) for classification and the binary cross-entropy loss, and the Adam optimizer for improving accuracy. Our scheme successfully achieves high accuracy and is effective in CMFD. We use the MICC F220, and CoMoFoD datasets to test the GCN in our proposed CMFD method. Through much testing and evaluation, we have found that GCN has the tremendous ability for CMFD in digital images in term of accuracy.

In recent years, great achievements have been made in graph convolutional network (GCN) for non-Euclidean spatial data feature extraction, especially the skeleton-based feature extraction. However, the fixed graph structure determined by the fixed adjacency matrix usually causes the problems such as the weak spatial modeling ability, the unsatisfactory generalization performance, the excessively large number of model parameters, and so on. In this paper, a spatially adaptive residual graph convolutional network (SARGCN) is proposed for action recognition based on skeleton feature extraction. Firstly, the uniform and fixed topology is not required in our graph. Secondly, a learnable parameter matrix is added to the GCN operation, which can enhance the model's capabilities of feature extraction and generalization, while reducing the number of parameters. Therefore, compared with the several existing models mentioned in this paper, the least number of parameters are used in our model while ensuring the comparable recognition accuracy. Finally, inspired by the ResNet architecture, a residual connection is introduced in GCN to obtain higher accuracy at lower computational costs and learning difficulties. Extensive experimental on two large-scale datasets results validate the effectiveness of our proposed approach, namely NTU RGB+D 60 and NTU RGB+D 120. [ABSTRACT FROM AUTHOR]

Multiple station passenger flow prediction is crucial but challenging for intelligent transportation systems. Recently, deep learning models have been widely applied in multi-station passenger flow prediction. However, flows at the same station in different periods, or different stations in the same period, always present different characteristics. These indicate that globally extracting spatio-temporal features for multi-station passenger flow prediction may only be powerful enough to achieve the excepted performance for some stations. Therefore, a novel two-step multi-station passenger flow prediction model is proposed. First, an unsupervised clustering method for station classification using pure passenger flow is proposed based on the Transformer encoder and K-Means. Two novel evaluation metrics are introduced to verify the effectiveness of the classification results. Then, based on the classification results, a passenger flow prediction model is proposed for every type of station. Residual network (ResNet) and graph convolution network (GCN) are applied for spatial feature extraction, and attention long short-term memory network (AttLSTM) is used for temporal feature extraction. Integrating results for every type of station creates a prediction model for all stations in the network. Experiments are conducted on two real-world ridership datasets. The proposed model performs better than unclassified results in multi-station passenger flow prediction. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Test & Measurement Technology is the property of Publishing Center of North University of China and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Graph Convolutional Network (GCN) is a powerful emerging deep learning technique for learning graph data. However, there are still some challenges for GCN. For example, the model is shallow; the performance is poor when labelled nodes are severely scarce. In this paper, we propose a Multi-Semantic Aligned Graph Convolutional Network (MSAGCN), which contains two fundamental operations: multi-angle aggregation and semantic alignment, to resolve two challenges simultaneously. The core of MSAGCN is the aggregation of nodes that belong to the same class from three perspectives: nodes, features, and graph structure, and expects the obtained node features to be mapped nearby. Specifically, multi-angle aggregation is applied to extract features from three angles of the labelled nodes, and semantic alignment is utilised to align the semantics in the extracted features to enhance the similar content from different angles. In this way, the problem of over-smoothing and over-fitting for GCN can be alleviated. We perform the node clustering task on three citation datasets, and the experimental results demonstrate that our method outperforms the state-of-the-art (SOTA) baselines. [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]

Mobile Laser Scanning (MLS) system can provide high-density and accurate 3D point clouds that enable rapid pavement crack detection for road maintenance tasks. Supervised learning-based algorithms have been proved pretty effective for handling such a large amount of inhomogeneous and unstructured point clouds. However, these algorithms often rely on a lot of annotated data, which is labor-intensive and time-consuming. This paper presents a semi-supervised point-level approach to overcome this challenge. We propose a graph-widen module to construct a reasonable graph structure for point clouds, increasing the detection performance of graph convolutional networks (GCN). The constructed graph characterizes the local features from a small amount of annotated data, avoiding information loss and dramatically reduces the dependence on annotated data. The MLS point clouds acquired by a commercial RIEGL VMX-450 system are used in this study. The experimental results demonstrate that our method outperforms the state-of-the-art point-level methods in terms of recall, F1 score, and efficiency while achieving comparable accuracy. [ABSTRACT FROM AUTHOR]

The purpose of aspect-level sentiment analysis is to determine the sentiment of specific aspect words in a sentence . In recent years, many methods have adopted syntactic dependency tree combined with graph convolutional network modeling. But the use of syntactic dependency structures is too direct and ignores the noise effect that accompanies the spanning tree, which limits the use of syntactic relations. This paper proposed an emotional classification model ( PCB-GCN) with progressive enhancement combined with a bidirectional graph convolution module. Firstly, it designed a progressive enhancement algorithm to obtain richer syntactic relations, used Bi-LSTM to extract semantics, and used bidirectional graph convolution module for feature extraction for syntactic graph structures in different directions. Finally, it combined the syntactic features and context semantics through a collaborative network, combined them for the final classification. The model has been tested on multiple public data sets, and all have achieved better results than the current baseline model. [ABSTRACT FROM AUTHOR]

With the rapid development of computer vision, human action recognition has shown its wide application prospects and research value in many fields such as video surveillance, video retrieval, and human-computer interaction. Human action recognition involves the understanding of image content, and the progress of practical applications is slow due to the complexity and diversity of human postures and the occlusion factors of the background. This paper comprehensively reviewed the development of human action recognition, and deeply explored the research methods in this field, including traditional manual feature extraction methods and deep learning-based methods, as well as the recently popular graph convolutional network（GCN）-based method. And this paper systematically summarized these methods according to the data types they used. In addition, for different data types, it introduced some popular action recognition datasets, compared and analyzed the performance of various methods on these datasets. Finally, this paper summarized the review, and prospected the future research direction of human action recognition. [ABSTRACT FROM AUTHOR]

The development of whole slide imaging techniques and online digital pathology platforms have accelerated the popularization of telepathology for remote tumor diagnoses. During a diagnosis, the behavior information of the pathologist can be recorded by the platform and then archived with the digital case. The browsing path of the pathologist on the WSI is one of the valuable information in the digital database because the image content within the path is expected to be highly correlated with the diagnosis report of the pathologist. In this article, we proposed a novel approach for computer-assisted cancer diagnosis named session-based histopathology image recommendation (SHIR) based on the browsing paths on WSIs. To achieve the SHIR, we developed a novel diagnostic regions attention network (DRA-Net) to learn the pathology knowledge from the image content associated with the browsing paths. The DRA-Net does not rely on the pixel-level or region-level annotations of pathologists. All the data for training can be automatically collected by the digital pathology platform without interrupting the pathologists’ diagnoses. The proposed approaches were evaluated on a gastric dataset containing 983 cases within 5 categories of gastric lesions. The quantitative and qualitative assessments on the dataset have demonstrated the proposed SHIR framework with the novel DRA-Net is effective in recommending diagnostically relevant cases for auxiliary diagnosis. The MRR and MAP for the recommendation are respectively 0.816 and 0.836 on the gastric dataset. The source code of the DRA-Net is available at https://github.com/zhengyushan/dpathnet. [ABSTRACT FROM AUTHOR]

Transportation mode recognition is a crucial task of Intelligent Transportation Systems (ITS) in smart city. Though many works have been investigated on transportation mode recognition in recent years, the accuracy and generality are still not able to meet the application requirements. In this paper, we propose a novel fusion framework for fine-grained transportation mode recognition, which consists of the Network in Network (NIN), Dilate Convolution and the Graph Convolutional Networks (GCN). In this framework, we first use NIN and Dilate Convolution to capture local and global features, respectively, and then introduce the graph convolutional network to learn the correlation of features. We construct a topological structure of the features based on the maximal information coefficient (MIC) criteria which is used to measure the similarity between two variables, and then obtain the adjacency matrix used for graph convolution. Extensive experimental results on the public Sussex-Huawei Locomotion-Transportation (SHL) dataset demonstrate the superiority of our proposed NDGCN to other state-of-the-art baselines with more than 22.3% higher accuracy. [ABSTRACT FROM AUTHOR]

Nowadays, prediction for medical treatment migration has become one of the interesting issues in the field of health informatics. This is because the medical treatment migration behavior is closely related to the evaluation of regional medical level, the rational use of medical resources, and the distribution of medical insurance. Therefore, a prediction model for medical treatment migration based on medical insurance data is introduced in this paper. First, a medical treatment graph is constructed based on medical insurance data. The medical treatment graph is a heterogeneous graph, which contains entities such as patients, diseases, hospitals, medicines, hospitalization events, and the relations between these entities. However, existing graph neural networks are unable to capture the time-series relationships between event-type entities. To this end, a prediction model based on Graph Convolutional Network (GCN) is proposed in this paper, namely, Event-involved GCN (EGCN). The proposed model aggregates conventional entities based on attention mechanism, and aggregates event-type entities based on a gating mechanism similar to LSTM. In addition, jumping connection is deployed to obtain the final node representation. In order to obtain embedded representations of medicines based on external information (medicine descriptions), an automatic encoder capable of embedding medicine descriptions is deployed in the proposed model. Finally, extensive experiments are conducted on a real medical insurance data set. Experimental results show that our model's predictive ability is better than the best models available. [ABSTRACT FROM AUTHOR]

The online social media ecosystem is becoming more and more confused because of more and more fake information and the social media of malicious users' fake content; at the same time, unspeakable pain has been brought to mankind. Social robot detection uses supervised classification based on artificial feature extraction. However, user privacy is also involved in using these methods, and the hidden feature information is also ignored, such as semi-supervised algorithms with low utilization rates and graph features. In this work, we symmetrically combine BERT and GCN (Graph Convolutional Network, GCN) and propose a novel model that combines large scale pretraining and transductive learning for social robot detection, BGSRD. BGSRD constructs a heterogeneous graph over the dataset and represents Twitter as nodes using BERT representations. Corpus learning via text graph convolution network is a single text graph, which is mainly built for corpus-based on word co-occurrence and document word relationship. BERT and GCN modules can be jointly trained in BGSRD to achieve the best of merit, training data and unlabeled test data can spread label influence through graph convolution and can be carried out in the large-scale pre-training of massive raw data and the transduction learning of joint learning representation. The experiment shows that a better performance can also be achieved by BGSRD on a wide range of social robot detection datasets. [ABSTRACT FROM AUTHOR]