×

Analysis on attribute reduction strategies of rough set. (English) Zbl 0902.68049

Summary: Several strategies for the minimal attribute reduction with polynomial time complexity \((O(n^k))\) have been developed in rough set theory. Are they complete? While investigating the attribute reduction strategy based on the discernibility matrix (DM), a counterexample is constructed theoretically, which demonstrates that these strategies are all incomplete with respect to the minimal reduction.

MSC:

68P15 Database theory
PDF BibTeX XML Cite
Full Text: DOI