Xindong Wu
Biographic Data
| ID | 7170253 |
|---|---|
| NAME | Xindong Wu |
| GIVEN NAMES | Xindong |
| FAMILY NAME | Wu |
| SIGNATURE | WU X |
| AFFILIATIONS | Hefei University of Technology |
| ORCID | 0000-0003-2396-1704 |
| VERIFIED | Yes |
| TOTAL WORKS | 11 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 10 |
| EDITOR COUNT | 1 |
| FIRST PUBLICATION YEAR | 2008 |
| LATEST PUBLICATION YEAR | 2026 |
| H-INDEX | 0 |
Where to Go: A Spatial Social Force Graph Neural Network for Predicting Pedestrian Trajectories From Videos With Complex Motion Scenarios
Traditional pedestrian trajectory prediction models focus on spatio–temporal data without proper consideration of individual interactions with the environment, mutual interactions, and contextual information, resulting in low prediction performance in real applications. In this article, we propose a new pedestrian trajectory prediction model called spatial social force graph neural network (SSF-GNN). First, SSF-GNN adopts a gate recurrent unit (G…
Heterogeneous Neighborhood-Enhanced Graph Contrastive Learning for Recommendation
Heterogeneous self-supervised graph learning has gained considerable attention in recommender systems for its ability to capture diverse semantic and structural relationships in real-world data. Contrastive learning enhances representation learning by maximizing agreement between positive pairs while distinguishing negative ones in cross-views. However, two key challenges remain: 1) noise, such as false negatives, that degrades representation qua…
Optimizing Feature Interaction via Information Bottleneck for CTR Prediction
Click-through rate (CTR) prediction plays a pivotal role in recommender systems and online advertising by estimating the probability of user engagement with recommended items or advertisements. However, existing methodologies encounter multiple challenges. First, current approaches often struggle to maintain robustness in the presence of noise. This challenge arises from the inherent complexity of real-world data, where noisy or irrelevant featur…
Enhancing Explainable Sequential Recommendation With Disentangled Representations and Auxiliary Review Explanations
Intent-Aware Contrastive Learning for Cross-Domain Recommendation
Accurately capturing user preferences across diverse domains is a fundamental challenge in cross-domain recommendation (CDR) systems. Recent literature has established that disentangling user preferences into global and domain-specific components significantly enhances recommendation performance. However, existing CDR systems are hindered by two critical challenges: 1) how to align user representations across domains to accommodate the discrepanc…
Dynamic Graph Learning to Denoise Implicit Feedback for Graph Collaborative Filtering
Due to the inherent challenges in acquiring explicit feedback, graph collaborative filtering (GCF) models often resort to implicit feedback. However, there exists noise in implicit feedback that may not accurately reflect users’ preferences. This noise will be amplified by the aggregating and propagating operations of GCF, thereby affecting the performance of GCF. Existing noise mitigation methods attempt to filter noisy samples from implicit fee…
A Cognitive Diagnosis Model With Nonlinear Dependence Between Students and Exercises
Cognitive diagnosis (CD) aims to discover students’ mastery of knowledge concepts through response logs and it is an important task in intelligence education. CD is generally performed with the advantage of students doing exercises, which is learned by linear interacting between student proficiency and exercise difficulty. However, existing methods represent the proficiency and difficulty in view of knowledge concepts independently, which is in c…
Adversarial Heterogeneous Graph Neural Network for Robust Recommendation
Recommendation systems play a vital role in identifying the hidden interactions between users and items in online social networks. Recently, graph neural networks (GNNs) have exhibited significant performance gains by modeling the information propagation process in graph-structured data for a recommendation. However, existing GNN-based methods do not have broad applicability to heterogeneous graphs that integrate auxiliary data with diverse types…
A twitter recruitment intelligent system: Association rule mining for smoking cessation
The Top Ten Algorithms in Data Mining
Identifying some of the most influential algorithms that are widely used in the data mining community, this volume provides a description of each algorithm, discusses the impact of the algorithms, and reviews current and future research on the algorithms. Thoroughly evaluated by independent reviewers, each chapter focuses on a particular algorithm and is written by either the original authors of the algorithm or world-class researchers who have e…
Top 10 algorithms in data mining
No prominent works on this page.
Top 10 algorithms in data mining
The Top Ten Algorithms in Data Mining
Identifying some of the most influential algorithms that are widely used in the data mining community, this volume provides a description of each algorithm, discusses the impact of the algorithms, and reviews current and future research on the algorithms. Thoroughly evaluated by independent reviewers, each chapter focuses on a particular algorithm and is written by either the original authors of the algorithm or world-class researchers who have e…
A twitter recruitment intelligent system: Association rule mining for smoking cessation
Adversarial Heterogeneous Graph Neural Network for Robust Recommendation
Recommendation systems play a vital role in identifying the hidden interactions between users and items in online social networks. Recently, graph neural networks (GNNs) have exhibited significant performance gains by modeling the information propagation process in graph-structured data for a recommendation. However, existing GNN-based methods do not have broad applicability to heterogeneous graphs that integrate auxiliary data with diverse types…
Dynamic Graph Learning to Denoise Implicit Feedback for Graph Collaborative Filtering
Due to the inherent challenges in acquiring explicit feedback, graph collaborative filtering (GCF) models often resort to implicit feedback. However, there exists noise in implicit feedback that may not accurately reflect users’ preferences. This noise will be amplified by the aggregating and propagating operations of GCF, thereby affecting the performance of GCF. Existing noise mitigation methods attempt to filter noisy samples from implicit fee…
A Cognitive Diagnosis Model With Nonlinear Dependence Between Students and Exercises
Cognitive diagnosis (CD) aims to discover students’ mastery of knowledge concepts through response logs and it is an important task in intelligence education. CD is generally performed with the advantage of students doing exercises, which is learned by linear interacting between student proficiency and exercise difficulty. However, existing methods represent the proficiency and difficulty in view of knowledge concepts independently, which is in c…
Where to Go: A Spatial Social Force Graph Neural Network for Predicting Pedestrian Trajectories From Videos With Complex Motion Scenarios
Traditional pedestrian trajectory prediction models focus on spatio–temporal data without proper consideration of individual interactions with the environment, mutual interactions, and contextual information, resulting in low prediction performance in real applications. In this article, we propose a new pedestrian trajectory prediction model called spatial social force graph neural network (SSF-GNN). First, SSF-GNN adopts a gate recurrent unit (G…
Heterogeneous Neighborhood-Enhanced Graph Contrastive Learning for Recommendation
Heterogeneous self-supervised graph learning has gained considerable attention in recommender systems for its ability to capture diverse semantic and structural relationships in real-world data. Contrastive learning enhances representation learning by maximizing agreement between positive pairs while distinguishing negative ones in cross-views. However, two key challenges remain: 1) noise, such as false negatives, that degrades representation qua…
Optimizing Feature Interaction via Information Bottleneck for CTR Prediction
Click-through rate (CTR) prediction plays a pivotal role in recommender systems and online advertising by estimating the probability of user engagement with recommended items or advertisements. However, existing methodologies encounter multiple challenges. First, current approaches often struggle to maintain robustness in the presence of noise. This challenge arises from the inherent complexity of real-world data, where noisy or irrelevant featur…
Enhancing Explainable Sequential Recommendation With Disentangled Representations and Auxiliary Review Explanations
Intent-Aware Contrastive Learning for Cross-Domain Recommendation
Accurately capturing user preferences across diverse domains is a fundamental challenge in cross-domain recommendation (CDR) systems. Recent literature has established that disentangling user preferences into global and domain-specific components significantly enhances recommendation performance. However, existing CDR systems are hindered by two critical challenges: 1) how to align user representations across domains to accommodate the discrepanc…
Computer Science (7 works) · Recommender Systems and Techniques (5 works) · Artificial Intelligence (4 works) · Data mining (4 works) · Graph (4 works) · Advanced Graph Neural Networks (3 works) · Machine learning (3 works) · Theoretical Computer Science (3 works) · Algorithm (2 works) · Artificial neural network (2 works)