通过解耦低维表示提升多视角聚类效率与精度
Fast Disentangled Slim Tensor Learning for Multi-view Clustering
- 基于矩阵分解直接挖掘多视图语义的高阶关联
- 解耦无关语义成分,构建轻量级张量优化模型
- 适合大规模多视角数据,兼顾速度与聚类质量
基于张量的多视角聚类因能有效捕捉跨视角高阶相关性而备受关注。然而现有方法仍存在三方面局限:(1)多数方法聚焦不同相似度矩阵间的关联,难以扩展至大规模数据;(2)虽引入二分图缓解问题,但锚点选择不稳导致次优解;(3)普遍忽略各视角中潜在的语义无关信息干扰。为此,本文提出快速解耦轻量张量学习(DSTL)方法。不同于传统图结构建模,DSTL直接基于矩阵分解挖掘多视图隐含语义表示的高阶相关性。为抑制特征冗余影响,受鲁棒PCA启发,将每视图的低维表示解耦为语义相关与无关两部分,并构造两个轻量张量,辅以张量正则化。为进一步提升解耦质量,通过共识对齐指标实现跨视图语义相关表示的一致性约束。所提模型计算高效,可有效求解。大量实验表明,DSTL在性能与效率上均优于当前最优方法。代码已公开于https://github.com/dengxu-nju/DSTL。
原文摘要 · Abstract (English)
Tensor-based multi-view clustering has recently received significant attention due to its exceptional ability to explore cross-view high-order correlations. However, most existing methods still encounter some limitations. (1) Most of them explore the correlations among different affinity matrices, making them unscalable to large-scale data. (2) Although some methods address it by introducing bipartite graphs, they may result in sub-optimal solutions caused by an unstable anchor selection process. (3) They generally ignore the negative impact of latent semantic-unrelated information in each view. To tackle these issues, we propose a new approach termed fast Disentangled Slim Tensor Learning (DSTL) for multi-view clustering . Instead of focusing on the multi-view graph structures, DSTL directly explores the high-order correlations among multi-view latent semantic representations based on matrix factorization. To alleviate the negative influence of feature redundancy, inspired by robust PCA, DSTL disentangles the latent low-dimensional representation into a semantic-unrelated part and a semantic-related part for each view. Subsequently, two slim tensors are constructed with tensor-based regularization. To further enhance the quality of feature disentanglement, the semantic-related representations are aligned across views through a consensus alignment indicator. Our proposed model is computationally efficient and can be solved effectively. Extensive experiments demonstrate the superiority and efficiency of DSTL over state-of-the-art approaches. The code of DSTL is available at https://github.com/dengxu-nju/DSTL.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。