4.7 Article

Hessian Semi-Supervised Sparse Feature Selection Based on L-2,L-1/2-Matrix Norm

期刊

IEEE TRANSACTIONS ON MULTIMEDIA
卷 17, 期 1, 页码 16-28

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TMM.2014.2375792

关键词

Hessian regularization; l(2,1/2)-matrix norm; semi-supervised learning; sparse feature selection; web image annotation

资金

  1. National Key Basic Research Program of China [2012CB316304]
  2. New Century Excellent Talents in University [NCET-12-0768]
  3. Youth Foundation Project of Hebei Colleges and University Scientific and Technology Research [QN2014026]
  4. National Natural Science Foundation of China [61172128]
  5. Fundamental Research Funds for the Central Universities [2013JBM020, 2013JBZ003]
  6. Program for Innovative Research Team in University of Ministry of Education of China [IRT201206]
  7. Beijing Higher Education Young Elite Teacher Project [YETP0544]
  8. Research Fund for the Doctoral Program of Higher Education of China [20120009110008, 20120009120009]

向作者/读者索取更多资源

Semi-supervised sparse feature selection, which can exploit the small number labeled data and large number unlabeled data simultaneously, has become an important technique in many applications on large-scale web image owing to its high efficiency and effectiveness. Recently, graph Laplacian-based semi-supervised sparse feature selection has obtained considerable attention, but it suffers with only few labeled data because Laplacian regularization is short of extrapolating power. In this paper we propose a novel semi-supervised sparse feature selection framework based on Hessian regularization and l(2,1/2)-matrix norm, namely Hessian sparse feature selection based on L-2,L-1/2-matrix norm (HFSL). Hessian regularization favors functions whose values vary linearly with respect to geodesic distance and preserves the local manifold structure well, leading to good extrapolating power to boost semi-supervised learning, and then to enhance HFSL performance. The l(2,1/2)-matrix norm model makes HFSL select the most discriminative sparse features with good robustness. An efficient iterative algorithm is designed to optimize the objective function. We apply our algorithm into the image annotation task and conduct extensive experiments on two web image datasets. The results demonstrate that our algorithm outperforms state-of-the-art sparse feature selection methods and is promising for large-scale web image applications.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据