Feature Selection Embedded Subspace Clustering

Chong Peng; Zhao Kang; Ming Yang; Qiang Cheng

doi:10.1109/LSP.2016.2573159

Feature Selection Embedded Subspace Clustering

Chong Peng, Zhao Kang, Ming Yang, Qiang Cheng

Internal Medicine

Research output: Contribution to journal › Article › peer-review

40 Scopus citations

Abstract

We propose a new subspace clustering method that integrates feature selection into subspace clustering. Rather than using all features to construct a low-rank representation of the data, we find such a representation using only relevant features, which helps in revealing more accurate data relationships. Two variants are proposed by using both convex and nonconvex rank approximations. Extensive experimental results confirm the effectiveness of the proposed method and models.

Original language	English
Article number	7479529
Pages (from-to)	1018-1022
Number of pages	5
Journal	IEEE Signal Processing Letters
Volume	23
Issue number	7
DOIs	https://doi.org/10.1109/LSP.2016.2573159
State	Published - Jul 2016

Bibliographical note

Funding Information:
Manuscript received April 20, 2016; revisedMay 16, 2016; accepted May 16, 2016. Date of publication May 26, 2016; date of current version June 23, 2016. This work was supported by NSF under Grant IIS-1218712. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Marco Duarte.

Publisher Copyright:
© 1994-2012 IEEE.

ASJC Scopus subject areas

Signal Processing
Applied Mathematics
Electrical and Electronic Engineering

Access to Document

10.1109/LSP.2016.2573159

Cite this

@article{a1b64cdc5d00413cb32bad85bf9a51b0,

title = "Feature Selection Embedded Subspace Clustering",

abstract = "We propose a new subspace clustering method that integrates feature selection into subspace clustering. Rather than using all features to construct a low-rank representation of the data, we find such a representation using only relevant features, which helps in revealing more accurate data relationships. Two variants are proposed by using both convex and nonconvex rank approximations. Extensive experimental results confirm the effectiveness of the proposed method and models.",

author = "Chong Peng and Zhao Kang and Ming Yang and Qiang Cheng",

note = "Funding Information: Manuscript received April 20, 2016; revisedMay 16, 2016; accepted May 16, 2016. Date of publication May 26, 2016; date of current version June 23, 2016. This work was supported by NSF under Grant IIS-1218712. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Marco Duarte. Publisher Copyright: {\textcopyright} 1994-2012 IEEE.",

year = "2016",

month = jul,

doi = "10.1109/LSP.2016.2573159",

language = "English",

volume = "23",

pages = "1018--1022",

number = "7",

}

TY - JOUR

T1 - Feature Selection Embedded Subspace Clustering

AU - Peng, Chong

AU - Kang, Zhao

AU - Yang, Ming

AU - Cheng, Qiang

N1 - Funding Information: Manuscript received April 20, 2016; revisedMay 16, 2016; accepted May 16, 2016. Date of publication May 26, 2016; date of current version June 23, 2016. This work was supported by NSF under Grant IIS-1218712. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Marco Duarte. Publisher Copyright: © 1994-2012 IEEE.

PY - 2016/7

Y1 - 2016/7

N2 - We propose a new subspace clustering method that integrates feature selection into subspace clustering. Rather than using all features to construct a low-rank representation of the data, we find such a representation using only relevant features, which helps in revealing more accurate data relationships. Two variants are proposed by using both convex and nonconvex rank approximations. Extensive experimental results confirm the effectiveness of the proposed method and models.

AB - We propose a new subspace clustering method that integrates feature selection into subspace clustering. Rather than using all features to construct a low-rank representation of the data, we find such a representation using only relevant features, which helps in revealing more accurate data relationships. Two variants are proposed by using both convex and nonconvex rank approximations. Extensive experimental results confirm the effectiveness of the proposed method and models.

UR - http://www.scopus.com/inward/record.url?scp=84979055676&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84979055676&partnerID=8YFLogxK

U2 - 10.1109/LSP.2016.2573159

DO - 10.1109/LSP.2016.2573159

M3 - Article

AN - SCOPUS:84979055676

VL - 23

SP - 1018

EP - 1022

IS - 7

M1 - 7479529

ER -

Feature Selection Embedded Subspace Clustering

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this