Next Article in Journal
Applying Fuzzy AHP and TOPSIS Method to Identify Key Organizational Capabilities
Previous Article in Journal
Selecting the Low-Carbon Tourism Destination: Based on Pythagorean Fuzzy Taxonomy Method
Open AccessArticle

Efficient Breadth-First Reduct Search

Department of Computer Engineering, Faculty of Engineering, King Mongkut’s Institute of Technology Ladkrabang, Ladkrabang, Bangkok 10520, Thailand
School of Management Technology, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani, Bangkok 10200, Thailand
Author to whom correspondence should be addressed.
Mathematics 2020, 8(5), 833;
Received: 14 April 2020 / Revised: 12 May 2020 / Accepted: 18 May 2020 / Published: 21 May 2020
(This article belongs to the Section Mathematics and Computer Science)
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. View Full-Text
Keywords: reduct; subset; feature selection; breadth-first search; rooted graph reduct; subset; feature selection; breadth-first search; rooted graph
Show Figures

Figure 1

MDPI and ACS Style

Boonjing, V.; Chanvarasuth, P. Efficient Breadth-First Reduct Search. Mathematics 2020, 8, 833.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Search more from Scilit
Back to TopTop