Regular Article: Matroids on Partially Ordered Sets
Advances in Applied Mathematics
Rough set approach to incomplete information systems
Information Sciences: an International Journal
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Rough-Fuzzy MLP: Modular Evolution, Rule Generation, and Evaluation
IEEE Transactions on Knowledge and Data Engineering
Accuracy and Coverage in Rough Set Rule Induction
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
Benchmarking Attribute Selection Techniques for Discrete Class Data Mining
IEEE Transactions on Knowledge and Data Engineering
An axiomatic characterization of a fuzzy generalization of rough sets
Information Sciences—Informatics and Computer Science: An International Journal
Constructive and axiomatic approaches of fuzzy approximation operators
Information Sciences—Informatics and Computer Science: An International Journal - Mining stream data
Topological approaches to covering rough sets
Information Sciences: an International Journal
Learning fuzzy rules from fuzzy samples based on rough set technique
Information Sciences: an International Journal
Rough fuzzy approximations on two universes of discourse
Information Sciences: an International Journal
Generalized rough sets over fuzzy lattices
Information Sciences: an International Journal
The lower and upper approximations in a quotient hypermodule with respect to fuzzy sets
Information Sciences: an International Journal
Neighborhood rough set based heterogeneous feature subset selection
Information Sciences: an International Journal
The algebraic structures of generalized rough set theory
Information Sciences: an International Journal
Generalized rough sets based on reflexive and transitive relations
Information Sciences: an International Journal
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Discernibility matrix simplification for constructing attribute reducts
Information Sciences: an International Journal
Relationship among basic concepts in covering-based rough sets
Information Sciences: an International Journal
On the structure of generalized rough sets
Information Sciences: an International Journal
The investigation of the Bayesian rough set model
International Journal of Approximate Reasoning
Rough implication operator based on strong topological rough algebras
Information Sciences: an International Journal
Diverse reduct subspaces based co-training for partially labeled data
International Journal of Approximate Reasoning
Rule learning for classification based on neighborhood covering reduction
Information Sciences: an International Journal
Modeling rough granular computing based on approximation spaces
Information Sciences: an International Journal
Information Sciences: an International Journal
Tolerance spaces: Origins, theoretical aspects and applications
Information Sciences: an International Journal
Matroidal approaches to rough sets via closure operators
International Journal of Approximate Reasoning
Incomplete Multigranulation Rough Set
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Test-cost-sensitive attribute reduction
Information Sciences: an International Journal
An Axiomatic Approach to the Roughness Measure of Rough Sets
Fundamenta Informaticae
Complete Orders, Categories and Lattices of Approximations
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Tolerance Approximation Spaces
Fundamenta Informaticae
Matroidal structure of rough sets and its characterization to attribute reduction
Knowledge-Based Systems
Rough set approach to incomplete numerical data
Information Sciences: an International Journal
Nullity-based matroid of rough sets and its application to attribute reduction
Information Sciences: an International Journal
Hi-index | 0.07 |
Rough sets provide an efficient tool for attribute reduction and rule extraction. However, many important problems in rough set theory, including attribute reduction, are NP-hard and therefore the algorithms for solving them are usually greedy. As a generalization of linear independence in vector spaces, matroids have wide applications in diverse fields, particularly in greedy algorithm design. In this paper, we propose an integration of rough sets and matroids to exploit the advantages of both theories. Specifically, we present definitions of lower and upper rough matroids based on relations from the viewpoint of approximation operators. It is interesting that lower rough matroids based on partial orders coincide with poset matroids, which are a well-known generalization of matroids. A matroid is represented by the lower rough matroid based on both a partial order and an equivalence relation. Lower and upper rough matroids based on equivalence relations coincide with each other. Finally, we present some special types of examples of rough matroids from the viewpoints of approximations and graphs. These interesting results demonstrate the potential for the combination between rough sets and matroids.