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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning to Collaborate Over Graphs: A Selective Federated Multi-Task Learning Approach
Breaking the Batch Barrier (B3) of Contrastive Learning via Smart Batch Mining
Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion
Community and hyperedge inference in multiple hypergraphs
Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation
Robust Markov stability for community detection at a scale learned based on the structure
토론
이 논문과 연결된 포럼 글이 아직 없습니다.