LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Structure Preserving Sparse Coding for Data Representation

Photo by lukechesser from unsplash

Sparse coding methods have shown the superiority in data representation. However, traditional sparse coding methods cannot explore the manifold structure embedded in data. To alleviate this problem, a novel method,… Click to show full abstract

Sparse coding methods have shown the superiority in data representation. However, traditional sparse coding methods cannot explore the manifold structure embedded in data. To alleviate this problem, a novel method, called Structure Preserving Sparse Coding (SPSC), is proposed for data representation. SPSC imposes both local affinity and distant repulsion constraints on the model of sparse coding. Therefore, the proposed SPSC method can effectively exploit the structure information of high dimensional data. Beside, an efficient optimization scheme for our proposed SPSC method is developed, and the convergence analysis on three datasets are presented. Extensive experiments on several benchmark datasets have shown the superior performance of our proposed method compared with other state-of-the-art methods.

Keywords: preserving sparse; data representation; structure preserving; sparse coding; structure

Journal Title: Neural Processing Letters
Year Published: 2018

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.