生成式不完整多视图数据聚类

基于自表示子空间聚类的多视图聚类引起越来越多的关注. 大多数现有算法假设每个样本的所有视图都可获得, 然而在实际应用中, 由于各种因素, 可能会导致某些视图缺失. 为了对视图不完整数据进行聚类, 本文提出了一种在统一框架下同时执行缺失视图补全和多视图子空间聚类的方法. 具体地, 缺失视图是由已观测视图数据约束的隐表示生成的. 此外, 多秩张量应用于挖掘不同视图之间的高阶相关性. 这样通过隐表示和高阶张量同时挖掘了不同视图以及所有样本(即使是不完整视图样本)之间的相关性. 本文使用增广拉格朗日交替方向最小化(AL-ADM)方法求解优化问题. 在真实数据集上的实验结果表明, 我们的方法优于最新的多视图聚类算法, 具有更好的聚类准确度和鲁棒性.

Generative Model For Partial Multi-view Clustering

There has been a growing interest in multi-view clustering over self-representation-based subspace clustering. Most existing algorithms assume that all views for each sample are available. However, in real applications, some views may be missing which produces data with partial views. To cluster the incomplete data, we propose a generative model to simultaneously perform view imputation and multi-view subspace clustering in a unified framework. Specifically, the missing views are generated by a latent representation which is constrained by the observed views. Moreover, multi-rank tensor is employed to explore the higher-order correlations across different views. In this way, the correlations across different views and all samples even with incomplete views are simultaneously explored by the latent representation and high-order tensor. We solve the optimization problem by using augmented Lagrangian alternating direction minimization (AL-ADM) method. Experimental results on real-world datasets demonstrate the superior performance and robustness of our method over state-of-the-art multi-view clustering algorithms.