19 citations · 43 across the 34 of their papers we have counts for
16 papers · 1 filter
Modularity Based Community Detection in Hypergraphs
Bogumił Kamiński, Paweł Misiorek, Paweł Prałat +1
In this paper, we propose a scalable community detection algorithm using hypergraph modularity function, h-Louvain. It is an adaptation of the classical Louvain algorithm in the co…
Self-similarity of Communities of the ABCD Model
Jordan Barrett, Bogumil Kaminski, Pawel Pralat +1
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…
Predicting Properties of Nodes via Community-Aware Features
Bogumił Kamiński, Paweł Prałat, François Théberge +1
This paper shows how information about the network's community structure can be used to define node features with high predictive power for classification tasks. To do so, we defin…
Artificial Benchmark for Community Detection with Outliers (ABCD+o)
Bogumił Kamiński, Paweł Prałat, François Théberge
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…
Hypergraph Artificial Benchmark for Community Detection (h-ABCD)
Bogumił Kamiński, Paweł Prałat, François Théberge
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 c…
Modularity of the ABCD Random Graph Model with Community Structure
Bogumil Kaminski, Bartosz Pankratz, Pawel Pralat +1
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…