Computing connected components of simple undirected graphs based on generalized rough sets

被引：10
|
作者：
Chen, Jinkun [1 ]
Li, Jinjin [1 ]
Lin, Yaojin [2 ]
机构：
[1] Zhangzhou Normal Univ, Dept Math & Informat Sci, Zhangzhou 363000, Peoples R China
[2] Zhangzhou Normal Univ, Dept Comp Sci & Engn, Zhangzhou 363000, Peoples R China
来源：
KNOWLEDGE-BASED SYSTEMS | 2013年 / 37卷
基金：
中国国家自然科学基金;
关键词：
Rough set; k-Step-upper approximation; Definable set; Connection; Connected component; EFFICIENT PARALLEL ALGORITHMS; KNOWLEDGE ACQUISITION; ATTRIBUTE REDUCTION; INFORMATION-SYSTEMS; APPROXIMATION;
D O I：
10.1016/j.knosys.2012.07.013
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper studies the problem of computing connected components of a simple undirected graph based on generalized rough sets. Definable sets of generalized rough sets are used to characterize the connection of graphs. Based on the concept of k-step-upper approximations, an algorithm is designed for computing the connected components of a simple undirected graph. Experiments show that the new proposed algorithm gets a better performance compared to the classical algorithm. Also, this algorithm can be easily to realize in parallel and requires less processors. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：80 / 85
页数：6
相关论文
共 50 条
  • [41] An approach to covering-based rough sets through bipartite graphs
    Wang, Jingqian
    Zhu, William
    2014 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ-IEEE), 2014, : 1213 - 1218
  • [42] COMPUTING THE CONNECTED COMPONENTS OF SIMPLE RECTILINEAR GEOMETRICAL OBJECTS IN D-SPACE
    EDELSBRUNNER, H
    VANLEEUWEN, J
    OTTMANN, T
    WOOD, D
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1984, 18 (02): : 171 - 183
  • [43] Research on Rough Sets based Service Matchmaking Algorithma for Pervasive Computing
    Huang, Runcai
    Zhuang, Yiwen
    Cao, Qiying
    Huang, Runcai
    ISISE 2008: INTERNATIONAL SYMPOSIUM ON INFORMATION SCIENCE AND ENGINEERING, VOL 1, 2008, : 43 - +
  • [44] Parallel computing of approximations in dominance-based rough sets approach
    Li, Shaoyong
    Li, Tianrui
    Zhang, Zhixue
    Chen, Hongmei
    Zhang, Junbo
    KNOWLEDGE-BASED SYSTEMS, 2015, 87 : 102 - 111
  • [45] Adaptive discretizer for machine learning based on granular computing and rough sets
    Wu, QX
    Wang, P
    Huang, X
    Yan, S
    2005 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, VOLS 1 AND 2, 2005, : 292 - 295
  • [46] Centrality-Based Connected Dominating Sets for Complex Network Graphs
    Meghanathan, Natarajan
    INTERNATIONAL JOURNAL OF INTERDISCIPLINARY TELECOMMUNICATIONS AND NETWORKING, 2014, 6 (02) : 1 - 24
  • [47] Finite almost simple groups with prime graphs all of whose connected components are cliques
    M. R. Zinov’eva
    A. S. Kondrat’ev
    Proceedings of the Steklov Institute of Mathematics, 2016, 295 : 178 - 188
  • [48] Finite almost simple groups with prime graphs all of whose connected components are cliques
    Zinov'eva, M. R.
    Kondrat'ev, A. S.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2015, 21 (03): : 132 - 141
  • [49] Finite Almost Simple Groups with Prime Graphs All of Whose Connected Components Are Cliques
    Zinov'eva, M. R.
    Kondrat'ev, A. S.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2016, 295 (01) : S178 - S188
  • [50] Generalized intuitionistic fuzzy rough sets based on intuitionistic fuzzy coverings
    Zhang, Zhiming
    INFORMATION SCIENCES, 2012, 198 : 186 - 206
12345