Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jiale Zou
dblp:385/3342
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0004-0569-8353ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 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 |
Trustworthy machine learning · 44% Speech recognition and synthesis · 44% Graph learning · 13% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Speech recognition and synthesis › noise robustness
noise-robust clustering |
0.9 | 1 | 2025 | Robust Tensor Learning with Graph Diffusion for Scalable Multi-view Graph Clustering · ACM Multimedia 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.9 | 1 | 2025 | Robust Tensor Learning with Graph Diffusion for Scalable Multi-view Graph Clustering · ACM Multimedia 2025 |
Data mining › clustering › graph clustering
bipartite graph clustering |
0.9 | 1 | 2025 | Robust Tensor Learning with Graph Diffusion for Scalable Multi-view Graph Clustering · ACM Multimedia 2025 |
Data mining
clustering |
0.9 | 1 | 2025 | Robust Tensor Learning with Graph Diffusion for Scalable Multi-view Graph Clustering · ACM Multimedia 2025 |
Data mining › clustering
graph clustering |
0.9 | 1 | 2025 | Robust Tensor Learning with Graph Diffusion for Scalable Multi-view Graph Clustering · ACM Multimedia 2025 |
Data mining › clustering
multi-view clustering |
0.9 | 1 | 2025 | Robust Tensor Learning with Graph Diffusion for Scalable Multi-view Graph Clustering · ACM Multimedia 2025 |
Machine learning › Graph learning
graph diffusion |
0.3 | 1 | 2025 | Robust Tensor Learning with Graph Diffusion for Scalable Multi-view Graph Clustering · ACM Multimedia 2025 |
Methods — techniques the papers use, named apart from their topics
tensor learning · 1.7tensor exponential norm · 1.7graph diffusion · 1.7nonconvex optimization · 0.9non-convex optimization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Consensus Graph Filter Learning for Multiple Graph ClusteringabstractMulti-view Clustering (MVC) has gained significant attention for its ability to utilize consistent and complementary information from multiple views. Graph filter-based MVC methods have recently demonstrated promising performance, attracting growing interest. However, existing graph filter-based methods typically rely on a single filter for each view. These filters are usually derived from either a specific view or a consensus graph across all views, which limits their effectiveness in fully integrating multi-view information. To address this limitation, we propose a novel method, Consensus Graph Filter Learning for Multiple Graph Clustering (CGFMVC). Unlike existing methods that rely on a single filter per view, we construct multiple graph filters by integrating information from all views. For each view, we generate intra-view graph filters to intermediate high-order information and bridge local-global structures. This approach facilitates neighborhood smoothing and preserves local consistency within each view. By learning a consensus graph filter from these multiple filters, we effectively capture global complementary information across views while preserving local consistency. CGFMVC demonstrates excellent efficiency and effectiveness on various benchmark datasets, outperforming state-of-the-art methods. The code is publicly available at https://github.com/Sean-zjl/CGFMVC. Jiale Zou, Yan Chen 0036, Peng Zhou 0006, Liang Du 0003 |
ICASSP | 1 |
| 2025 | Robust Tensor Learning with Graph Diffusion for Scalable Multi-view Graph ClusteringabstractThe rapid proliferation of multi-view data has necessitated robust and scalable clustering techniques capable of capturing complex, high-dimensional patterns. While Multi-view Bipartite Graph Clustering (MVBGC) has shown promising results, existing approaches often overlook that the generated bipartite graph is susceptible to disturbances from complex structures and noise. To address these challenges, we propose RTGD-MVC, a novel framework for Robust Tensor Learning with Graph Diffusion tailored for efficient and scalable multi-view graph clustering. RTGD-MVC integrates a graph diffusion mechanism to suppress noise propagation and employs cross-view diffusion to enhance global consistency while capturing complementary information across views. Additionally, a non-convex Tensor Exponential Norm (TEN) is introduced as a tighter surrogate for the tensor rank, enabling the learning of more discriminative and noise-robust representations. By embedding these components into a unified optimization model with linear computational complexity, RTGD-MVC achieves both theoretical efficiency and practical scalability. Extensive experiments on diverse benchmark datasets demonstrate that RTGD-MVC significantly outperforms state-of-the-art methods, highlighting its superior ability to capture intricate multi-view correlations and structural patterns. Jiale Zou, Yan Chen 0036, Bingbing Jiang 0001, Peng Zhou 0006, Liang Du 0003, Lei Duan |
ACM Multimedia | 1 |
| 2024 | Heat Kernel Diffusion for Enhanced Late Fusion Multi-View ClusteringabstractRecent advancements in Multi-view Clustering (MVC) have highlighted the benefits of late fusion techniques. However, existing late fusion-based MVC (LFMVC) approaches often struggle with intrinsic noise and redundancy within base clustering embeddings generated by traditional method, and fail to capture higher-order correlations among samples and across views. We propose a novel method that incorporates an optimal consensus heat kernel-induced graph filter to address these issues. Our approach leverages diffusion processes to construct filters that capture high-order information, achieving neighborhood smoothing while maintaining local consistency within each view. By integrating a consensus graph filter with downstream clustering tasks within a unified learning framework, our method enhances performance through mutual reinforcement. In particular, our method does not require additional hyperparameter tuning, simplifying the optimization process. Experimental results on various benchmark datasets demonstrate the superior effectiveness of our approach, outperforming state-of-the-art methods in terms of clustering performance. Gui Yang, Jiale Zou, Yan Chen 0036, Liang Du 0003, Peng Zhou 0006 |
IEEE Signal Process. Lett. | 2 |