Robust auto-weighted multi-view subspace clustering with common subspace representation matrix.
In many computer vision and machine learning applications, the data sets distribute on certain low-dimensional subspaces. Subspace clustering is a powerful technology to find the underlying subspaces and cluster data points correctly. However, traditional subspace clustering methods can only be appl...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2017-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC5441581?pdf=render |
| _version_ | 1818519610560872448 |
|---|---|
| author | Wenzhang Zhuge Chenping Hou Yuanyuan Jiao Jia Yue Hong Tao Dongyun Yi |
| author_facet | Wenzhang Zhuge Chenping Hou Yuanyuan Jiao Jia Yue Hong Tao Dongyun Yi |
| author_sort | Wenzhang Zhuge |
| collection | DOAJ |
| description | In many computer vision and machine learning applications, the data sets distribute on certain low-dimensional subspaces. Subspace clustering is a powerful technology to find the underlying subspaces and cluster data points correctly. However, traditional subspace clustering methods can only be applied on data from one source, and how to extend these methods and enable the extensions to combine information from various data sources has become a hot area of research. Previous multi-view subspace methods aim to learn multiple subspace representation matrices simultaneously and these learning task for different views are treated equally. After obtaining representation matrices, they stack up the learned representation matrices as the common underlying subspace structure. However, for many problems, the importance of sources and the importance of features in one source both can be varied, which makes the previous approaches ineffective. In this paper, we propose a novel method called Robust Auto-weighted Multi-view Subspace Clustering (RAMSC). In our method, the weight for both the sources and features can be learned automatically via utilizing a novel trick and introducing a sparse norm. More importantly, the objective of our method is a common representation matrix which directly reflects the common underlying subspace structure. A new efficient algorithm is derived to solve the formulated objective with rigorous theoretical proof on its convergency. Extensive experimental results on five benchmark multi-view datasets well demonstrate that the proposed method consistently outperforms the state-of-the-art methods. |
| first_indexed | 2024-12-11T01:26:28Z |
| format | Article |
| id | doaj.art-7e345f18526e48c19218c3e60a2b0b70 |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-12-11T01:26:28Z |
| publishDate | 2017-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-7e345f18526e48c19218c3e60a2b0b702022-12-22T01:25:30ZengPublic Library of Science (PLoS)PLoS ONE1932-62032017-01-01125e017676910.1371/journal.pone.0176769Robust auto-weighted multi-view subspace clustering with common subspace representation matrix.Wenzhang ZhugeChenping HouYuanyuan JiaoJia YueHong TaoDongyun YiIn many computer vision and machine learning applications, the data sets distribute on certain low-dimensional subspaces. Subspace clustering is a powerful technology to find the underlying subspaces and cluster data points correctly. However, traditional subspace clustering methods can only be applied on data from one source, and how to extend these methods and enable the extensions to combine information from various data sources has become a hot area of research. Previous multi-view subspace methods aim to learn multiple subspace representation matrices simultaneously and these learning task for different views are treated equally. After obtaining representation matrices, they stack up the learned representation matrices as the common underlying subspace structure. However, for many problems, the importance of sources and the importance of features in one source both can be varied, which makes the previous approaches ineffective. In this paper, we propose a novel method called Robust Auto-weighted Multi-view Subspace Clustering (RAMSC). In our method, the weight for both the sources and features can be learned automatically via utilizing a novel trick and introducing a sparse norm. More importantly, the objective of our method is a common representation matrix which directly reflects the common underlying subspace structure. A new efficient algorithm is derived to solve the formulated objective with rigorous theoretical proof on its convergency. Extensive experimental results on five benchmark multi-view datasets well demonstrate that the proposed method consistently outperforms the state-of-the-art methods.http://europepmc.org/articles/PMC5441581?pdf=render |
| spellingShingle | Wenzhang Zhuge Chenping Hou Yuanyuan Jiao Jia Yue Hong Tao Dongyun Yi Robust auto-weighted multi-view subspace clustering with common subspace representation matrix. PLoS ONE |
| title | Robust auto-weighted multi-view subspace clustering with common subspace representation matrix. |
| title_full | Robust auto-weighted multi-view subspace clustering with common subspace representation matrix. |
| title_fullStr | Robust auto-weighted multi-view subspace clustering with common subspace representation matrix. |
| title_full_unstemmed | Robust auto-weighted multi-view subspace clustering with common subspace representation matrix. |
| title_short | Robust auto-weighted multi-view subspace clustering with common subspace representation matrix. |
| title_sort | robust auto weighted multi view subspace clustering with common subspace representation matrix |
| url | http://europepmc.org/articles/PMC5441581?pdf=render |
| work_keys_str_mv | AT wenzhangzhuge robustautoweightedmultiviewsubspaceclusteringwithcommonsubspacerepresentationmatrix AT chenpinghou robustautoweightedmultiviewsubspaceclusteringwithcommonsubspacerepresentationmatrix AT yuanyuanjiao robustautoweightedmultiviewsubspaceclusteringwithcommonsubspacerepresentationmatrix AT jiayue robustautoweightedmultiviewsubspaceclusteringwithcommonsubspacerepresentationmatrix AT hongtao robustautoweightedmultiviewsubspaceclusteringwithcommonsubspacerepresentationmatrix AT dongyunyi robustautoweightedmultiviewsubspaceclusteringwithcommonsubspacerepresentationmatrix |