Demo Data from EDBT 2026 / reviewers in the wild / expert
Chongjie Dong
dblp:72/10131
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, 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.9 | 1 | 2025 | Deep Multi-View Clustering With Meta Information Compression · IEEE Trans. Image Process. 2025 |
Data mining › clustering › multi-view clustering
deep multi-view clustering |
0.9 | 1 | 2025 | Deep Multi-View Clustering With Meta Information Compression · IEEE Trans. Image Process. 2025 |
Data mining › clustering
multi-view clustering |
0.9 | 1 | 2025 | Deep Multi-View Clustering With Meta Information Compression · IEEE Trans. Image Process. 2025 |
Methods — techniques the papers use, named apart from their topics
meta-learning · 0.9bi-level optimization · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Deep Multi-View Clustering With Meta Information CompressionabstractMulti-view clustering typically leverages the consistency and complementarity among views to partition different samples. However, existing deep learning-based methods often face the dilemma between selecting complementary information and capturing essential details: 1) Capturing complementary semantics among views may introduce label-irrelevant redundant information. 2) Only extracting consistent semantic information will cause information loss, hindering the clarity in downstream tasks. To address these issues, we propose a novel method from the perspective of meta-learning to learn clustering-friendly representations with minimal redundancy. Specifically, we train an information compressor to guide the model in describing the original samples as compact as possible with minimal information, thus learning the key semantics with minimized redundancy. Meta-learning bi-level optimization promotes the nested optimization of feature embedding and information compressor. Meanwhile, a semantic puzzle mechanism complements the semantic fragments by exploiting the relationships between low-level features, resulting in a consensus representation with strong discriminative power. We conducted extensive experiments on datasets with various sizes to validate the effectiveness of our model, demonstrating significant performance improvements over several state-of-the-art methods. Jinrong Cui, Bang Liufu, Chongjie Dong, Jingcheng Ke, Jie Wen 0001 |
IEEE Trans. Image Process. | 3 |