StruClus: Structural Clustering of Large-Scale Graph Databases
This addresses the problem of efficiently clustering large graph datasets for researchers and practitioners, offering a scalable solution with interpretable outputs, though it appears incremental as it builds on structural clustering ideas.
They tackled clustering large-scale graph databases by developing a structural clustering algorithm that uses frequent subgraph sampling and representatives, achieving high-quality, interpretable results with linear runtime growth and easy parallelization, as shown in experiments outperforming existing methods in runtime and quality.
We present a structural clustering algorithm for large-scale datasets of small labeled graphs, utilizing a frequent subgraph sampling strategy. A set of representatives provides an intuitive description of each cluster, supports the clustering process, and helps to interpret the clustering results. The projection-based nature of the clustering approach allows us to bypass dimensionality and feature extraction problems that arise in the context of graph datasets reduced to pairwise distances or feature vectors. While achieving high quality and (human) interpretable clusterings, the runtime of the algorithm only grows linearly with the number of graphs. Furthermore, the approach is easy to parallelize and therefore suitable for very large datasets. Our extensive experimental evaluation on synthetic and real world datasets demonstrates the superiority of our approach over existing structural and subspace clustering algorithms, both, from a runtime and quality point of view.