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

Henghui Jiang

dblp:395/6653 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2025
0009-0000-5910-3862ORCID · corroborated

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

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

Artificial intelligence
1 paper
Representation and self-supervised learning · 50% Learning theory · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
generalization bounds
0.912025
Sharper Error Bounds in Late Fusion Multi-view Clustering with Eigenvalue Proportion Optimization · AAAI 2025
Machine learning › Representation and self-supervised learning › multi-view learning
multi-view clustering
0.912025
Sharper Error Bounds in Late Fusion Multi-view Clustering with Eigenvalue Proportion Optimization · AAAI 2025
Machine learning › Representation and self-supervised learning
multi-view learning
0.912025
Sharper Error Bounds in Late Fusion Multi-view Clustering with Eigenvalue Proportion Optimization · AAAI 2025
Machine learning › Learning theory › generalization bounds
rademacher complexity
0.912025
Sharper Error Bounds in Late Fusion Multi-view Clustering with Eigenvalue Proportion Optimization · AAAI 2025

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

multiple kernel k-means · 0.9low-pass graph filtering · 0.9eigenvalue proportion optimization · 0.9
YearPublicationVenuePosition
2025 Sharper Error Bounds in Late Fusion Multi-view Clustering with Eigenvalue Proportion Optimization
abstract
Multi-view clustering (MVC) aims to integrate complementary information from multiple views to enhance clustering performance. Late Fusion Multi-View Clustering (LFMVC) has shown promise by synthesizing diverse clustering results into a unified consensus. However, current LFMVC methods struggle with noisy and redundant partitions and often fail to capture high-order correlations across views. To address these limitations, we present a novel theoretical framework for analyzing the generalization error bounds of multiple kernel k-means, leveraging local Rademacher complexity and principal eigenvalue proportions. Our analysis establishes a convergence rate of O(1/n), significantly improving upon the existing rate in the order of O(sqrt(k/n)). Building on this insight, we propose a low-pass graph filtering strategy within a multiple linear K-means framework to mitigate noise and redundancy, further refining the principal eigenvalue proportion and enhancing clustering accuracy. Experimental results on benchmark datasets confirm that our approach outperforms state-of-the-art methods in clustering performance and robustness.
Liang Du 0003, Henghui Jiang, Yiqing Guo, Yan Chen 0036, Feijiang Li, Peng Zhou 0006
AAAI2
2025 Scalable Multi-View Clustering via Bipartite Graph Consensus Filtering
abstract
As data sources and modalities become more diverse, existing multi-view graph clustering methods face high computational complexity, hindering scalability. Bipartite graph clustering overcomes this by using anchors to build association graphs, reducing complexity to linear time. However, the quality of bipartite graphs and the neglect of higher-order correlations remain significant limitations. To tackle these challenges, we propose MCBGF, a scalable bipartite graph-based multi-view clustering method enhanced by consensus graph filtering. By integrating the original bipartite structure to counteract degradation from over-smoothing in high-order filters, MCBGF achieves robust and consistent performance. With linear time complexity, MCBGF efficiently processes large-scale datasets and consistently outperforms state-of-the-art methods in experimental evaluations. The code has been released at https://github.com/sxuHui/MCBGF.
Henghui Jiang, Yiqing Guo, Yan Chen 0036, Liang Du 0003
ICIP1
2025 Enhanced Multi-View Clustering with Multiple Linear Graph Filtering
Henghui Jiang, Liang Du 0003
ICMR1
2025 Late Fusion Multiple Kernel Clustering Refined via Optimal Linear Graph Filtering
Henghui Jiang, Yiqing Guo, Yan Chen 0036, Liang Du 0003
ECML/PKDD (1)1
2025 A scalable Consensus Fast Graph Filtering approach for late fusion multi-view clustering
Yiqing Guo, Henghui Jiang, Yan Chen 0036, Liang Du 0003
Signal Process.2