Attribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method

DOI

10.2991/iiicec-15.2015.80How to use a DOI?

Keywords

Rough Set; Positive Region; Discernibility Matrix; Algebra Method; Complexity

Abstract

There are many algorithms of attribute reduction based on discernibility matrix, where the element of the discernibility matrix is used as heuristic information. But there are few algebra methods about attribute reduction based on discernibility matrix. In this paper, we proposed an algorithm of attribute reduction with algebra method. First of all, we should design an algorithm to compute the heuristic information. Then we used this heuristic information to design an new algorithm of attribute reduction based on discernibility matrix, whose time complexity is O(|C|2|U|), and whose space complexity is O(|U|). At last, we used an example to illustrate the new algorithm’s validity and high efficiency.

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  - Jing Gao
AU  - Hui Ma
AU  - Zhidong Han
PY  - 2015/03
DA  - 2015/03
TI  - Attribute Reduction Algorithm Based on Discernibility Matrix with Algebraic Method
BT  - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference
PB  - Atlantis Press
SP  - 349
EP  - 353
SN  - 2352-538X
UR  - https://doi.org/10.2991/iiicec-15.2015.80
DO  - 10.2991/iiicec-15.2015.80
ID  - Gao2015/03
ER  -