IDEAS home Printed from https://ideas.repec.org/a/spr/fuzinf/v2y2010i4d10.1007_s12543-010-0061-6.html
   My bibliography  Save this article

An efficient algorithm for Pawlak reduction based on simplified discernibility matrix

Author

Listed:
  • Zhang-yan Xu

    (Guangxi Normal University)

  • Bing-ru Yang

    (Beijing University of Science and Technology)

  • Wen-bin Qian

    (Beijing University of Science and Technology)

  • Wen-hao Shu

    (Guangxi Normal University)

Abstract

Since the definition of attribute reduction based on classic discernibility matrix differs from that of it based on positive region, a new simplified discernibility matrix and the corresponding definition of attribute reduction were proposed. At the same time, it proves that the proposed definition is identical to its definition based on positive region. For computing simplified discernibility matrix, the indiscernibility relation, which is also called equivalence relation, should usually be calculated at first, so a new algorithm for computing equivalence relation was designed with radix sorting, whose temporal complexity is O(|C||U|). Furthermore, an efficient attribute reduction algorithm is proposed, whose temporal complexity and spatial complexity are cut down to max(O(|C|2|U′ pos ||U′|,O(|U||C|)) and max(O(|C||U′ pos ||U′|,O(|U|)) respectively. At last, an example is used to illustrate efficiency of the new algorithms.

Suggested Citation

  • Zhang-yan Xu & Bing-ru Yang & Wen-bin Qian & Wen-hao Shu, 2010. "An efficient algorithm for Pawlak reduction based on simplified discernibility matrix," Fuzzy Information and Engineering, Springer, vol. 2(4), pages 433-443, December.
    • Handle: RePEc:spr:fuzinf:v:2:y:2010:i:4:d:10.1007_s12543-010-0061-6
    DOI: 10.1007/s12543-010-0061-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12543-010-0061-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12543-010-0061-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:fuzinf:v:2:y:2010:i:4:d:10.1007_s12543-010-0061-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.