Lei Duan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Lei Duan has a total of 160 co-authors. Here are the top co-authors by number of shared publications:
- Xinye Wang
Tiangong University, Tianjin, China
15 shared publications - Chengxin He
School of Computer Science, Sichuan University, Chengdu, China
12 shared publications Jyrki Nummenmaa
Tampere University
9 shared publications- Huiru Zheng
School of Computing, Ulster University, Belfast, United Kingdom
7 shared publications - Zhenyang Yu
Sichuan University
7 shared publications - Chang-Jie Tang
Sichuan University
6 shared publications
Latest Publications
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38  (9) , 5798-5810
Dynamic Anchor-Based One-Step Hypergraph Ensemble Clustering
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 38  (9) , 5798-5810
Dynamic Anchor-Based One-Step Hypergraph Ensemble Clustering
- 19 July 2026
- Published by Springer Nature
- p. 203-214
Frequency Energy Adaptive Normalization for Non-Stationary Time Series Forecasting
- 19 July 2026
- Published by Springer Nature
- p. 203-214
Frequency Energy Adaptive Normalization for Non-Stationary Time Series Forecasting
- 12 May 2026
- Published by Springer Nature
- p. 149-164
AURORA: An Adaptive Multi-granularity Graph Learning Framework for Drug Repositioning
- 12 May 2026
- Published by Springer Nature
- p. 149-164
AURORA: An Adaptive Multi-granularity Graph Learning Framework for Drug Repositioning
- 23 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
Generating plausible counterfactual instances for anomaly interpretation with generative adversarial networks
- 23 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
Generating plausible counterfactual instances for anomaly interpretation with generative adversarial networks
- 3 March 2026
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 68  (1) , 91
SADD-RFCO: semi-supervised anomalous data detection based on random forest with co-training
- 3 March 2026
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 68  (1) , 91
SADD-RFCO: semi-supervised anomalous data detection based on random forest with co-training
- 2 February 2026
- Published by Springer Nature
- p. 123-130
Contrastive Learning Enhanced Semi-supervised Anomaly Detection
- 2 February 2026
- Published by Springer Nature
- p. 123-130
Contrastive Learning Enhanced Semi-supervised Anomaly Detection
- 30 January 2026
- Published by Springer Nature
- p. 81-96
Global-Memory and Local-Representation Based Framework for Streaming Anomaly Detection
- 30 January 2026
- Published by Springer Nature
- p. 81-96
Global-Memory and Local-Representation Based Framework for Streaming Anomaly Detection
- 2 January 2026
- Published by Springer Nature
- p. 165-180
MVIC: Multi-view Information Collaborative Fusion for Drug-Drug Interaction Prediction
- 2 January 2026
- Published by Springer Nature
- p. 165-180
MVIC: Multi-view Information Collaborative Fusion for Drug-Drug Interaction Prediction
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. PP, 1-15
Where and How: Mining Convertible Outlying Aspect for Outlier Interpretation
Outlier interpretation methods, based on outlying aspect mining, have been extensively utilized in diverse applications due to their effectiveness and interpretability. The primary objective of these methods is to identify an outlying feature subspace where a detected outlier deviates most significantly from the inliers. However, this subspace is typically not personalized and incomplete. In this article, we propose a novel convertible outlying aspect mining method named Mining convErtible ouTlying Aspect (META) to interpret the detected outlier. META not only identifies a personalized outlying feature subspace (i.e., where) that differentiates the detected outlier from inliers, but also quantifies the outlying direction and degree within this subspace (i.e., how), thereby offering actionable interpretative insights, rather than corrective actions, for understanding the outlier. Specifically, META defines a convertible outlying aspect with a convertible cost to convert the detected outlier into a converted instance, and employs a pretrained adversary to evaluate whether the instance is an inlier or not. Subsequently, we formulate an objective function that minimizes the convertible cost, ensures the successful conversion of the instance into an inlier, and minimizes the size of the outlying feature subspace. META leverages this objective function to learn an optimal convertible outlying aspect for the detected outlier. The optimal convertible outlying aspect provides the outlying feature subspace, outlying direction, outlying degree, and converted instance. Empirical results from experiments conducted on both real-world and synthetic datasets demonstrate that META outperforms state-of-the-art (SOTA) baselines.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. PP, 1-15
Where and How: Mining Convertible Outlying Aspect for Outlier Interpretation
Outlier interpretation methods, based on outlying aspect mining, have been extensively utilized in diverse applications due to their effectiveness and interpretability. The primary objective of these methods is to identify an outlying feature subspace where a detected outlier deviates most significantly from the inliers. However, this subspace is typically not personalized and incomplete. In this article, we propose a novel convertible outlying aspect mining method named Mining convErtible ouTlying Aspect (META) to interpret the detected outlier. META not only identifies a personalized outlying feature subspace (i.e., where) that differentiates the detected outlier from inliers, but also quantifies the outlying direction and degree within this subspace (i.e., how), thereby offering actionable interpretative insights, rather than corrective actions, for understanding the outlier. Specifically, META defines a convertible outlying aspect with a convertible cost to convert the detected outlier into a converted instance, and employs a pretrained adversary to evaluate whether the instance is an inlier or not. Subsequently, we formulate an objective function that minimizes the convertible cost, ensures the successful conversion of the instance into an inlier, and minimizes the size of the outlying feature subspace. META leverages this objective function to learn an optimal convertible outlying aspect for the detected outlier. The optimal convertible outlying aspect provides the outlying feature subspace, outlying direction, outlying degree, and converted instance. Empirical results from experiments conducted on both real-world and synthetic datasets demonstrate that META outperforms state-of-the-art (SOTA) baselines.
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 2197-2206
Balanced Multiple Kernel Clustering with Discrete Partition Entropy Auto Regularization
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 2197-2206
Open AccessBalanced Multiple Kernel Clustering with Discrete Partition Entropy Auto Regularization