Local and global regularized sparse coding for data representation
File version
Accepted Manuscript (AM)
Author(s)
Zhou, Jun
Huang, Pu
Yu, Xun
Yang, Zhangjing
Zhao, Chunxia
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
Abstract
Recently, sparse coding has been widely adopted for data representation in real-world applications. In order to consider the geometric structure of data, we propose a novel method, local and global regularized sparse coding (LGSC), for data representation. LGSC not only models the global geometric structure by a global regression regularizer, but also takes into account the manifold structure using a local regression regularizer. Compared with traditional sparse coding methods, the proposed method can preserve both global and local geometric structures of the original high-dimensional data in a new representation space. Experimental results on benchmark datasets show that the proposed method can improve the performance of clustering.
Journal Title
Neurocomputing
Conference Title
Book Title
Edition
Volume
175
Issue
Part A
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2016 Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits unrestricted, non-commercial use, distribution and reproduction in any medium, providing that the work is properly cited.
Item Access Status
Note
Access the data
Related item(s)
Subject
Engineering
Psychology
Information and computing sciences