Journal
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS
Volume 10, Issue 1, Pages 95-103Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S021848850200134X
Keywords
rough sets; incomplete information systems; knowledge reduction; complexity of algorithm
Categories
Ask authors/readers for more resources
Rough set theory is emerging as a powerful tool for reasoning about data, knowledge reduction is one of the important topics in the research on rough set theory. It has been proven that finding the minimal reduct of an information system is a NP-hard problem, so is finding the minimal reduct of an incomplete information system. Main reason of causing NP-hard is combination problem of attributes. In this paper, knowledge reduction is defined from the view of information, a heuristic algorithm based on rough entropy for knowledge reduction is proposed in incomplete information systems, the time complexity of this algorithm is O(\A\(2)\U\). An illustrative example is provided that shows the application potential of the algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available