返回
Locality-constrained max-margin sparse coding
DOI:10.1016/j.patcog.2016.12.015.png)
摘要
En 中文
This work devises a locality-constrained max-margin sparse coding (LC-MMSC) framework, which jointly considers reconstruction loss and hinge loss simultaneously. Traditional sparse coding algorithms use l(1) constraint to force the representation to be sparse, leading to computational expensive process to optimize the objective function. This work uses locality constraint in the framework to preserve information of data locality and avoid the optimization of l(1). The obtained representation can achieve the goal of data locality and sparsity. Additionally, this work optimizes coefficients, dictionaries and classification parameters simultaneously, and uses block coordinate descent to learn all the components of the proposed model. This work uses semi supervised learning approach in the proposed framework, and the goal is to use both labeled data and unlabeled data to achieve accurate classification performance and improve the generalization of the model. We provide theoretical analysis on the convergence of the proposed LC-MMSC algorithm based on Zangwill's global convergence theorem. This work conducts experiments on three real datasets, including Extended YaleB dataset, AR face dataset and Caltech101 dataset. The experimental results indicate that the proposed algorithm outperforms other comparison algorithms.
Keyword:
Locality
Sparse Coding
Max-margin
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Small Silencing RNAs in Plants Are Mobile and Direct Epigenetic Modification in Recipient Cells
Science
IF0
Locality-sensitive dictionary learning for sparse representation based classification
PATTERN RECOGNITION
IF7.6
Copper ferrocyanide loaded track etched membrane: an effective cesium adsorbent负载亚铁氰化铜的径迹蚀刻膜: 一种有效的铯吸附剂

