Efficient breadth-first reduct search
| dc.contributor.author | Boonjing, Veera | |
| dc.contributor.author | Chanvarasuth, Pisit | |
| dc.date.accessioned | 2026-08-06T10:28:31Z | |
| dc.date.available | 2026-08-06T10:28:31Z | |
| dc.date.issued | 2020-05-01 | |
| dc.description.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. | |
| dc.identifier.citation | Mathematics, 8(5), 2020 | |
| dc.identifier.doi | 10.3390/MATH8050833 | |
| dc.identifier.issn | 22277390 | |
| dc.identifier.other | 2-s2.0-85087079827 | |
| dc.identifier.uri | https://dspace.kmitl.ac.th/handle/123456789/10923 | |
| dc.source | Mathematics | |
| dc.subject | Breadth-first search | |
| dc.subject | Feature selection | |
| dc.subject | Reduct | |
| dc.subject | Rooted graph | |
| dc.subject | Subset | |
| dc.title | Efficient breadth-first reduct search | |
| dc.type | Article |