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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Covering with Reducts - A Fast Algorithm for Rule Generation
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
A new rough sets model based on database systems
Fundamenta Informaticae - Special issue on the 9th international conference on rough sets, fuzzy sets, data mining and granular computing (RSFDGrC 2003)
Ensembles of Classifiers Based on Approximate Reducts
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
An application of rough sets to Monk's problems solving
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
On Covering Attribute Sets by Reducts
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Extracting Relevant Information about Reduct Sets from Data Tables
Transactions on Rough Sets IX
Graphical representation of information on the set of reducts
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Dynamic rule-based similarity model for DNA microarray data
Transactions on Rough Sets XV
| Hi-index | 0.00 |
A core in information system is a set of attributes globally necessary to distinct objects from different decision classes (i.e., the intersection of all reducts of the information system). A notion of a pairwise core (2-core), which naturally extends the definition of a core into the case of pairs of attributes is presented. Some useful features concerned with the graph representation of pairwise cores are discussed. The paper presents also practical application of the notion of 2-core. It is known that a core (if exists) may be used to improve the reduct finding methods, since there exist polynomial algorithms for core construction. The same may be proven for a 2-core, which may be also used for estimation of minimal reduct size.