Geometric lattice structure of covering-based rough sets through matroids

DOI10.1155/2012/236307zbMath1264.05027arXiv1210.0075WikidataQ58906415 ScholiaQ58906415MaRDI QIDQ1952797

Aiping Huang, William Zhu

Publication date: 3 June 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.0075

zbMATH Keywords

transversal matroids; covering reductions; covering upper approximation operators; covering-based rough set theory; geometric lattice structures; search algorithm design

Mathematics Subject Classification ID

05B35: Combinatorial aspects of matroids and geometric lattices

Related Items

A rough set approach to the characterization of transversal matroids, Nullity-based matroid of rough sets and its application to attribute reduction, Connectedness of graphs and its application to connected matroids through covering-based rough sets

Cites Work

• Axiomatization and conditions for neighborhoods in a covering to form a partition
• A new algebraic structure for formal concept analysis
• Covering based rough set approximations
• Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system
• On axiomatic characterizations of three pairs of covering based approximation operators
• Topological approaches to covering rough sets
• The algebraic structures of generalized rough set theory
• Relationship between generalized rough sets based on binary relation and covering
• Constructive and algebraic methods of the theory of rough sets
• Reduction and axiomization of covering generalized rough sets.
• Relational interpretations of neighborhood operators and rough set approximation operators
• Quantitative analysis for covering-based rough sets through the upper approximation number
• Matroids and the greedy algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item