An Improved Heuristic Minimal Attribute Reduction Algorithm Based on Condition Information Entropy

DOI

10.2991/icmmita-15.2015.104How to use a DOI?

Keywords

Rough set; Minimum attribute reduction; Entropy

Abstract

Attributes reduction was one of the key problems in rough set theory. However, to find the minimum attribute reduction is a NP-hard problem. This paper proposed an improved algorithm of heuristic minimal attribute reduction. First it calculates the attribute importance and gets core, then taking the core as a starting point, it selects attributes according to attribute importance which is defined by entropy, and gets the minimum attributes reduction. It’s proved to be effective by theoretical analysis and example analysis.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Baoyi Wang
AU  - Xuefei Li
AU  - Shaomin Zhang
PY  - 2015/11
DA  - 2015/11
TI  - An Improved Heuristic Minimal Attribute Reduction Algorithm Based on Condition Information Entropy
BT  - Proceedings of the 2015 3rd International Conference on Machinery, Materials and Information Technology Applications
PB  - Atlantis Press
SP  - 538
EP  - 543
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmmita-15.2015.104
DO  - 10.2991/icmmita-15.2015.104
ID  - Wang2015/11
ER  -