Show simple item record

dc.contributor.authorZhao, Xiaowei
dc.contributor.authorNie, Feiping
dc.contributor.authorWang, Sen
dc.contributor.authorGuo, Jun
dc.contributor.authorXu, Pengfei
dc.contributor.authorChen, Xiaojiang
dc.date.accessioned2017-08-28T03:49:15Z
dc.date.available2017-08-28T03:49:15Z
dc.date.issued2017
dc.identifier.issn0899-7667
dc.identifier.doi10.1162/NECO_a_00950
dc.identifier.urihttp://hdl.handle.net/10072/344961
dc.description.abstractIn recent years, unsupervised two-dimensional (2D) dimensionality reduction methods for unlabeled large-scale data have made progress. However, performance of these degrades when the learning of similarity matrix is at the beginning of the dimensionality reduction process. A similarity matrix is used to reveal the underlying geometry structure of data in unsupervised dimensionality reduction methods. Because of noise data, it is difficult to learn the optimal similarity matrix. In this letter, we propose a new dimensionality reduction model for 2D image matrices: unsupervised 2D dimensionality reduction with adaptive structure learning (DRASL). Instead of using a predetermined similarity matrix to characterize the underlying geometry structure of the original 2D image space, our proposed approach involves the learning of a similarity matrix in the procedure of dimensionality reduction. To realize a desirable neighbors assignment after dimensionality reduction, we add a constraint to our model such that there are exact connected components in the final subspace. To accomplish these goals, we propose a unified objective function to integrate dimensionality reduction, the learning of the similarity matrix, and the adaptive learning of neighbors assignment into it. An iterative optimization algorithm is proposed to solve the objective function. We compare the proposed method with several 2D unsupervised dimensionality methods. K-means is used to evaluate the clustering performance. We conduct extensive experiments on Coil20, AT&T, FERET, USPS, and Yale data sets to verify the effectiveness of our proposed method.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherMIT Press
dc.relation.ispartofpagefrom1352
dc.relation.ispartofpageto1374
dc.relation.ispartofissue5
dc.relation.ispartofjournalNeural Computation
dc.relation.ispartofvolume29
dc.subject.fieldofresearchDistributed computing and systems software not elsewhere classified
dc.subject.fieldofresearchcode460699
dc.titleUnsupervised 2D dimensionality reduction with adaptive structure learning
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
dc.description.versionVersion of Record (VoR)
gro.rights.copyright© 2017 Massachusetts Institute of Technology. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.
gro.hasfulltextFull Text
gro.griffith.authorWang, Sen


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record