返回
Bidirectional Attentive Multi-View Clustering
DOI:10.1109/TKDE.2023.3312794.png)
摘要
En 中文
The key challenge of multi-view graph-based clustering is to mine consistent clustering structures from multiple graphs. Existing works seek clustering decisions from either multiple spectral embeddings or multiple affinity matrices, ignoring the interactions among them. To address this problem, we propose a Bidirectional Attentive Multi-view Clustering (BAMC) model to explore a consensus space w.r.t. spectral embedding and affinity matrix simultaneously, where they can promote each other to mine richer structural information from multiple graphs. BAMC is composed of a Spectral Embedding Learning (SEL) module, an Affinity Matrix Learning (AML) module, and a Bidirectional Attentive Clustering (BAC) module. SEL seeks consensus spectral embeddings by aligning the distributions of elements sampled from subspaces spanned by multiple spectral embeddings. AML learns a consensus affinity matrix from input affinity matrices. BAC guarantees consistency between the learned consensus spectral embeddings and the affinity matrix. To balance their effects, it also assigns adaptive weights to SEL and AML's objective functions. To solve the optimization problem involved in BAMC, we propose an efficient algorithm based on the Majority-Minimization framework with an ingenious surrogate problem. Extensive experiments on several synthetic and real-world datasets demonstrate the superb performance of BAMC.
Keyword:
Multi-view clustering
bidirectional attentive clustering
structured graph learning
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Synthesis of modified proanthocyanidins: easy and general introduction of a hydroxy group at C-6 of catechin; efficient synthesis of elephantorrhizol改性原花青素的合成: 在儿茶素C-6引入羟基; 象花素的高效合成

