4.7 Article

Robust classification using l2,1-norm based regression model

期刊

PATTERN RECOGNITION
卷 45, 期 7, 页码 2708-2718

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2012.01.003

关键词

l(2,1)-norm; Sparsity regularization; Nearest subspace; Multiple task learning; Dummy variables

资金

  1. NSF of China [10771220, 90920007]
  2. Ministry of Education of China [SRFDP-20070558043]
  3. Postdoctoral Science Foundation of China [2011M501361]
  4. City University of Hong Kong [9610034, 7008094]

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

A novel classification method using l(2,1)-norm based regression is proposed in this paper. The l(2,1)-norm based loss function is robust to outliers or large variations distributed in the given data, and the l(2,1)-norm regularization term selects correlated samples across the whole training set with grouped sparsity. A probabilistic interpretation under the multiple task learning framework presents theoretical foundation for the optimal solution. Complexity analysis of our proposed classification algorithm is also presented. Several benchmark data sets including facial images and gene expression data are used for evaluating the effectiveness of the new proposed algorithm, and the results show competitive performance particularly better than those using dummy matrix as the response variables. This result is very useful since it is important for selecting appropriate response variables in classification oriented regression models. (C) 2012 Elsevier Ltd. All rights reserved.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据