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

Yuxin Cai 0001

dblp:178/5637-1 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0002-8452-4479ORCID · verified

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

Databases, data management, data science and information retrieval · 2 · 2 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
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
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
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
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.3
YearPublicationVenuePosition
2026 CONDEN-FI: Consistency and Diversity Learning-Based Multi-View Unsupervised Feature and Instance Co-Selection
Yanyong Huang, Yuxin Cai 0001, Dongjie Wang 0001, Xiuwen Yi, Tianrui Li 0001
IEEE Trans. Knowl. Data Eng.2
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.3