Learning a subspace for clustering via pattern shrinking

Chenping Hou, Feiping Nie, Yuanyuan Jiao, Changshui Zhang, Yi Wu

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

Clustering is a basic technique in information processing. Traditional clustering methods, however, are not suitable for high dimensional data. Thus, learning a subspace for clustering has emerged as an important research direction. Nevertheless, the meaningful data are often lying on a low dimensional manifold while existing subspace learning approaches cannot fully capture the nonlinear structures of hidden manifold. In this paper, we propose a novel subspace learning method that not only characterizes the linear and nonlinear structures of data, but also reflects the requirements of following clustering. Compared with other related approaches, the proposed method can derive a subspace that is more suitable for high dimensional data clustering. Promising experimental results on different kinds of data sets demonstrate the effectiveness of the proposed approach.

Original languageEnglish
Pages (from-to)871-883
Number of pages13
JournalInformation Processing and Management
Volume49
Issue number4
DOIs
StatePublished - 2013
Externally publishedYes

Keywords

  • Clustering
  • Pattern shrinking
  • Subspace learning

Fingerprint

Dive into the research topics of 'Learning a subspace for clustering via pattern shrinking'. Together they form a unique fingerprint.

Cite this