2017
DOI: 10.1016/j.neunet.2017.02.003
|View full text |Cite
|
Sign up to set email alerts
|

Multi-view clustering via multi-manifold regularized non-negative matrix factorization

Abstract: Non-negative matrix factorization based multi-view clustering algorithms have shown their competitiveness among different multi-view clustering algorithms. However, non-negative matrix factorization fails to preserve the locally geometrical structure of the data space. In this paper, we propose a multi-manifold regularized non-negative matrix factorization framework (MMNMF) which can preserve the locally geometrical structure of the manifolds for multi-view clustering. MMNMF incorporates consensus manifold and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
49
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 225 publications
(49 citation statements)
references
References 28 publications
0
49
0
Order By: Relevance
“…Now we cluster across the two views simultaneously to find a common latent structure. Among the multi-view clustering algorithms, NMF based methods [ 14 , 19 , 20 ] have demonstrated strong vitality and efficiency. Based on the two feature matrices we use a multi-view NMF model [ 14 ] to find a common coefficient (or basis) matrix.…”
Section: Methodsmentioning
confidence: 99%
“…Now we cluster across the two views simultaneously to find a common latent structure. Among the multi-view clustering algorithms, NMF based methods [ 14 , 19 , 20 ] have demonstrated strong vitality and efficiency. Based on the two feature matrices we use a multi-view NMF model [ 14 ] to find a common coefficient (or basis) matrix.…”
Section: Methodsmentioning
confidence: 99%
“…Locally linear embedding (LLE) is a well-known algorithm for non-linear dimensionality reduction. Based on the LLE [ 31 ], each sample point in the space can be expressed by a weight matrix in the high-dimensional space, which provides the description of the data points in the low-dimensional space [ 32 ].…”
Section: Methodsmentioning
confidence: 99%
“…To obtain a better understanding of these complex phenomena, by integrating different views of the data, many multiview clustering algorithms have been proposed (see Section 6.4 for details on multiview learning techniques). Some examples are the methods based on matrix factorization that integrate clustering solutions obtained on each single view (Zong, Zhang, Zhao, Yu, & Zhao, 2017). Other approaches use modifications of the classical K-means clustering algorithm (Chen, Xiaofei, Huang, & Ye, 2013;Xu, Han, Nie, & Li, 2017).…”
Section: Multiview Clusteringmentioning
confidence: 99%