Skip to main content
SpringerLink
Log in

Analysis on attribute reduction strategies of rough set

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Automation, Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Wang Jue & Miao Duoqian

Authors
  1. Wang Jue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miao Duoqian
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by ‘863’ Program and NNSF of China.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, J., Miao, D. Analysis on attribute reduction strategies of rough set. J. of Comput. Sci. & Technol. 13, 189–192 (1998). https://doi.org/10.1007/BF02946606

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946606

Keywords

Search

Navigation