Efficient Truss Computation for Large Hypergraphs

Xinzhou Wang, Yinjia Chen, Zhiwei Zhang*, Peng Peng Qiao, Guoren Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Cohesive subgraph mining has been applied in many areas, including social networks, cooperation networks, and biological networks. The k-truss of a graph is the maximal subgraph in which each edge is contained in at least k triangles. Existing k-truss models are defined solely in pairwise graphs and are hence unsuitable for hypergraphs. In this paper, we propose a novel problem, named (k, α, β) -truss computation in hypergraphs. We then propose two hypergraph conversions. The first converts a hypergraph into a pairwise graph, while the second converts it into a projected graph. We further propose two algorithms for computing (k, α, β) -truss in hypergraphs based on these two types of conversions. Experiments show that our (k, α, β) -truss model is effective and our algorithms are efficient in large hypergraphs.

Original languageEnglish
Title of host publicationWeb Information Systems Engineering – WISE 2022 - 23rd International Conference, Proceedings
EditorsRichard Chbeir, Helen Huang, Fabrizio Silvestri, Yannis Manolopoulos, Yanchun Zhang, Yanchun Zhang
PublisherSpringer Science and Business Media Deutschland GmbH
Pages290-305
Number of pages16
ISBN (Print)9783031208904
DOIs
Publication statusPublished - 2022
Event23rd International Conference on Web Information Systems Engineering, WISE 2021 - Biarritz, France
Duration: 1 Nov 20223 Nov 2022

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13724 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Conference on Web Information Systems Engineering, WISE 2021
Country/TerritoryFrance
CityBiarritz
Period1/11/223/11/22

Keywords

  • Cohesive subgraph
  • Hypergraph
  • Truss computation

Fingerprint

Dive into the research topics of 'Efficient Truss Computation for Large Hypergraphs'. Together they form a unique fingerprint.

Cite this