Hypergraph Artificial Benchmark for Community Detection (h-ABCD)
The Artificial Benchmark for Community Detection (ABCD) graph is a recently introduced random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar properties as the well-known LFR one, and its main parameter can be tuned to mimic its counterpart in the LFR model, the mixing parameter. In this paper, we introduce hypergraph counterpart of the ABCD model, h-ABCD, which produces random hypergraph with distributions of ground-truth community sizes and degrees following power-law. As in the original ABCD, the new model h-ABCD can produce hypergraphs with various levels of noise. More importantly, the model is flexible and can mimic any desired level of homogeneity of hyperedges that fall into one community. As a result, it can be used as a suitable, synthetic playground for analyzing and tuning hypergraph community detection algorithms.
Code (1)
Tasks
Community DetectionSimilar Papers 제목 키워드 기반
Artificial Benchmark for Community Detection with Outliers (ABCD+o)
The Artificial Benchmark for Community Detection graph (ABCD) is a random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar prop…
Community DetectionMultilayer Artificial Benchmark for Community Detection (mABCD)
One of the most persistent challenges in network science is the development of various synthetic graph models to support subsequent analyses. Among the most notable frameworks addressing this issue is the Artificial Benc…
Community DetectionModularity of the ABCD Random Graph Model with Community Structure
The Artificial Benchmark for Community Detection (ABCD) graph is a random graph model with community structure and power-law distribution for both degrees and community sizes. The model generates graphs with similar prop…
Community DetectionProperties and Performance of the ABCDe Random Graph Model with Community Structure
In this paper, we investigate properties and performance of synthetic random graph models with a built-in community structure. Such models are important for evaluating and tuning community detection algorithms that are u…
Community DetectionArtificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structure
Most of the current complex networks that are of interest to practitioners possess a certain community structure that plays an important role in understanding the properties of these networks. Moreover, many machine lear…
Community Detection