4 papers
Ensemble Clustering for Graphs: Comparisons and Applications
Valérie Poulin, François Théberge
We recently proposed a new ensemble clustering algorithm for graphs (ECG) based on the concept of consensus clustering. We validated our approach by replicating a study comparing g…
Clustering via Hypergraph Modularity
Bogumil Kaminski, Valerie Poulin, Pawel Pralat +2
Despite the fact that many important problems (including clustering) can be described using hypergraphs, theoretical foundations as well as practical algorithms using hypergraphs a…
Ensemble Clustering for Graphs
Valérie Poulin, François Théberge
We propose an ensemble clustering algorithm for graphs (ECG), which is based on the Louvain algorithm and the concept of consensus clustering. We validate our approach by replicati…
Comparing Graph Clusterings: Set partition measures vs. Graph-aware measures
Valérie Poulin, François Théberge
In this paper, we propose a family of graph partition similarity measures that take the topology of the graph into account. These graph-aware measures are alternatives to using set…