.png){kind=icon}
返回
Cost-sensitive sparse subset selection
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-023-01979-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Selecting a few important representatives that could reveal the intrinsic structure of a data set with massive data samples, i.e., subset selection, is very useful for different applications in machine learning and information retrieval domains. In this paper, we propose a cost-sensitive sparse regression-based subset selection method, termed cost-sensitive sparse subset selection (CS4). CS4 considers the cost of different subsets for the prediction of all the data samples in a given data set and can choose a subset that has minimal prediction cost. Hence, compared to the related sparse regression-based methods, CS4 is capable of selecting the most informative representatives to characterize the structures of data sets. Moreover, we present an optimization algorithm for solving CS4 problem. The convergence and computation complexity of the algorithm have been analyzed. The relationships between CS4 and the related algorithms have been also discussed. Finally, the experiments on representative selection and classification show the effectiveness and superiorities of CS4.
Keyword:
Subset selction
Convex relaxtion methods
Cost-senstitive
l(1,q) norm
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
A comprehensive survey on recent metaheuristics for feature selection对最近用于特征选择的元启发式方法的综合调查.png)
NEUROCOMPUTING
OAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏
查看更多内容