Rough set algorithms in classification problem
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Parallel Computation of Reducts
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Scalable improved quick reduct: sample based
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
Duality in Rough Set Theory Based on the Square of Opposition
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
| Hi-index | 0.00 |
Calculating reducts is a very important process. Unfortunately, the process of computing all reducts in NP-hard. There are a lot of heuristic solutions for computing reducts, but they do not guarantee achieving complete set of reducts. We propose here three versions of an exact algorithm, designed for parallel processing. We present here how to decompose the problem of calculating reducts, so that parallel calculations are efficient.