output
20042025
most citedClustering via Hypergraph Modularity

83 citations

Showing cs.SIShow all

5 papers · 1 filter

cs.SI2025★ 1 cited

Improving community detection via community association strength scores

Jordan Barrett, Ryan DeWolfe, Bogumił Kamiński +3

Community detection methods play a central role in understanding complex networks by revealing highly connected subsets of entities. However, most community detection algorithms ge…

cs.SI2023★ 19 cited

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…

cs.SI2020★ 8 cited

Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl

Alessia Antelmi, Gennaro Cordasco, Bogumił Kamiński +4

Real-world complex networks are usually being modeled as graphs. The concept of graphs assumes that the relations within the network are binary (for instance, between pairs of node…

cs.SI2020★ 47 cited

Artificial Benchmark for Community Detection (ABCD): Fast Random Graph Model with Community Structure

Bogumił Kamiński, Paweł Prałat, François Théberge

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 the…

cs.SI2019★ 16 cited

An Unsupervised Framework for Comparing Graph Embeddings

Bogumil Kaminski, Pawel Pralat, Francois Theberge

Graph embedding is a transformation of vertices of a graph into set of vectors. Good embeddings should capture the graph topology, vertex-to-vertex relationship, and other relevant…