7步走写摘要:Feature concatenation multi-view subspace clustering

本篇论文发表于Neurocomputing (2020)，CCF C类，中科院二区。

本栏目着重于学习怎么样写论文摘要。从一个七步走的方法对论文摘要进行叙述，每一步需要写什么，怎么写。

多视图聚类是基于多视图数据的学习范例。由于不同视图的统计属性是多种多样的，甚至是不兼容的，因此很少有方法基于直接的级联特征来实现多视图聚类。但是，特征串联是组合多视图数据的自然方法。为此，本文提出了一种被称为特征级联多视图子空间聚类（FCMSC）的新颖的多视图子空间聚类方法，该方法通过探索多视图数据的共识信息来提高聚类性能。具体来说，首先将多视图数据连接成一个联合表示，然后将l2,1-范数集成到目标函数中，以处理多视图的特定于样本和特定于群集的损坏。此外，本文还提出了一种图正则化FCMSC来探索多视图数据的共识信息和补充信息，以进行聚类。值得注意的是，获得的系数矩阵不是通过简单地将低秩表示（LRR）直接应用于串联特征而得出的。最后，设计了一种基于增强拉格朗日乘数（ALM）的有效算法来优化目标函数。在六个真实世界的数据集上进行的综合实验表明，所提出的方法优于几种用于多视图聚类的最新方法。	Multi-view clustering is a learning paradigm based on multi-view data. Since statistic properties of different views are diverse, even incompatible, few approaches implement multi-view clustering based on the concatenated features straightforward. However, feature concatenation is a natural way to combine multi-view data. To this end, this paper proposes a novel multi-view subspace clustering approach dubbed Feature Concatenation Multi-view Subspace Clustering (FCMSC), which boosts the clustering performance by exploring the consensus information of multi-view data. Specifically, multi-view data are concatenated into a joint representation firstly, then, l2,1-norm is integrated into the objective function to deal with the sample-specific and cluster-specific corruptions of multiple views. Moreover, a graph regularized FCMSC is also proposed in this paper to explore both the consensus information and complementary information of multi-view data for clustering. It is noteworthy that the obtained coefficient matrix is not derived by simply applying the Low-Rank Representation (LRR) to concatenated features directly. Finally, an effective algorithm based on the Augmented Lagrangian Multiplier (ALM) is designed to optimize the objective functions. Comprehensive experiments on six real-world datasets illustrate the superiority of the proposed methods over several state-of-the-art approaches for multi-view clustering.
第一步: 交代研究背景	Multi-view clustering is a learning paradigm based on multi-view data.
第二步: 概括当前方法	Since statistic properties of different views are diverse, even incompatible, few approaches implement multi-view clustering based on the concatenated features straightforward.
第三步: 一般介绍现有方法的不足，论文给出的一些解决办法。	However, feature concatenation is a natural way to combine multi-view data.
第四步: 提出当前的方法	To this end, this paper proposes a novel multi-view subspace clustering approach dubbed Feature Concatenation Multi-view Subspace Clustering (FCMSC), which boosts the clustering performance by exploring the consensus information of multi-view data.
第五步: 在提出论文的方法之后，需要进行对自己提出的方法的大致的介绍	Specifically, multi-view data are concatenated into a joint representation firstly, then, l2,1-norm is integrated into the objective function to deal with the sample-specific and cluster-specific corruptions of multiple views. Moreover, a graph regularized FCMSC is also proposed in this paper to explore both the consensus information and complementary information of multi-view data for clustering. It is noteworthy that the obtained coefficient matrix is not derived by simply applying the Low-Rank Representation (LRR) to concatenated features directly.
第六步: 第五步进行了理论上的阐述。这一步呢，通常是对提出的算法怎么样实现优化的一句话或者两句话。不能太长，因为有字数限制。（可有，也可以没有，视具体论文而定）	Finally, an effective algorithm based on the Augmented Lagrangian Multiplier (ALM) is designed to optimize the objective functions.
第七步: 简要介绍一下实验，这个比较的套路，一般都是这个套路。	Comprehensive experiments on six real-world datasets illustrate the superiority of the proposed methods over several state-of-the-art approaches for multi-view clustering.

 

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

第二步: 概括当前方法 。

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

第四步: 提出当前的方法

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

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

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

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

一般的摘要都会遵循这七个步骤，不同的步骤之间可能会融合到一块进行书写，在我们自己进行书写摘要的时候，可以参照这个步骤。如果自己在某个步骤实在想不出来，就暂时空下来。