Demo Data from VLDB 2026 / reviewers in the wild / expert
Xinliu Liu
dblp:389/2660
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0003-5352-9864ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper |
Data mining · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining
clustering |
0.8 | 1 | 2024 | Multiple Kernel Clustering with Shifted Laplacian on Grassmann Manifold · ACM Multimedia 2024 |
Data mining › dimensionality reduction
manifold learning |
0.8 | 1 | 2024 | Multiple Kernel Clustering with Shifted Laplacian on Grassmann Manifold · ACM Multimedia 2024 |
Data mining › clustering
multiple kernel clustering |
0.8 | 1 | 2024 | Multiple Kernel Clustering with Shifted Laplacian on Grassmann Manifold · ACM Multimedia 2024 |
Methods — techniques the papers use, named apart from their topics
shifted laplacian · 0.8multiple kernel learning · 0.8grassmann manifold · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Optimal transport filtering for robust cross-modal retrieval with open-set noisy labels
Xinliu Liu, Ruitao Pu, Yuan Sun 0016, Yingke Chen, Shudong Huang, Dezhong Peng, Yongsheng Sang |
Pattern Recognit. | 1 |
| 2024 | Multiple Kernel Clustering with Shifted Laplacian on Grassmann ManifoldabstractMultiple kernel clustering (MKC) has garnered considerable attention, as their efficacy in handling nonlinear data in high-dimensional space. However, current MKC methods have three primary issues: (1) Solely focuses on clustering information while neglecting energy information and potential noise interference within the kernel; (2) The inherent manifold structure in the high-dimensional space is complex, and they lack the insufficient exploration of topological structure; (3) Most encounter cubic computational complexity, posing a formidable resource consumption challenge. To tackle the above issues, we propose a novel MKC method with shifted Laplacian on Grassmann manifold (sLGm). Firstly, sLGm constructs r-rank shifted Laplacian and subsequently reconstructs it, retaining the clustering-related and energy-related information while reducing the influence of noise. Additionally, sLGm introduces a Grassmann manifold for information fusion, which can preserve topological information in the high-dimensional space. Notably, an optimal consensus partition can be concurrently learnt from above two procedures, thereby yielding the clustering assignments, and the computational complexity of the whole procedure drops to the quadratic. Conclusively, a comprehensive suite of experiments is executed to roundly prove the effectiveness of sLGm. Chuang Huang, Xinliu Liu, Zhenwen Ren |
ACM Multimedia | 3 |