Bipartite graphs and coverings

Authors:
Shiping Wang;William Zhu;Fan Min
Affiliations:
School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, China;Lab of Granular Computing, Zhangzhou Normal University, Zhangzhou, China;Lab of Granular Computing, Zhangzhou Normal University, Zhangzhou, China
Venue:
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Year:
2011

Citing 14
Cited 0

Reduction and axiomization of covering generalized rough sets

Information Sciences: an International Journal
Consistency-based search in feature selection

Artificial Intelligence
On the coverings by tolerance classes

Information Sciences—Informatics and Computer Science: An International Journal
Topological approaches to covering rough sets

Information Sciences: an International Journal
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
A novel approach to fuzzy rough sets based on a fuzzy covering

Information Sciences: an International Journal
A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets

Information Sciences: an International Journal
On Three Types of Covering-Based Rough Sets

IEEE Transactions on Knowledge and Data Engineering
Approximations and reducts with covering generalized rough sets

Computers & Mathematics with Applications
Relationship between generalized rough sets based on binary relation and covering

Information Sciences: an International Journal
A comparison of two types of rough sets induced by coverings

International Journal of Approximate Reasoning
Approaches to knowledge reduction of covering decision systems based on information theory

Information Sciences: an International Journal
Relationship among basic concepts in covering-based rough sets

Information Sciences: an International Journal
Test-cost-sensitive attribute reduction

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many real world applications, data are organized by coverings, instead of partitions. Covering-based rough sets have been proposed to cope with this type of data. Covering-based rough set theory is more general than rough set theory, then there is a need to employ sophisticated theories to make it more adaptive to applications. Covering is one of core concepts in covering-based rough sets, and it is urgent to connect coverings with other data models. This paper establishes the relationship between coverings and bipartite graphs. Through its index set, a covering induces some isomorphic bipartite graphs. Conversely, a bipartite graph induces a covering of the set of vertices. These inductions are converse with each other.