2013/12/16 by Aiping Huang, Huang, Aiping, William Zhu +1
Computer Science · #Artificial Intelligence (cs.AI) #Data Mining Algorithms and Applications #FOS: Computer and information sciences #Rough Sets and Fuzzy Logic #cs.AI
paper · pdf · doi:10.48550/arxiv.1312.4234
openalex publication_date 2013/12/16 · arxiv created 2015/03/04 · arxiv updated 2015/03/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and covering-based rough sets provide a systematic approach to this type of representation. In this paper, we study the connectedness of graphs through covering-based rough sets and apply it to connected matroids. First, we present an approach to inducing a covering by a graph, and then study the connectedness of the graph from the viewpoint of the covering approximation operators. Second, we construct a graph from a matroid, and find the matroid and the graph have the same connectedness, which makes us to use covering-based rough sets to study connected matroids. In summary, this paper provides a new approach to studying graph theory and matroid theory.