Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yidong Jiang

dblp:385/4955 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Graph learning · 50% Trustworthy machine learning · 27% Generative modeling · 23%
Network and information security
1 paper
Security and privacy of machine learning · 100%
Computer networks
1 paper
Cellular and mobile networks · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.012026
SoftHist: Teaching Graph Injection Attackers to Camouflage with Memory · WSDM 2026
Machine learning › Trustworthy machine learning
robustness
1.012026
SoftHist: Teaching Graph Injection Attackers to Camouflage with Memory · WSDM 2026
Cellular and mobile networks
5g
1.012026
Needle in a Haystack: Tracking UAVs from Massive Noise in Real-World 5G-A Base Station Data · MobiSys 2026
Security and privacy of machine learning
adversarial attack
1.012026
SoftHist: Teaching Graph Injection Attackers to Camouflage with Memory · WSDM 2026
Security and privacy of machine learning › graph neural network security
graph injection attack
1.012026
SoftHist: Teaching Graph Injection Attackers to Camouflage with Memory · WSDM 2026
Machine learning › Generative modeling › generative model › structured generative models
dynamic graph generative models
0.912025
Generative Dynamic Graph Representation Learning for Conspiracy Spoofing Detection · WWW 2025
Machine learning › Graph learning
dynamic graph learning
0.912025
Generative Dynamic Graph Representation Learning for Conspiracy Spoofing Detection · WWW 2025
Computational finance and economics
financial fraud detection
0.912025
Generative Dynamic Graph Representation Learning for Conspiracy Spoofing Detection · WWW 2025
Cellular and mobile networks
cellular network analytics
0.312026
Needle in a Haystack: Tracking UAVs from Massive Noise in Real-World 5G-A Base Station Data · MobiSys 2026
Security and privacy of machine learning › adversarial attack
black-box attack
0.312026
SoftHist: Teaching Graph Injection Attackers to Camouflage with Memory · WSDM 2026
Data mining
anomaly detection
0.312025
Generative Dynamic Graph Representation Learning for Conspiracy Spoofing Detection · WWW 2025

Methods — techniques the papers use, named apart from their topics

pseudo-labeling · 2.6neural ordinary differential equation · 2.6heterogeneous graph aggregation · 2.6gated recurrent unit · 2.6topology-aware edge sampling · 2.0softened embedding · 2.0reinforcement learning · 2.0signal processing · 1.0anomaly detection · 1.0
YearPublicationVenuePosition
2026 Needle in a Haystack: Tracking UAVs from Massive Noise in Real-World 5G-A Base Station Data
Chengzhen Meng, Chenming He, Yidong Jiang, Xiaoran Fan, Dequan Wang, Jianmin Ji, Yanyong Zhang
MobiSys3
2026 SoftHist: Teaching Graph Injection Attackers to Camouflage with Memory
abstract
Graph Neural Networks (GNNs) have achieved notable success in a wide range of applications. However, their vulnerability to adversarial attacks, particularly graph injection attacks (GIAs), raises serious concerns for their deployment in security-sensitive domains. Existing GIA methods, despite their demonstrated effectiveness, face several inherent limitations. They typically require training surrogate models to approximate the victim model's behavior, which may lead to performance degradation when the surrogate mismatches the target model. Furthermore, the discrete nature of graph data poses challenges for generating effective adversarial features, often resulting in suboptimal solutions. Most critically, these methods show markedly reduced effectiveness when deployed against defended GNN models, limiting real-world applicability. To address these challenges, we introduce SoftHist, a novel gradient-free reinforcement learning framework for black-box graph injection attacks. Our approach incorporates a softened embedding mechanism to avoid suboptimal feature generation, ensuring stable and stealthy node injection. Moreover, we design a topology-aware edge sampler and a defense-aware policy learner with adaptive history reuse optimized for misclassification maximization. These innovations collectively balance attack effectiveness, stealthiness, and robustness against defensive measures. Extensive experiments on eight benchmark datasets demonstrate SoftHist's significant advantages in key scenarios: (1) On discrete-feature datasets like AMComputer, the misclassification rate is 10.34%~38.09% higher than baseline methods; (2) Against defensive models such as RGCN, it maintains 98.23% success rate, surpassing state-of-the-art methods by 12.36%.
Yidong Jiang, Ziwen Xu, Linbo Shao, Peng Zhu 0002, Dawei Cheng
WSDM1
2025 Generative Dynamic Graph Representation Learning for Conspiracy Spoofing Detection
abstract
Spoofing detection in financial trading is crucial, especially for identifying complex behaviors such as conspiracy spoofing. Traditional machine-learning approaches primarily focus on isolated node features, often overlooking the broader context of interconnected nodes. Graph-based techniques, particularly Graph Neural Networks (GNNs), have advanced the field by leveraging relational information effectively. However, in real-world spoofing detection datasets, trading behaviors exhibit dynamic, irregular patterns. Existing spoofing detection methods, though effective in some scenarios, struggle to capture the complexity of dynamic and diverse, evolving inter-node relationships. To address these challenges, we propose a novel framework called the Generative Dynamic Graph Model (GDGM), which models dynamic trading behaviors and the relationships among nodes to learn representations for conspiracy spoofing detection. Specifically, our approach incorporates the generative dynamic latent space to capture the temporal patterns and evolving market conditions. Raw trading data is first converted into time-stamped sequences. Then we model trading behaviors using the neural ordinary differential equations and gated recurrent units, to generate the representation incorporating temporal dynamics of spoofing patterns. Furthermore, pseudo-label generation and heterogeneous aggregation techniques are employed to gather relevant information and enhance the detection performance for conspiratorial spoofing behaviors. Experiments conducted on spoofing detection datasets demonstrate that our approach outperforms state-of-the-art models in detection accuracy. Additionally, our spoofing detection system has been successfully deployed in one of the largest global trading markets, further validating the practical applicability and performance of the proposed method.
Sheng Xiang 0001, Yidong Jiang, Yunting Chen, Dawei Cheng, Guoping Zhao, Changjun Jiang 0002
WWW2
2024 DPA-RCNN: Dual Position Aware 3D Object Detector for Point Cloud
abstract
In this paper, we explore the impact of the spatial properties of point clouds on 3D object detection in autonomous driving scenarios. To reduce the memory and computational costs, existing point-based models typically use random sampling or the farthest point sampling strategy to retain the foreground points or points closer to the center of the object. However, they treated points with different spatial properties equally, which led to the loss of potential relative geometric information in the point cloud. To this end, we design a two-stage detector that fully exploits the spatial properties of point clouds, termed Dual Position Aware 3D Object Detector(DPA-RCNN). Specifically, we first sample more points close to the object center by exploiting the relative position information between points and the object center. These sampling points can generate more precisely positioned proposals, which can reduce the difficulty of subsequent bounding box regression stages. In addition, we use the distance from the point to the edge of the bounding box to learn edge features in proposals, which further improves the regression accuracy of the bounding box. Experiments on KITTI and ONCE datasets validate the superiority and universality of our approach. Our method outperforms all point-based detectors, and the proposed Edge Point-aware Segmentation Module(EPAS) can effectively improve the detection accuracy of two-stage detectors.
Yidong Jiang, Qing Xie 0002, Jiachen Li 0002, Jinyu Xu 0001, Yongjian Liu, Yanchun Ma
IJCNN1