7步走写摘要:Deep graph regularized non-negative matrix factorization for multi-view clustering

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

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

多视图聚类是一种无监督的方法，旨在通过组合来自多个视图数据的知识来增强聚类性能。非负矩阵分解（NMF）由于其对非负数据的强大表示能力，是最有利的多视图聚类方法之一。但是，NMF仅将数据矩阵分解为两个非负因子矩阵，这可能会限制其学习更高级别和更复杂的层次结构信息的能力。为了克服这一缺点，本文提出了一种基于深度图正则化非负矩阵分解（MvDGNMF）的多视图聚类方法。 MvDGNMF能够通过构造具有图拉普拉斯正则化的多层NMF模型来提取更多抽象表示，并将每个视图的最后一层表示驱动到一个共同的共识表示。同时，开发了一种使用交替乘法更新规则的有效算法。此外，为了证明该方法的有效性，我们采用了一些开放的数据集，包括图像和文本数据集，以评估MvDGNMF的聚类性能和最新技术。	Multi-view clustering is an unsupervised method which aims to enhance the clustering performance by combining the knowledge from multiple view data. Non-negative matrix factorization (NMF) is one of the most favourable multi-view clustering methods due to its strong representation ability of non-negative data. However, NMF only factorizes the data matrix into two non-negative factor matrices, which may limit its ability to learn higher level and more complex hierarchical information. To overcome this shortcoming, in this paper, we propose a multi-view clustering method based on deep graph regularized non-negative matrix factorization (MvDGNMF). （详细的说）MvDGNMF is able to extract more abstract representation by constructing a multilayer NMF model with graph Laplacian regularization and drive the last layer representation from each view to a common consensus representation. Meanwhile, an efficient algorithm using alternating multiplicative update rules is developed. Furthermore, in order to demonstrate the effectiveness of this proposed method, we employ several open datasets including image and text datasets to evaluate the clustering performance of MvDGNMF and the state-of-art methods.
第一步: 交代研究背景	Multi-view clustering is an unsupervised method which aims to enhance the clustering performance by combining the knowledge from multiple view data.
第二步: 概括当前方法	Non-negative matrix factorization (NMF) is one of the most favourable multi-view clustering methods due to its strong representation ability of non-negative data.
第三步: 一般介绍现有方法的不足，论文给出的一些解决办法。	However, NMF only factorizes the data matrix into two non-negative factor matrices, which may limit its ability to learn higher level and more complex hierarchical information.
第四步: 提出当前的方法	To overcome this shortcoming, in this paper, we propose a multi-view clustering method based on deep graph regularized non-negative matrix factorization (MvDGNMF).
第五步: 在提出论文的方法之后，需要进行对自己提出的方法的大致的介绍	MvDGNMF is able to extract more abstract representation by constructing a multilayer NMF model with graph Laplacian regularization and drive the last layer representation from each view to a common consensus representation.
第六步: 第五步进行了理论上的阐述。这一步呢，通常是对提出的算法怎么样实现优化的一句话或者两句话。不能太长，因为有字数限制。（可有，也可以没有，视具体论文而定）	Meanwhile, an efficient algorithm using alternating multiplicative update rules is developed.
第七步: 简要介绍一下实验，这个比较的套路，一般都是这个套路。	Furthermore, in order to demonstrate the effectiveness of this proposed method, we employ several open datasets including image and text datasets to evaluate the clustering performance of MvDGNMF and the state-of-art methods.

 

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

第二步: 概括当前方法 。

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

第四步: 提出当前的方法

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

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

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

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

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