Granular maximum decision entropy-based monotonic uncertainty measure for attribute reduction

被引:45
作者
Gao, Can [1 ,2 ]
Lai, Zhihui [1 ,2 ]
Zhou, Jie [1 ,2 ]
Wen, Jiajun [1 ,2 ]
Wong, Wai Keung [2 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen 518060, Peoples R China
[2] Hong Kong Polytech Univ, Inst Text & Clothing, Hong Kong, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Rough set theory; Attribute reduction; Uncertainty measure; Maximum decision; Knowledge granularity; 3-WAY DECISIONS; ROUGH; SELECTION;
D O I
10.1016/j.ijar.2018.10.014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Attribute reduction is considered an important preprocessing step in machine learning, pattern recognition, and data mining, and several attribute reduction measures based on rough set theory have been introduced to deal with vague, imprecise, or uncertain data. However, some of the measures inherently suffer from nonmonotonicity and redundancy. In this paper, a monotonic uncertainty measure, called granular maximum decision entropy (GMDE), is proposed. Specifically, we first develop a notion of maximum decision entropy. By integrating the uncertainty of the maximum decision entropy with the granulation of knowledge, a novel uncertainty measure is then presented, and its monotonicity is theoretically proved. We also provide a forward heuristic attribute reduction algorithm based on the proposed uncertainty measure, which could simultaneously select the informative attributes and remove the unnecessary attributes in the procedure of attribute reduction, thus resulting in high efficiency. The experiments conducted on several UCI data sets demonstrate that the proposed measure and algorithm are effective and computationally inexpensive and are superior to the representatives in terms of classification performance and efficiency. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:9 / 24
页数:16
相关论文
empty
未找到相关数据