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

Zongxin Shen

dblp:282/0288 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
2 papers
Data mining · 100%
Artificial intelligence
2 papers
Representation and self-supervised learning · 88% Graph learning · 12%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
1.722026
Causally-Aware Unsupervised Feature Selection Learning · IEEE Trans. Image Process. 2026
C2IMUFS: Complementary and Consensus Learning-Based Incomplete Multi-View Unsupervised Feature Selection · IEEE Trans. Knowl. Data Eng. 2023
Data mining › dimensionality reduction
feature selection
1.722026
Causally-Aware Unsupervised Feature Selection Learning · IEEE Trans. Image Process. 2026
C2IMUFS: Complementary and Consensus Learning-Based Incomplete Multi-View Unsupervised Feature Selection · IEEE Trans. Knowl. Data Eng. 2023
Data mining › clustering
spectral clustering
1.012026
Causally-Aware Unsupervised Feature Selection Learning · IEEE Trans. Image Process. 2026
Data mining › dimensionality reduction › feature selection
unsupervised feature selection
1.012026
Causally-Aware Unsupervised Feature Selection Learning · IEEE Trans. Image Process. 2026
Machine learning › Representation and self-supervised learning
multi-view learning
0.812024
Unified View Imputation and Feature Selection Learning for Incomplete Multi-view Data · IJCAI 2024
Data mining › clustering › multi-view clustering
incomplete multi-view clustering
0.712023
C2IMUFS: Complementary and Consensus Learning-Based Incomplete Multi-View Unsupervised Feature Selection · IEEE Trans. Knowl. Data Eng. 2023
Data mining › clustering
multi-view clustering
0.712023
C2IMUFS: Complementary and Consensus Learning-Based Incomplete Multi-View Unsupervised Feature Selection · IEEE Trans. Knowl. Data Eng. 2023
Data mining › dimensionality reduction › feature selection › unsupervised feature selection
multi-view unsupervised feature selection
0.712023
C2IMUFS: Complementary and Consensus Learning-Based Incomplete Multi-View Unsupervised Feature Selection · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Graph learning › graph structure learning
similarity graph learning
0.212023
C2IMUFS: Complementary and Consensus Learning-Based Incomplete Multi-View Unsupervised Feature Selection · IEEE Trans. Knowl. Data Eng. 2023

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

spectral graph learning · 1.3sparse regularization · 1.3non-negative matrix factorization · 1.3spectral regression · 1.0causality-guided hierarchical clustering · 1.0causal regularizer · 1.0view imputation · 0.8feature selection · 0.8
YearPublicationVenuePosition
2026 Causally-Aware Unsupervised Feature Selection Learning
abstract
Unsupervised feature selection (UFS) has recently gained attention for its effectiveness in processing unlabeled high-dimensional data. However, existing methods overlook the intrinsic causal mechanisms within the data, resulting in the selection of irrelevant features and poor interpretability. Additionally, previous graph-based methods fail to account for the differing impacts of non-causal and causal features in constructing the similarity graph, which leads to false links in the generated graph. To address these issues, a novel UFS method, called Causally-Aware UnSupErvised Feature Selection learning (CAUSE-FS), is proposed. CAUSE-FS introduces a novel causal regularizer that reweights samples to balance the confounding distribution of each treatment feature. This regularizer is subsequently integrated into a generalized unsupervised spectral regression model to mitigate spurious associations between features and clustering labels, thus achieving causal feature selection. Furthermore, CAUSE-FS employs causality-guided hierarchical clustering to partition features with varying causal contributions into multiple granularities. By integrating similarity graphs learned adaptively at different granularities, CAUSE-FS increases the importance of causal features when constructing the fused similarity graph to capture the reliable local structure of data. Extensive experimental results demonstrate the superiority of CAUSE-FS over state-of-the-art methods, with its interpretability further validated through feature visualization.
Zongxin Shen, Yanyong Huang, Dongjie Wang 0001, Minbo Ma, Fengmao Lv, Tianrui Li 0001
IEEE Trans. Image Process.1
2024 Unified View Imputation and Feature Selection Learning for Incomplete Multi-view Data
Yanyong Huang, Zongxin Shen, Tianrui Li 0001, Fengmao Lv
IJCAI2
2023 C2IMUFS: Complementary and Consensus Learning-Based Incomplete Multi-View Unsupervised Feature Selection
abstract
Multi-view unsupervised feature selection (MUFS) has been demonstrated as an effective technique to reduce the dimensionality of multi-view unlabeled data. The existing methods assume that all of views are complete. However, multi-view data are usually incomplete, i.e., a part of instances are presented on some views but not all views. Besides, learning the complete similarity graph, as an important promising technology in existing MUFS methods, cannot achieve due to the missing views. In this paper, we propose a complementary and consensus learning-based incomplete multi-view unsupervised feature selection method (C$^{2}$IMUFS) to address the aforementioned issues. Concretely, C$^{2}$IMUFS integrates feature selection into an extended weighted non-negative matrix factorization model equipped with adaptive learning of view-weights and a sparse$\ell _{2,p}$-norm, which can offer better adaptability and flexibility. By the sparse linear combinations of multiple similarity matrices derived from different views, a complementary learning-guided similarity matrix reconstruction model is presented to obtain the complete similarity graph in each view. Furthermore, C$^{2}$IMUFS learns a consensus clustering indicator matrix across different views and embeds it into a spectral graph term to preserve the local geometric structure. Comprehensive experimental results on real-world datasets demonstrate the effectiveness of C$^{2}$IMUFS compared with state-of-the-art methods.
Yanyong Huang, Zongxin Shen, Yuxin Cai 0001, Xiuwen Yi, Dongjie Wang 0001, Fengmao Lv, Tianrui Li 0001
IEEE Trans. Knowl. Data Eng.2
2022 T-copula and Wasserstein distance-based stochastic neighbor embedding
Yanyong Huang, Kejun Guo, Xiuwen Yi, Zongxin Shen, Tianrui Li 0001
Knowl. Based Syst.5
2021 Adaptive graph-based generalized regression model for unsupervised feature selection
Yanyong Huang, Zongxin Shen, Fuxu Cai, Tianrui Li 0001, Fengmao Lv
Knowl. Based Syst.2