Artificial Benchmark for Community Detection with Outliers (ABCD+o)

Abstract

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 properties as the well-known LFR one, and its main parameter $\xi$ can be tuned to mimic its counterpart in the LFR model, the mixing parameter $\mu$. In this paper, we extend the ABCD model to include potential outliers. We perform some exploratory experiments on both the new ABCD+o model as well as a real-world network to show that outliers possess some desired, distinguishable properties.

arXiv comment19 pages, 13 figures

References in corpus (10)

• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Community detection in graphs
• Benchmark graphs for testing community detection algorithms
• Defining and identifying communities in networks
• Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities
• Finding overlapping communities in networks by label propagation
• Comparative evaluation of community-aware centrality measures
• Ensemble Clustering for Graphs
• An Unsupervised Framework for Comparing Graph Embeddings

Cited by in corpus (1)

• Improving community detection via community association strength scores