首页|Minimal Element Selection in the Discernibility Matrix for Attribute Reduction?

Minimal Element Selection in the Discernibility Matrix for Attribute Reduction?

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
Discernibility matrix is a beautiful theoretical result to get reducts in the rough set, but the existing algorithms based on discernibility matrix share the same problem of heavy computing load and large store space, since there are numerous redundancy elements in discernibility matrix and these algorithms employ all elements to find reducts. We introduce a new method to compute attribute significance. A novel approach is proposed, called minimal element selection tree, which utilizes many strategies to eliminate redundancy elements in discernibility matrix. This paper presents two methods to find out a minimal reduct for a given decision table based this tree structure. The experimental results with UCI data show that the proposed approaches are effective and efficient than the benchmark methods.

Rough setDiscernibility matrixMinimal element selection treeAttribute significanceMinimal reduct

JIANG Yu

展开 >

College of Software Engineering, Chengdu University of Information Technology, Chengdu 610225, China

This work is supported by the Young and Middle-aged Academic Leader Foundation of Chengdu University of Information Technology

J201609

2019

10.1049/cje.2018.06.018

中国电子杂志(英文版)

中国电子杂志(英文版)

CSTPCDCSCDSCIEI
ISSN：1022-4653
年,卷(期)：2019.28(1)
  • 1
  • 24