Bit-swapping Oriented Twin-memory Multi-view Clustering in Lifelong Incomplete Scenarios
Shengju Yu, Pei Zhang, Siwei Wang, Suyuan Liu, Xinhang Wan, Zhibin Dong, Tiejun Li, Xinwang Liu
Although receiving notable improvements, current multi-view clustering (MVC) techniques generally rely on feature library mechanisms to propagate accumulated knowledge from historical views to newly-arrived data, which overlooks the information pertaining to basis embedding within each view.  Moreover, the mapping paradigm inevitably alters   the values of learned landmarks and built affinities due to the uninterruption nature, accordingly disarraying the hierarchical cluster structures. To mitigate these two issues, we in the paper provide a named BSTM algorithm. Concretely, we firstly synchronize with the distinct dimensions by introducing a group of specialized projectors, and then establish unified anchors for all views collected so far to capture intrinsic patterns. Afterwards, departing from  per-view architectures, we devise  a shared bipartite graph construction via indicators to quantify similarity, which not only avoids redundant data-recalculations  but alleviates the representation distortion caused by fusion. Crucially, there two components are optimized within an integrated framework, and collectively  facilitate knowledge transfer upon  encountering  incoming views.  Subsequently, to flexibly do transformation on anchors and meanwhile maintain numerical consistency, we develop a bit-swapping scheme operating exclusively on 0 and 1. It harmonizes anchors on current view and that on previous views through one-hot encoded row and column attributes, and the graph structures are correspondingly reordered to reach a matched configuration. Furthermore, a computationally efficient four-step updating strategy with linear complexity is designed to minimize the associated loss. Extensive experiments organized  on publicly-available benchmark datasets with varying missing percentages confirm the superior effectiveness of our BSTM.