7步走写摘要：Tensorial Multi-View Clustering via Low-Rank Constrained High-Order Graph Learning

---

摘要书写解读 
第一步: 交代背景：多视角数据的普遍性和重要性
第二步: 概括当前方法 。
第三步: 一般介绍现有方法的不足 
第四步: 提出当前的方法
第五步: 在提出论文的方法之后，需要进行对自己提出的方法的大致的介绍 
第六步: 第五步进行了理论上的阐述。这一步呢，通常是对提出的算法怎么样实现优化的一句话或者两句话。不能太长，因为有字数限制。
第七步: 简要介绍一下实验，这个比较的套路。
以上就是大致的一个流程，我也正在学习，若有不足请各位耐心支出。非常感谢。
一般的摘要都会遵循这七个步骤，不同的步骤之间可能会融合到一块进行书写，在我们自己进行书写摘要的时候，可以参照这个步骤。如果自己在某个步骤实在想不出来，就暂时空下来。​

---

案例分析

Tensorial Multi-View Clustering via Low-Rank Constrained High-Order Graph Learning

 

发表于： 

IEEE Transactions on Circuits and Systems for Video Technology

原摘要:
"Multi-view clustering aims to partition multi-view data into different categories by optimally exploring the consistency and complementary information from multiple sources. However, most existing multi-view clustering algorithms heavily rely on the similarity graphs from respective views and fail to comprehend multiple views holistically. Moreover, due to the noise and redundancy maintained in the original data, the original errors of multiple similarity graphs will continue to accumulate in the process of constructing consistent graphs. These situations always lead to the limitation to effective fuse the essential information from multiple views, which always influences the clustering performance and cries out for reliable solutions. Based on the above considerations, we propose a novel method termed Tensorial Multi-view Clustering (TMvC), which learns high-order graph by low-rank tensor constraint to uncover the essential information stored in multiple views. TMvC first learns the Laplacian graphs of all views and stacks them into a tensor which can be viewed as a high-order graph. With the high-order graph, consistency and complementary information from different views can be propagated smoothly across all views. Then, based on low-rank constraint, high-order graph is constrained in the horizontal and vertical directions to better uncover the inter-view and inter-class correlations between multi-view data, which is of vital importance for multi-view clustering. Extensive experiments on document and image datasets demonstrate that TMvC can achieve the state-of-the-art performance for multi-view clustering."

七步分如下:
交代背景: 
"Multi-view clustering aims to partition multi-view data into different categories by optimally exploring the consistency and complementary information from multiple sources. However, most existing multi-view clustering algorithms heavily rely on the similarity graphs from respective views and fail to comprehend multiple views holistically."

概括当前方法:
"Most existing multi-view clustering algorithms heavily rely on the similarity graphs from respective views."

现有方法的不足 : 
"However, most existing multi-view clustering algorithms fail to comprehend multiple views holistically. Moreover, due to the noise and redundancy maintained in the original data, the original errors of multiple similarity graphs will continue to accumulate in the process of constructing consistent graphs."

提出当前的方法: 
"Based on the above considerations, we propose a novel method termed Tensorial Multi-view Clustering (TMvC), which learns high-order graph by low-rank tensor constraint to uncover the essential information stored in multiple views."

简要介绍方法: 
"TMvC first learns the Laplacian graphs of all views and stacks them into a tensor which can be viewed as a high-order graph. With the high-order graph, consistency and complementary information from different views can be propagated smoothly across all views. Then, based on low-rank constraint, high-order graph is constrained in the horizontal and vertical directions to better uncover the inter-view and inter-class correlations between multi-view data, which is of vital importance for multi-view clustering."

如何实现: 
""

实验介绍: 
"Extensive experiments on document and image datasets demonstrate that TMvC can achieve the state-of-the-art performance for multi-view clustering."