A Stitch in Time Saves Nine
Progressive Information Bottleneck for Incremental Multiview Clustering
Bibliographic Data
| ID | 22107693 |
|---|---|
| Authors | Xiaoqiang Yan (0000-0002-0002-9300, Zhengzhou University), Fengshou Han (0009-0002-9091-7594, Zhengzhou University), Yiqiao Mao (0000-0002-9997-1805, Zhengzhou University), Zhen Tian (0000-0001-8714-811X, University of Electronic Science and Technology of China), Witold Pedrycz (0000-0002-9335-9930, University of Alberta), Hui Yu (0000-0001-8434-7922, University of Glasgow) |
| Year | 2026 |
| Volume | 13 |
| Issue | 2 |
| Pages | 1703-1718 |
| Publication date | 2026-04-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | IEEE Transactions on Computational Social Systems (JOURNAL) |
| Journal identifiers | ISSN: 2329-924X • E-ISSN: 2373-7476 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) (PUBLISHER) |
| DOI | 10.1109/tcss.2025.3621148 |
| OpenAlex | W4416582718 |
| Language | EN |
| References cited | 48 |
Incremental multiview clustering (IMVC) leverages consistent information between historical and new views to benefit the clustering task. However, existing IMVC approaches ignore the redundant information in individual views, leading to an accumulation of irrelevance. Besides, with the continuous arrivals of new views, the knowledge learned from historical views is often forgotten, which hinders the learning models from achieving long-term dependencies across incremental views. In this study, we propose a novel progressive information bottleneck (PIB), which is capable of removing redundant information in a timely manner and selectively updating historical knowledge based on information gain of new views. Specifically, to facilitate the knowledge transfer from historical views to incoming one, an information-aware knowledge library is built to store the representative samples of historical views. With the emergence of new views, we first devise a matrix-based mutual information (MI) constraint on an encoder to compress redundant information, which facilitates the training of a neural network with analyzable gradients and obtain a compact yet discriminative representation. Then, a dual-selective updating strategy is proposed to preserve historical knowledge in time when it contributes more to the information gain of the knowledge library than the new view. Finally, relevant samples to the new view in knowledge library are migrated to maximize the cross-level consistency between historical and new views. To the best of our knowledge, this is the first work that designs a gradient-analyzable MI measurement for incremental multiview learning and employs information gain to guide the selective update of the knowledge library. Empirical evaluations on six benchmark datasets show that our method outperforms state-of-the-art baseline methods by an average of 8.1%, 7.6%, and 7.8% on clustering accuracy (ACC), normalized mutual information (NMI), and adjusted Rand index (ARI) metrics, respectively
Bottleneck · Cluster analysis · Discriminative model · Encoder · Information bottleneck method · Knowledge Acquisition · Knowledge base · Advanced Graph Neural Networks · Domain Adaptation and Few-Shot Learning · Recommender Systems and Techniques
| Citation velocity | historical |
|---|---|
| Highly cited | No |