首页|Algorithm for computing all the shortest reducts based on a new pruning strategy
Algorithm for computing all the shortest reducts based on a new pruning strategy
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
ABSTR A C T In this paper, we introduce an algorithm for computing all the shortest reducts in a deci-sion system. The proposed algorithm is based on determining the size of the shortest reducts using a small super-reduct and some new pruning methods. Once the size of the shortest reduct is determined, all other reducts of the same size are found applying the new pruning methods. The results of our experiments using several synthetic and real -world decision systems show that the proposed algorithm is, in most cases, faster than the state of the art algorithms for computing all the shortest reducts reported in the literature. (c) 2021 Elsevier Inc. All rights reserved.
NSTL
Elsevier
