Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model

被引:7
作者
Fan, Anjing [1 ]
Zhao, Hong [1 ]
Zhu, William [1 ]
机构
[1] Minnan Normal Univ, Lab Granular Comp, Zhangzhou, Peoples R China
基金
美国国家科学基金会;
关键词
Adaptive neighborhood; Attribute reduction; Heterogeneous attribute; Granular computing; Test-cost-sensitive learning; CONFIDENCE RULE ACQUISITION; ROUGH SET; INFORMATION; ALGORITHM; SELECTION;
D O I
10.1007/s00500-015-1770-x
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Test-cost-sensitive attribute reduction is an important component in data mining applications, and plays a key role in cost-sensitive learning. Some previous approaches in test-cost-sensitive attribute reduction focus mainly on homogeneous datasets. When heterogeneous datasets must be taken into account, the previous approaches convert nominal attribute to numerical attribute directly. In this paper, we introduce an adaptive neighborhood model for heterogeneous attribute and deal with test-cost-sensitive attribute reduction problem. In the adaptive neighborhood model, the objects with numerical attributes are dealt with classical covering neighborhood, and the objects with nominal attributes are dealt with the overlap metric neighborhood. Compared with the previous approaches, the proposed model can avoid that objects with different values of nominal attribute are classified into one neighborhood. The number of inconsistent objects of a neighborhood reflects the discriminating capability of an attribute subset. With the adaptive neighborhood model, an inconsistent objects-based heuristic reduction algorithm is constructed. The proposed algorithm is compared with the -weighted heuristic reduction algorithm which nominal attribute is normalized. Experimental results demonstrate that the proposed algorithm is more effective and more practical significance than the -weighted heuristic reduction algorithm.
引用
收藏
页码:4813 / 4824
页数:12
相关论文
共 43 条
[1]  
Andersen TL, 1995, P 10 INT S COMP INF
[2]   A Granular Computing approach to the design of optimized graph classification systems [J].
Bianchi, Filippo Maria ;
Livi, Lorenzo ;
Rizzi, Antonello ;
Sadeghian, Alireza .
SOFT COMPUTING, 2014, 18 (02) :393-412
[3]   Consistency-based search in feature selection [J].
Dash, M ;
Liu, HA .
ARTIFICIAL INTELLIGENCE, 2003, 151 (1-2) :155-176
[4]   Learning cost-sensitive active classifiers [J].
Greiner, R ;
Grove, AJ ;
Roth, D .
ARTIFICIAL INTELLIGENCE, 2002, 139 (02) :137-174
[5]   Neighborhood rough set based heterogeneous feature subset selection [J].
Hu, Qinghua ;
Yu, Daren ;
Liu, Jinfu ;
Wu, Congxin .
INFORMATION SCIENCES, 2008, 178 (18) :3577-3594
[6]   Neighborhood classifiers [J].
Hu, Qinghua ;
Yu, Daren ;
Me, Zongxia .
EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (02) :866-876
[7]  
Hunt E. B., 1966, EXPT INDUCTION
[8]   Cost-sensitive feature acquisition and classification [J].
Ji, Shihao ;
Carin, Lawrence .
PATTERN RECOGNITION, 2007, 40 (05) :1474-1485
[9]   Minimum cost attribute reduction in decision-theoretic rough set models [J].
Jia, Xiuyi ;
Liao, Wenhe ;
Tang, Zhenmin ;
Shang, Lin .
INFORMATION SCIENCES, 2013, 219 :151-167
[10]   A hybrid genetic algorithm for feature subset selection in rough set theory [J].
Jing, Si-Yuan .
SOFT COMPUTING, 2014, 18 (07) :1373-1382