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

Bogumił Kamiński, Paweł Prałat, François Théberge
1/13/2023
cs.SIcs.LGmath.CO

No confident code implementation found for this paper.

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 $ξ$ can be tuned to mimic its counterpart in the LFR model, the mixing parameter $μ$. 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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kamiski2023artificial,
  title  = {Artificial Benchmark for Community Detection with Outliers (ABCD+o)},
  author = {Bogumił Kamiński and Paweł Prałat and François Théberge},
  year   = {2023},
  eprint = {2301.05749},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.05749v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.05749.svg)](https://codeofpaper.com/paper/2301.05749)

Discussion