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 条
  • [31] A generalized definition of rough approximation based on similarity in variable precision rough sets
    Zhao, SX
    Zhang, ZR
    PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, : 3153 - 3156
  • [32] Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs
    Bhadra, Sandeep
    Ferreira, Afonso
    JOURNAL OF INTERNET SERVICES AND APPLICATIONS, 2012, 3 : 369 - 375
  • [33] The lattice and matroid representations of definable sets in generalized rough sets based on relations
    Wang, Zhaohao
    Feng, Qinrong
    Wang, Hong
    INFORMATION SCIENCES, 2019, 485 : 505 - 520
  • [34] Granular Computing with Compatibility Based Intuitionistic Fuzzy Rough Sets
    Bandyopadhyay, Sibasis
    Yao, JingTao
    Zhang, Yan
    2017 16TH IEEE INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA), 2017, : 378 - 383
  • [35] Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
    Chakraborty, Maumita
    Chowdhury, Sumon
    Pal, Rajat K.
    IEEE ACCESS, 2018, 6 : 56290 - 56300
  • [36] Axiomatization on generalized neighborhood system-based rough sets
    Zhao, Fangfang
    Li, Lingqiang
    SOFT COMPUTING, 2018, 22 (18) : 6099 - 6110
  • [37] Matroidal Structure of Generalized Rough Sets Based on Tolerance Relations
    Li, Hui
    Liu, Yanfang
    Zhu, William
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [38] Topological Structure of Relation-based Generalized Rough Sets
    Zhang, Yan-Lan
    Li, Jinjin
    Li, Changqing
    FUNDAMENTA INFORMATICAE, 2016, 147 (04) : 477 - 491
  • [39] Axiomatization on generalized neighborhood system-based rough sets
    Fangfang Zhao
    Lingqiang Li
    Soft Computing, 2018, 22 : 6099 - 6110
  • [40] Note on "Generalized rough sets based on reflexive and transitive relations"
    Zhang, Hua-Peng
    Ouyang, Yao
    Wang, Zhudeng
    INFORMATION SCIENCES, 2009, 179 (04) : 471 - 473
12345