7步走写摘要: Multi-view Low-rank Sparse Subspace Clustering

摘要解读

第一步: 交代背景：多视角数据的普遍性和重要性

第二步: 概括当前方法 。

第三步: 一般介绍现有方法的不足 

Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view data。

afterwards: 
英 [ˈɑːftəwədz]   美 [ˈæftərwərdz]  
adv. 以后;后来

第四步: 提出当前的方法

This paper presents an approach to multi-view subspace clustering that learns a joint subspace representation by constructing affinity matrix shared among all views. 

affinity matrix: 相似度矩阵，近邻矩阵

affinity:

英 [əˈfɪnəti]   美 [əˈfɪnəti]  
n. 喜好;喜爱;密切的关系;类同
 

第五步: 在提出论文的方法之后，需要进行对自己提出的方法的大致的介绍 

Relying on the importance of both low-rank and sparsity constraints in the construction of the affinity matrix, we introduce the objective that balances between the agreement across different views, while at the same time encourages sparsity and low-rankness of the solution. Related low-rank and sparsity constrained optimization problem is for each view solved using the alternating direction method of multipliers. Furthermore, we extend our approach to cluster data drawn from nonlinear subspaces by solving the corresponding problem in a reproducing kernel Hilbert space. 

第六步: 第五步进行了理论上的阐述。这一步呢，通常是对提出的算法怎么样实现优化的一句话或者两句话。不能太长，因为有字数限制。

 

第七步: 简要介绍一下实验，这个比较的套路。

The proposed algorithm outperforms state-of-the-art multi-view subspace clustering algorithms on one synthetic and four real-world datasets.

 

以上就是大致的一个流程，我也正在学习，若有不足请各位耐心支出。非常感谢。