arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2305.07307cs.CV
收藏

自学习对称多视图概率聚类

Self-Learning Symmetric Multi-view Probabilistic Clustering

College of Biomedical Engineering and Instrument Science, Zhejiang University(浙江大学生物医学工程与仪器科学学院);Zhejiang University(浙江大学);Alibaba Cloud(阿里云)

Junjie Liu, Junlong Liu, Rongxin Jiang, Yaowu Chen, Chen Shen, Jieping Ye

AI总结:

针对现有多视图聚类难以处理不完全视图、抗噪性差的问题,提出SLS-MPC框架,通过对称概率估计、自学习分布、图上下文细化及迭代概率聚类实现高性能聚类,效果优于现有最优方法。

摘要:

多视图聚类(Multi-view Clustering, MVC)已取得显著进展,诸多研究致力于从多视图中学习知识。然而,现有大多数方法要么不适用于不完全MVC场景,要么需要额外步骤才能处理该场景。这一局限导致聚类性能质量不佳,且对缺失视图的适配能力较差。此外,噪声或离群点可能会显著降低整体聚类性能,而现有大多数方法无法很好地应对这一问题。本文提出了一种适用于不完全和完全MVC的新型统一框架,名为自学习对称多视图概率聚类(self-learning symmetric multi-view probabilistic clustering, SLS-MPC)。SLS-MPC提出了一种新颖的对称多视图概率估计方法,将多视图成对后验匹配概率等价转换为各视图独立分布的组合,可容忍数据缺失,且能扩展至任意数量的视图。随后,SLS-MPC提出了一种无需任何先验知识和超参数的新型自学习概率函数,用于学习各视图的独立分布。接着,采用结合路径传播和共同邻居传播的图上下文感知细化方法来优化成对概率,以减轻噪声和离群点的影响。最后,SLS-MPC提出了一种概率聚类算法,在无类别信息的情况下通过迭代最大化联合概率来调整聚类分配。在多个基准数据集上的大量实验表明,SLS-MPC的性能优于此前的最优方法。

英文摘要:

Multi-view Clustering (MVC) has achieved significant progress, with many efforts dedicated to learn knowledge from multiple views. However, most existing methods are either not applicable or require additional steps for incomplete MVC. Such a limitation results in poor-quality clustering performance and poor missing view adaptation. Besides, noise or outliers might significantly degrade the overall clustering performance, which are not handled well by most existing methods. In this paper, we propose a novel unified framework for incomplete and complete MVC named self-learning symmetric multi-view probabilistic clustering (SLS-MPC). SLS-MPC proposes a novel symmetric multi-view probability estimation and equivalently transforms multi-view pairwise posterior matching probability into composition of each view's individual distribution, which tolerates data missing and might extend to any number of views. Then, SLS-MPC proposes a novel self-learning probability function without any prior knowledge and hyper-parameters to learn each view's individual distribution. Next, graph-context-aware refinement with path propagation and co-neighbor propagation is used to refine pairwise probability, which alleviates the impact of noise and outliers. Finally, SLS-MPC proposes a probabilistic clustering algorithm to adjust clustering assignments by maximizing the joint probability iteratively without category information. Extensive experiments on multiple benchmarks show that SLS-MPC outperforms previous state-of-the-art methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑