Wang, Jue; Miao, Duoqian Analysis on attribute reduction strategies of rough set. (English) Zbl 0902.68049 J. Comput. Sci. Technol. 13, No. 2, 189-192 (1998). 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. Cited in 10 Documents MSC: 68P15 Database theory Keywords:knowledge discovery in databases; rough set theory PDF BibTeX XML Cite \textit{J. Wang} and \textit{D. Miao}, J. Comput. Sci. Technol. 13, No. 2, 189--192 (1998; Zbl 0902.68049) Full Text: DOI OpenURL