将大规模多视图聚类重构为可解释的深度网络,提升性能与可扩展性。
LargeMvC-Net: Anchor-based Deep Unfolding Network for Large-scale Multi-view Clustering
- 通过优化过程展开设计三模块网络,结构清晰可追踪。
- 在多个大规模数据集上超越现有方法,聚类效果更优。
- 适合需要高效、可解释多视图聚类的科研与工业场景。
基于锚点的深度多视图聚类方法通过代表性锚点降低大规模聚类的计算复杂度,提升神经网络可扩展性。然而,现有方法通常以启发式或任务无关方式引入锚点结构,或通过事后图构建,或作为消息传递的辅助组件,忽视了锚点聚类的核心结构需求与优化原则。为此,本文重新审视大规模锚点聚类的底层优化问题,将其迭代解法展开为一种新型深度网络架构——LargeMvC-Net。该模型将锚点聚类过程分解为三个模块:RepresentModule(表示学习)、NoiseModule(噪声抑制)和AnchorModule(锚点指示估计),每个模块均由原优化步骤逐层展开而成,确保结构清晰与优化可追溯性。此外,引入无监督重建损失,使各视图对齐锚点诱导的潜在空间,促进跨视图聚类结构一致性。在多个大规模多视图基准数据集上的实验表明,LargeMvC-Net在有效性与可扩展性方面均持续优于当前最优方法。
原文摘要 · Abstract (English)
Deep anchor-based multi-view clustering methods enhance the scalability of neural networks by utilizing representative anchors to reduce the computational complexity of large-scale clustering. Despite their scalability advantages, existing approaches often incorporate anchor structures in a heuristic or task-agnostic manner, either through post-hoc graph construction or as auxiliary components for message passing. Such designs overlook the core structural demands of anchor-based clustering, neglecting key optimization principles. To bridge this gap, we revisit the underlying optimization problem of large-scale anchor-based multi-view clustering and unfold its iterative solution into a novel deep network architecture, termed LargeMvC-Net. The proposed model decomposes the anchor-based clustering process into three modules: RepresentModule, NoiseModule, and AnchorModule, corresponding to representation learning, noise suppression, and anchor indicator estimation. Each module is derived by unfolding a step of the original optimization procedure into a dedicated network component, providing structural clarity and optimization traceability. In addition, an unsupervised reconstruction loss aligns each view with the anchor-induced latent space, encouraging consistent clustering structures across views. Extensive experiments on several large-scale multi-view benchmarks show that LargeMvC-Net consistently outperforms state-of-the-art methods in terms of both effectiveness and scalability.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。