IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i5p833-d361045.html
   My bibliography  Save this article

Efficient Breadth-First Reduct Search

Author

Listed:
  • Veera Boonjing

    (Department of Computer Engineering, Faculty of Engineering, King Mongkut’s Institute of Technology Ladkrabang, Ladkrabang, Bangkok 10520, Thailand)

  • Pisit Chanvarasuth

    (School of Management Technology, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani, Bangkok 10200, Thailand)

Abstract

This paper formulates the problem of determining all reducts of an information system as a graph search problem. The search space is represented in the form of a rooted graph. The proposed algorithm uses a breadth-first search strategy to search for all reducts starting from the graph root. It expands nodes in breadth-first order and uses a pruning rule to decrease the search space. It is mathematically shown that the proposed algorithm is both time and space efficient.

Suggested Citation

  • Veera Boonjing & Pisit Chanvarasuth, 2020. "Efficient Breadth-First Reduct Search," Mathematics, MDPI, vol. 8(5), pages 1-12, May.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:5:p:833-:d:361045
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/5/833/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/5/833/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:8:y:2020:i:5:p:833-:d:361045. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.