Community Extraction in Hypergraphs Based on Adjacent Numbers

被引：0
|
作者：
Miyagawa, Hiroyuki [1 ]
Shigeno, Maiko [1 ]
Takahashi, Satoshi [1 ]
Zhang, Mingchao [1 ]
机构：
[1] Univ Tsukuba, Grad Sch Syst & Informat Engn, Tsukuba, Ibaraki 3058573, Japan
来源：
OPERATIONS RESEARCH AND ITS APPLICATIONS | 2010年 / 12卷
关键词：
Community; Hypergraph; Minimum cut algorithm;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Community extraction plays an important role in network analysis. This paper discusses communities in hypergraphs. Since hypergraphs can represent multi-relational networks, they are important structures in many domains. In this study, the definition of communities based on the number of adjacent links/nodes is extended to a hypergraph. Four extended models are proposed. The adequacy of these models for hypergraph communities is investigated by using a hypergraph obtained from joint work relationships.
引用
收藏
页码：309 / 316
页数：8
相关论文
共 50 条
  • [1] Modularity based community detection in hypergraphs
    Kaminski, Bogumil
    Misiorek, Pawel
    Pralat, Pawel
    Theberge, Francois
    JOURNAL OF COMPLEX NETWORKS, 2024, 12 (05)
  • [2] Betti Numbers of Hypergraphs
    Emtander, Eric
    COMMUNICATIONS IN ALGEBRA, 2009, 37 (05) : 1545 - 1571
  • [3] On the hypercompetition numbers of hypergraphs
    Park, Boram
    Sano, Yoshio
    ARS COMBINATORIA, 2011, 100 : 151 - 159
  • [4] Modularity Based Community Detection in Hypergraphs
    Kaminski, Bogumil
    Misiorek, Pawel
    Pralat, Pawel
    Theberge, Francois
    ALGORITHMS AND MODELS FOR THE WEB GRAPH, WAW 2023, 2023, 13894 : 52 - 67
  • [5] Modularity Based Community Detection in Hypergraphs
    Kamiński, Bogumil
    Misiorek, Pawel
    Pralat, Pawel
    Théberge, François
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2023, 13894 LNCS : 52 - 67
  • [6] The chromatic numbers of random hypergraphs
    Krivelevich, M
    Sudakov, B
    RANDOM STRUCTURES & ALGORITHMS, 1998, 12 (04) : 381 - 403
  • [7] Chromatic numbers of algebraic hypergraphs
    James H. Schmerl
    Combinatorica, 2017, 37 : 1011 - 1026
  • [8] On Turan numbers for disconnected hypergraphs
    Mulas, R.
    Nie, J.
    ACTA MATHEMATICA HUNGARICA, 2023, 170 (01) : 168 - 182
  • [9] Ramsey Numbers of Sparse Hypergraphs
    Conlon, David
    Fox, Jacob
    Sudakov, Benny
    RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (01) : 1 - 14
  • [10] TRANSVERSAL NUMBERS OF UNIFORM HYPERGRAPHS
    ALON, N
    GRAPHS AND COMBINATORICS, 1990, 6 (01) : 1 - 4
12345