Intelligent partitioning for feature selection

被引:24
作者
Olafsson, S [1 ]
Yang, J
机构
[1] Iowa State Univ, Dept Ind Engn, Ames, IA 50011 USA
[2] Chonbuk Natl Univ, Dept Ind & Informat Syst Engn, Jeonju 561756, South Korea
关键词
data mining; feature selection; analysis of algorithms; entropy;
D O I
10.1287/ijoc.1040.0104
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper develops a new optimization-based feature-selection framework for knowledge discovery in databases. Algorithms following this new framework have attractive theoretical properties such as proven convergence to an optimal set of relevant features and the ability for deriving rigorous statements regarding the quality of the set that is found. Within this framework both wrapper and filter algorithms are derived, and numerical experiments show the new methodology to perform well with respect to accuracy and simplicity of the set of features found to be relevant.
引用
收藏
页码:339 / 355
页数:17
相关论文
共 20 条
[1]  
AHA DW, 1996, ARTIFICIAL INTELLIGE, V5
[2]  
[Anonymous], 1998, FEATURE EXTRACTION C
[3]  
[Anonymous], [No title captured], DOI DOI 10.1145/347090.347169
[4]  
[Anonymous], 1999, P ICONIP ANZIIS ANNE
[5]  
[Anonymous], 1993, P 13 INT JOINT C ART
[6]   Perspectives on operations research in data and knowledge management [J].
Basu, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 111 (01) :1-14
[7]  
Blake C.L., 1998, UCI repository of machine learning databases
[8]  
Bradley P. S., 1998, INFORMS Journal on Computing, V10, P209, DOI 10.1287/ijoc.10.2.209
[9]   Mathematical programming for data mining: Formulations and challenges [J].
Bradley, PS ;
Fayyad, UM ;
Mangasarian, OL .
INFORMS JOURNAL ON COMPUTING, 1999, 11 (03) :217-238
[10]  
Caruna R, 1994, P 11 INT C MACH LEAR, P28