An attribute reduction algorithm in a decision based on improved entropy
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/27/2/500Abstract
In rough set theory, many attribute reduction algorithms based on information entropy have been proposed. Although this algorithms reduce the time complexity, they do not obtain the minimal reduction in inconsistent decision tables. In this paper, we propose an improved entropy and we prove that the attribute reduction based on this entropy is equivalent to Pawlak's reduction in inconsistent decision tables. As a result, a complete heuristic algorithm was designed to find the attribute reduction based on improved entropy and its time complexity is O(|C|2 |U|), where |C| is the number of condition attributes, and |U| is the number of objects.
Metrics
Downloads
Published
How to Cite
Issue
Section
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.