5 papers
Generating Synthetic Citation Networks with Communities
Åukasz Brzozowski, Marek Gagolewski, Grzegorz Siudem
Generating realistic synthetic citation, patent, or component dependency networks is essential for benchmarking community detection, graph visualisation, and network data mining al…
The Price-Pareto growth model of networks with community structure
Åukasz Brzozowski, Marek Gagolewski, Grzegorz Siudem +1
We introduce a new analytical framework for modelling degree sequences in individual communities of real-world networks, e.g., citations to papers in different fields. Our work is…
Lumbermark: Resistant Clustering by Chopping Up Mutual Reachability Minimum Spanning Trees
Marek Gagolewski
We introduce Lumbermark, a robust divisive clustering algorithm capable of detecting clusters of varying sizes, densities, and shapes. Lumbermark iteratively chops off large limbs…
Clustering with minimum spanning trees: How good can it be?
Marek Gagolewski, Anna Cena, Maciej Bartoszuk +1
Minimum spanning trees (MSTs) provide a convenient representation of datasets in numerous pattern recognition activities. Moreover, they are relatively fast to compute. In this pap…
Normalised clustering accuracy: An asymmetric external cluster validity measure
Marek Gagolewski
There is no, nor will there ever be, single best clustering algorithm. Nevertheless, we would still like to be able to distinguish between methods that work well on certain task ty…