提出一步式多视图聚类方法,提升聚类效果与效率。
One-step Multi-view Clustering With Adaptive Low-rank Anchor-graph Learning
- 自适应低秩锚图学习,减少冗余信息和噪声干扰。
- 统一框架整合锚图学习与类别指示获取,显著提升效率。
- 在普通与大规模数据集上均优于现有最优方法。
为应对大规模聚类问题,基于锚图的多视图聚类(AGMC)方法因其能捕捉结构信息并降低计算复杂度而受到广泛关注。然而,现有方法存在两大缺陷:1)直接将多个锚图嵌入共识锚图(CAG),忽略其中冗余信息和噪声,导致聚类效果下降;2)独立后处理获取聚类指示,影响效率与效果。为此,本文提出一种一步式多视图聚类方法(OMCAL),通过核范数正则化实现自适应的CAG学习,有效抑制冗余与噪声。同时,将类别指示获取与CAG学习统一于同一框架中,大幅提升聚类效果与效率。在多个普通及大规模数据集上的实验表明,OMCAL在聚类性能与运行效率方面均优于当前最先进方法。
原文摘要 · Abstract (English)
In light of their capability to capture structural information while reducing computing complexity, anchor graph-based multi-view clustering (AGMC) methods have attracted considerable attention in large-scale clustering problems. Nevertheless, existing AGMC methods still face the following two issues: 1) They directly embedded diverse anchor graphs into a consensus anchor graph (CAG), and hence ignore redundant information and numerous noises contained in these anchor graphs, leading to a decrease in clustering effectiveness; 2) They drop effectiveness and efficiency due to independent post-processing to acquire clustering indicators. To overcome the aforementioned issues, we deliver a novel one-step multi-view clustering method with adaptive low-rank anchor-graph learning (OMCAL). To construct a high-quality CAG, OMCAL provides a nuclear norm-based adaptive CAG learning model against information redundancy and noise interference. Then, to boost clustering effectiveness and efficiency substantially, we incorporate category indicator acquisition and CAG learning into a unified framework. Numerous studies conducted on ordinary and large-scale datasets indicate that OMCAL outperforms existing state-of-the-art methods in terms of clustering effectiveness and efficiency.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。