.png){kind=icon}
返回
Multi-label learning under feature extraction budgets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2013.12.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of learning sparse linear models for multi-label prediction tasks under a hard constraint on the number of features. Such budget constraints are important in domains where the acquisition of the feature values is costly. We propose a greedy multi-label regularized least-squares algorithm that solves this problem by combining greedy forward selection search with a cross-validation based selection criterion in order to choose, which features to include in the model. We present a highly efficient algorithm for implementing this procedure with linear time and space complexities. This is achieved through the use of matrix update formulas for speeding up feature addition and cross-validation computations. Experimentally, we demonstrate that the approach allows finding sparse accurate predictors on a wide range of benchmark problems, typically outperforming the multi-task lasso baseline method when the budget is small. (C) 2013 Elsevier B. V. All rights reserved.
Keyword:
Feature selection
Greedy forward selection
Multi-label learning
Regularized least-squares
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
THE MEANING AND USE OF THE AREA UNDER A RECEIVER OPERATING CHARACTERISTIC (ROC) CURVE受试者工作特征 (ROC) 曲线下面积的含义和用途.png)
RADIOLOGY
RADIOLOGYIF15.2
PREAI
分享收藏An extensive experimental comparison of methods for multi-label learningPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
ML-KNN: A lazy learning approach to multi-label leamingMl-knn: 一种多标签学习的懒惰学习方法PATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏
查看更多内容