Feature selection based on fuzzy extension matrix for multi-class problem

被引:0
作者
Wang, XZ [1 ]
Lu, XY [1 ]
Zhang, F [1 ]
机构
[1] Hebei Univ, Fac Math & Comp Sci, Machine Learning Ctr, Baoding 071002, Peoples R China
来源
PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2004年
关键词
feature subset; information entropy; fuzzy-valued feature; fuzzy extension matrix; similarity degree;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature subset selection is one of the widely used and practical methods for pattern recognition and classification, which aims to reduce the number of features to be used. Optimal fuzzy-valued feature subset selection (OFFSS) method is efficient for feature subset selection of two-class problem. However, the original OFFSS is not suitable for multi-class problem. This paper gives an improved version of OFFSS. The OFFSS algorithm is extended to the multi-class problem in which information entropy is used to reduce computational complexity of the method. The feasibility and simplicity of the improved algorithm are demonstrated by applying it to fuzzy decision tree induction.
引用
收藏
页码:2032 / 2035
页数:4
相关论文
共 8 条
[1]   USING MUTUAL INFORMATION FOR SELECTING FEATURES IN SUPERVISED NEURAL-NET LEARNING [J].
BATTITI, R .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (04) :537-550
[2]   Feature analysis: Neural network and fuzzy set theoretic approaches [J].
De, RK ;
Pal, NR ;
Pal, SK .
PATTERN RECOGNITION, 1997, 30 (10) :1579-1590
[3]   AE1 - AN EXTENSION MATRIX APPROXIMATE METHOD FOR THE GENERAL COVERING PROBLEM [J].
HONG, JR .
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1985, 14 (06) :421-437
[4]  
Quinlan J. R., 1986, Machine Learning, V1, P81, DOI 10.1007/BF00116251
[5]  
TSANG ECC, 2003, IEEE T FUZZ SYST APR, V11
[6]  
*UCI, REP MACH LEARN DAT D
[7]  
WEBER R, 1992, P 2 INT C FUZZ LOG N, P265
[8]  
YUAN YF, 1995, INDUCTION FUZZY DECI