Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Reduction algorithms based on discernibility matrix: the ordered attributes method
Journal of Computer Science and Technology
Finding Reducts in Composed Information Systems
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Parallel Reducts in a Series of Decision Subsystems
CSO '09 Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization - Volume 02
A rough set and rule tree based incremental knowledge acquisition algorithm
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Parallel reducts based on attribute significance
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
A new discernibility matrix and function
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Hi-index | 0.00 |
F-rough sets are new rough set model, which is consistent with parallel reducts. In this paper, the methods of classification (decision) with parallel reducts and F-rough sets are discussed. Unlike Pawlak rough sets or other rough set models, there may be many benchmarks for classifying(deciding). Three strategies for classifying(deciding) are proposed, including specific decision subsystem, decision subsystem selected randomly and deciding by a majority vote.