Chenxu Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chenxu Wang has a total of 142 co-authors. Here are the top co-authors by number of shared publications:
- Pinghui Wang
Xi'an Jiaotong University, Xi'an, China
11 shared publications - Tao Qin
School of Computer Science and Technology, Xian Jiaotong University, Xian, China
11 shared publications - Xiaohong Guan
Xi'an Jiaotong University, Xi'an, China
9 shared publications - Junzhou Zhao
MOE Key Laboratory for Intelligent Networks and Network Security, Xian Jiaotong University, Xian, China
4 shared publications - Xiapu Luo
The Hong Kong Polytechnic University, Hong Kong, China
4 shared publications - Dengdi Sun
School of Artificial Intelligence, Anhui University, Hefei, Anhui, China
3 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (10) , 7046-7060
SimCFT: Trajectory Similarity Computation via Dynamic Status Features and Noisy Point Mining
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38 (10) , 7046-7060
SimCFT: Trajectory Similarity Computation via Dynamic Status Features and Noisy Point Mining
- 9 July 2026
- Published by Elsevier in Neurocomputing
- Vol. 700
Outlier detection in eigenvalue spaces based on spectral analysis of KNN graphs
- 9 July 2026
- Published by Elsevier in Neurocomputing
- Vol. 700
Outlier detection in eigenvalue spaces based on spectral analysis of KNN graphs
- Open Access
- 7 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
Knowledge Fusion and Denoising with Cross-View Contrastive Learning: A Framework for Efficient Sparse Data Processing
Recommender systems are effective tools to alleviate the challenges posed by information overload, but data sparsity has greatly affected their performance. Knowledge graphs (KG) can be employed to solve this problem because of their rich side information. However, existing KG-enhanced recommendation methods have the following limitations: (1) Noisy interactions: the user-item interactions constructed from implicit feedback are noisy, which is harmful to the user’s true preferences learning; (2) Insufficient fusion between different views: most KG-enhanced recommendation methods ignore the differences between signals from KG and user-item interactions and fail to fuse them effectively. To address these limitations, we propose a novel KG-enhanced recommendation framework named K nowledge F usion and D enoising with cross-view C ontrastive L earning framework (KFDCL). Specifically, we first perform contrastive learning (CL) across KG (knowledge view) and user-item interaction data (collaborative view) and then explicitly prune noisy interactions to alleviate the noisy interactions problem. Additionally, we design a weighted fusion strategy based on the activity of users and items to fuse the signals from different views adaptively. Extensive experiments on three public datasets demonstrate the effectiveness of the proposed KFDCL, notably with an average improvement of 3.79% performance over state-of-the-art methods on Recall@20 and NDCG@20.
- 7 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on the Web
Open AccessKnowledge Fusion and Denoising with Cross-View Contrastive Learning: A Framework for Efficient Sparse Data Processing
Recommender systems are effective tools to alleviate the challenges posed by information overload, but data sparsity has greatly affected their performance. Knowledge graphs (KG) can be employed to solve this problem because of their rich side information. However, existing KG-enhanced recommendation methods have the following limitations: (1) Noisy interactions: the user-item interactions constructed from implicit feedback are noisy, which is harmful to the user’s true preferences learning; (2) Insufficient fusion between different views: most KG-enhanced recommendation methods ignore the differences between signals from KG and user-item interactions and fail to fuse them effectively. To address these limitations, we propose a novel KG-enhanced recommendation framework named K nowledge F usion and D enoising with cross-view C ontrastive L earning framework (KFDCL). Specifically, we first perform contrastive learning (CL) across KG (knowledge view) and user-item interaction data (collaborative view) and then explicitly prune noisy interactions to alleviate the noisy interactions problem. Additionally, we design a weighted fusion strategy based on the activity of users and items to fuse the signals from different views adaptively. Extensive experiments on three public datasets demonstrate the effectiveness of the proposed KFDCL, notably with an average improvement of 3.79% performance over state-of-the-art methods on Recall@20 and NDCG@20.
- Open Access
- 29 June 2026
- Published by Elsevier in SSRN Electronic Journal
CALM: A Robust Multi-modal Entity Alignment Framework against Modality Conflict
With the emergence of multi-modal knowledge graphs, multi-modal entity alignment is flourishing to compensate for entity knowledge from different data sources. Currently, most methods focus on reducing the noise of the image modality, which usually derives from fuzzy information generated by low-quality data sources. However, few methods consider modality conflict, which can be attributed to the semantic inconsistency between the dominant structure modality and auxiliary modalities. This modality conflict introduces contradictory signals, ultimately degrading overall performance. To tackle these bottlenecks, we propose CALM, a robust multi-modal entity alignment framework against modality conflict, including conflict-aware modality arbitration and multi-modal fusion with masking contrastive learning. We formally define modality conflict and design a metric to quantify conflict strength. Consequently, our proposed modality arbitration mechanism calculates regularized weights to adaptively adjust different modality contributions. Furthermore, our designed masking multi-modal fusion method further captures synergic and unique modal information. Finally, we utilize the large language model to generate entity attributes to assist in extending an existing EA dataset into a multi-modal version to explore the effectiveness of CALM under modality conflict. Experimental results on multiple benchmark datasets and the extended multi-modal data demonstrate the effectiveness and robustness of CALM, which consistently outperforms state-of-the-art methods. Our code is available at https://anonymous.4open.science/r/Anonymization-43F9.
- 29 June 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCALM: A Robust Multi-modal Entity Alignment Framework against Modality Conflict
With the emergence of multi-modal knowledge graphs, multi-modal entity alignment is flourishing to compensate for entity knowledge from different data sources. Currently, most methods focus on reducing the noise of the image modality, which usually derives from fuzzy information generated by low-quality data sources. However, few methods consider modality conflict, which can be attributed to the semantic inconsistency between the dominant structure modality and auxiliary modalities. This modality conflict introduces contradictory signals, ultimately degrading overall performance. To tackle these bottlenecks, we propose CALM, a robust multi-modal entity alignment framework against modality conflict, including conflict-aware modality arbitration and multi-modal fusion with masking contrastive learning. We formally define modality conflict and design a metric to quantify conflict strength. Consequently, our proposed modality arbitration mechanism calculates regularized weights to adaptively adjust different modality contributions. Furthermore, our designed masking multi-modal fusion method further captures synergic and unique modal information. Finally, we utilize the large language model to generate entity attributes to assist in extending an existing EA dataset into a multi-modal version to explore the effectiveness of CALM under modality conflict. Experimental results on multiple benchmark datasets and the extended multi-modal data demonstrate the effectiveness and robustness of CALM, which consistently outperforms state-of-the-art methods. Our code is available at https://anonymous.4open.science/r/Anonymization-43F9.
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1401-1411
SGA: Self-boosting Attributed Graph Alignment via Neighborhood Consistency-based Edge Enhancement
Graph alignment, the task of identifying corresponding nodes across different graphs, is crucial for applications ranging from social network analysis to bioinformatics. Although most existing methods leverage graph neural networks (GNNs) to learn node embeddings for attributed graphs and match them based on node similarity, they often rely on objectives designed for node classification or link prediction. These approaches preserve node proximity within individual graphs but fail to capture cross-graph correspondence knowledge, leading to suboptimal alignment performance. This paper presents SGA (Self-boosting Graph Alignment), a novel framework that introduces a self-supervised objective and an iterative refinement scheme for robustly aligning attributed graphs. SGA begins with an unsupervised Graph Convolutional Network (GCN) to learn initial node representations. Then, a contrastive loss is designed to train the GCN using stably aligned node pairs derived from these initial embeddings. This constraint distinguishes closely connected nodes within individual graphs by leveraging cross-graph correspondence knowledge, thereby promoting accurate alignment across graphs. To handle graphs with incomplete topology, SGA incorporates an iterative refinement process enhanced by a neighborhood consistency metric. This metric evaluates the reliability of complementary edges, ensuring that only reliable connections are used to refine the graph structures. The refined graphs are then fed back into the GCN for the subsequent iterations, with the process terminating when no additional pseudo-aligned node pairs are identified or a maximum iteration count is reached. Extensive experiments on four real-world and two synthetic datasets demonstrate that SGA outperforms state-of-the-art graph alignment methods by an average of 5.8% in alignment accuracy. Our code is publicly available at https://github.com/XNetLab/SGA.
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1401-1411
Open AccessSGA: Self-boosting Attributed Graph Alignment via Neighborhood Consistency-based Edge Enhancement
Graph alignment, the task of identifying corresponding nodes across different graphs, is crucial for applications ranging from social network analysis to bioinformatics. Although most existing methods leverage graph neural networks (GNNs) to learn node embeddings for attributed graphs and match them based on node similarity, they often rely on objectives designed for node classification or link prediction. These approaches preserve node proximity within individual graphs but fail to capture cross-graph correspondence knowledge, leading to suboptimal alignment performance. This paper presents SGA (Self-boosting Graph Alignment), a novel framework that introduces a self-supervised objective and an iterative refinement scheme for robustly aligning attributed graphs. SGA begins with an unsupervised Graph Convolutional Network (GCN) to learn initial node representations. Then, a contrastive loss is designed to train the GCN using stably aligned node pairs derived from these initial embeddings. This constraint distinguishes closely connected nodes within individual graphs by leveraging cross-graph correspondence knowledge, thereby promoting accurate alignment across graphs. To handle graphs with incomplete topology, SGA incorporates an iterative refinement process enhanced by a neighborhood consistency metric. This metric evaluates the reliability of complementary edges, ensuring that only reliable connections are used to refine the graph structures. The refined graphs are then fed back into the GCN for the subsequent iterations, with the process terminating when no additional pseudo-aligned node pairs are identified or a maximum iteration count is reached. Extensive experiments on four real-world and two synthetic datasets demonstrate that SGA outperforms state-of-the-art graph alignment methods by an average of 5.8% in alignment accuracy. Our code is publicly available at https://github.com/XNetLab/SGA.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7862-7879
M$^{2}$HyCo: Multi-View Multi-Granularity Hypergraph Contrastive Learning
Recently, hypergraph contrastive learning (HCL) has received increasing attention due to its effectiveness in addressing high labeling costs and improving generalization. However, existing HCL methods often rely on random topology augmentation strategies and prioritize a single granularity, making it challenging to preserve critical structural information, high-order relationships, and a balance between global consistency and local feature dynamics during the representation process. To overcome these challenges, this paper proposes a multi-view multi-granularity hypergraph contrastive learning. Specifically, we first design a new sampling strategy that generates three complementary views to enhance hypergraph representation and improve diversity. In addition, we construct a hybrid attention encoder that integrates static homogeneity attention with dynamic self-attention to align global constraints with local adaptability. By jointly optimizing contrastive losses at both node and hyperedge levels, our framework effectively captures structural nuances and semantic correlations, significantly boosting both classification accuracy and clustering quality. This method is well-suited for scenarios with higher-order dependencies, such as session-based recommendation, social group interaction modeling, and biomedical multi-entity networks. Extensive experiments on multiple benchmark datasets demonstrate that M $^{2}$ HyCo improves node classification accuracy by an average of 0.4 percentage points and clustering performance by 5.72 and 8.72 points in NMI and ARI, respectively, over recent strong baselines, especially on Cora-A and Pubmed, thereby evidencing its effectiveness under high-order structural dependencies.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 13, 7862-7879
M$^{2}$HyCo: Multi-View Multi-Granularity Hypergraph Contrastive Learning
Recently, hypergraph contrastive learning (HCL) has received increasing attention due to its effectiveness in addressing high labeling costs and improving generalization. However, existing HCL methods often rely on random topology augmentation strategies and prioritize a single granularity, making it challenging to preserve critical structural information, high-order relationships, and a balance between global consistency and local feature dynamics during the representation process. To overcome these challenges, this paper proposes a multi-view multi-granularity hypergraph contrastive learning. Specifically, we first design a new sampling strategy that generates three complementary views to enhance hypergraph representation and improve diversity. In addition, we construct a hybrid attention encoder that integrates static homogeneity attention with dynamic self-attention to align global constraints with local adaptability. By jointly optimizing contrastive losses at both node and hyperedge levels, our framework effectively captures structural nuances and semantic correlations, significantly boosting both classification accuracy and clustering quality. This method is well-suited for scenarios with higher-order dependencies, such as session-based recommendation, social group interaction modeling, and biomedical multi-entity networks. Extensive experiments on multiple benchmark datasets demonstrate that M $^{2}$ HyCo improves node classification accuracy by an average of 0.4 percentage points and clustering performance by 5.72 and 8.72 points in NMI and ARI, respectively, over recent strong baselines, especially on Cora-A and Pubmed, thereby evidencing its effectiveness under high-order structural dependencies.
- 5 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2873-2888
Extracting Training Dialogue Data From Large Language Model-Based Task Bots
Large Language Models (LLMs) have been widely adopted to enhance Task-Oriented Dialogue Systems (TODS) by modeling complex language patterns and delivering contextually appropriate responses. However, this integration introduces significant privacy risks, as LLMs, functioning as soft knowledge bases that compress extensive training data into rich knowledge representations, can inadvertently memorize training dialogue data containing not only identifiable information such as phone numbers but also entire dialogue-level events like complete travel schedules. Despite the critical nature of this privacy concern, how LLM memorization is inherited in developing task bots remains unexplored. In this work, we address this gap through a systematic quantitative study that involves evaluating existing training data extraction attacks, analyzing key characteristics of task-oriented dialogue modeling that render existing methods ineffective, and proposing novel attack techniques tailored for LLM-based TODS that enhance both response sampling and membership inference. Experimental results demonstrate the effectiveness of our proposed data extraction attack. Our method can extract thousands of training labels of dialogue states with best-case precision exceeding 70%. Furthermore, we provide an in-depth analysis of training data memorization in LLM-based TODS by identifying and quantifying key influencing factors and discussing targeted mitigation strategies.
- 5 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 2873-2888
Extracting Training Dialogue Data From Large Language Model-Based Task Bots
Large Language Models (LLMs) have been widely adopted to enhance Task-Oriented Dialogue Systems (TODS) by modeling complex language patterns and delivering contextually appropriate responses. However, this integration introduces significant privacy risks, as LLMs, functioning as soft knowledge bases that compress extensive training data into rich knowledge representations, can inadvertently memorize training dialogue data containing not only identifiable information such as phone numbers but also entire dialogue-level events like complete travel schedules. Despite the critical nature of this privacy concern, how LLM memorization is inherited in developing task bots remains unexplored. In this work, we address this gap through a systematic quantitative study that involves evaluating existing training data extraction attacks, analyzing key characteristics of task-oriented dialogue modeling that render existing methods ineffective, and proposing novel attack techniques tailored for LLM-based TODS that enhance both response sampling and membership inference. Experimental results demonstrate the effectiveness of our proposed data extraction attack. Our method can extract thousands of training labels of dialogue states with best-case precision exceeding 70%. Furthermore, we provide an in-depth analysis of training data memorization in LLM-based TODS by identifying and quantifying key influencing factors and discussing targeted mitigation strategies.
- 2 January 2026
- Published by Springer Nature
- p. 337-351
TDTS: A Trusted Data Trading System Framework Based on Blockchain Data Identification and Private Information Retrieval
- 2 January 2026
- Published by Springer Nature
- p. 337-351
TDTS: A Trusted Data Trading System Framework Based on Blockchain Data Identification and Private Information Retrieval
- 18 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 305
Community-aware multi-granularity contrastive learning for graph anomaly detection
- 18 December 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 305
Community-aware multi-granularity contrastive learning for graph anomaly detection
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 9, 7822-7830
Attention-based Conditional Random Field for Financial Fraud Detection
Financial fraud detection is critical for market transparency and regulatory compliance. Existing methods often ignore the temporal patterns in financial data, which are essential for understanding dynamic financial behaviors and detecting fraud. Moreover, they also treat companies as independent entities, overlooking the valuable interrelationships. To address these issues, we propose ACRF-RNN, a Recurrent Neural Network (RNN) with Attention-based Conditional Random Field (CRF) for fraud detection. Specifically, we use an RNN with a sliding window to capture temporal dependencies from historical data, and an attention-based CRF feature transformer to model inter-company relationships. This transforms raw financial data into optimized features, fed into a multi-layer perceptron for classification. Besides, we also use the focal loss to alleviate the class imbalance problem caused by rare fraudulent cases. This work presents a novel real-world dataset to evaluate the performance of ACRF-RNN. Extensive experiments show that ACRF-RNN outperforms the state-of-the-art methods by 15.28% in KS and 4.04% in Recall. Data and code are available at: https://github.com/XNetLab/ACRF-RNN.git.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 9, 7822-7830
Open AccessAttention-based Conditional Random Field for Financial Fraud Detection
Financial fraud detection is critical for market transparency and regulatory compliance. Existing methods often ignore the temporal patterns in financial data, which are essential for understanding dynamic financial behaviors and detecting fraud. Moreover, they also treat companies as independent entities, overlooking the valuable interrelationships. To address these issues, we propose ACRF-RNN, a Recurrent Neural Network (RNN) with Attention-based Conditional Random Field (CRF) for fraud detection. Specifically, we use an RNN with a sliding window to capture temporal dependencies from historical data, and an attention-based CRF feature transformer to model inter-company relationships. This transforms raw financial data into optimized features, fed into a multi-layer perceptron for classification. Besides, we also use the focal loss to alleviate the class imbalance problem caused by rare fraudulent cases. This work presents a novel real-world dataset to evaluate the performance of ACRF-RNN. Extensive experiments show that ACRF-RNN outperforms the state-of-the-art methods by 15.28% in KS and 4.04% in Recall. Data and code are available at: https://github.com/XNetLab/ACRF-RNN.git.