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

Junlong Ke

dblp:417/8417 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0006-5723-3341ORCID · reported

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
3 papers
Representation and self-supervised learning · 50% Graph learning · 36% Vision and language · 14%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › multi-view learning
multi-view clustering
1.012026
Enhancing Multi-View Clustering: A Sufficient Information-Theoretic Approach for Consistency Acquisition and Redundancy Elimination · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Machine learning › Representation and self-supervised learning
contrastive learning
0.912025
Multi-View Graph Clustering via Node-Guided Contrastive Encoding · ICML 2025
Machine learning › Graph learning
graph clustering
0.912025
Multi-View Graph Clustering via Node-Guided Contrastive Encoding · ICML 2025
Machine learning › Representation and self-supervised learning › contrastive learning
graph contrastive learning
0.912025
Multi-View Graph Clustering via Node-Guided Contrastive Encoding · ICML 2025
Machine learning › Graph learning › graph clustering
multi-view graph clustering
0.912025
Multi-View Graph Clustering via Node-Guided Contrastive Encoding · ICML 2025
Data mining
clustering
0.812024
Integrating Vision-Language Semantic Graphs in Multi-View Clustering · IJCAI 2024
Data mining › clustering
multi-view clustering
0.812024
Integrating Vision-Language Semantic Graphs in Multi-View Clustering · IJCAI 2024
Machine learning › Graph learning
graph neural network
0.312025
Multi-View Graph Clustering via Node-Guided Contrastive Encoding · ICML 2025

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

vision-language model · 1.5graph learning · 1.5variational analysis · 1.0sufficient representation lower bound · 1.0node-guided contrastive encoding · 0.9GNN · 0.9
YearPublicationVenuePosition
2026 Enhancing Multi-View Clustering: A Sufficient Information-Theoretic Approach for Consistency Acquisition and Redundancy Elimination
abstract
Multi-view clustering (MVC) has gained widespread recognition as a valuable technique for enhancing clustering performance by harnessing diverse data sources. Nonetheless, current methods mainly concentrate on obtaining consistent information, often ignoring the risk of redundant information across different views. In this study, we propose a novel methodology, called Sufficient Multi-View Clustering (STMVC), which evaluates the multi-view clustering framework through an information-theoretic lens, intending to learn inter-view consistency information while removing redundant information among views. Specifically, we first utilize variational analysis to extract inter-view consistency information, and to further enhance the consistency information and minimize the redundant information between different views, we propose a sufficient representation lower bound. Furthermore, in order to improve the adaptability and generalizability of our proposed approach, we expand the application of STMVC to single-view scenarios and incomplete multi-view scenarios. The STMVC method provides a promising solution to the challenge of multi-view clustering and introduces a fresh perspective for analyzing multi-view data. To validate our model, we conducted a theoretical analysis based on the Bayesian error rate, and experiments on several multi-view datasets and single-view datasets show the outstanding performance of STMVC.
Yazhou Ren 0001, Zichen Wen, Junlong Ke, Chenhang Cui, Yonghao Huang, Xinyue Chen 0004, Philip S. Yu, Lifang He 0001
IEEE Trans. Pattern Anal. Mach. Intell.3
2025 Multi-View Graph Clustering via Node-Guided Contrastive Encoding
abstract
Multi-view clustering has gained significant attention for integrating multi-view information in multimedia applications. With the growing complexity of graph data, multi-view graph clustering (MVGC) has become increasingly important. Existing methods primarily use Graph Neural Networks (GNNs) to encode structural and feature information, but applying GNNs within contrastive learning poses specific challenges, such as integrating graph data with node features and handling both homophilic and heterophilic graphs. To address these challenges, this paper introduces Node-Guided Contrastive Encoding (NGCE), a novel MVGC approach that leverages node features to guide embedding generation. NGCE enhances compatibility with GNN filtering, effectively integrates homophilic and heterophilic information, and strengthens contrastive learning across views. Extensive experiments demonstrate its robust performance on six homophilic and heterophilic multi-view benchmark datasets.
Yazhou Ren 0001, Junlong Ke, Zichen Wen, Yang Yang 0002, Xiaorong Pu, Lifang He 0001
ICML2
2024 Integrating Vision-Language Semantic Graphs in Multi-View Clustering
Junlong Ke, Zichen Wen, Yechenhao Yang, Chenhang Cui, Yazhou Ren 0001, Xiaorong Pu, Lifang He 0001
IJCAI1