Parallel Index-Based Structural Graph Clustering and Its Approximation
Tom Tseng, Laxman Dhulipala, Julian Shun
Abstract
SCAN (Structural Clustering Algorithm for Networks) is a well-studied, widely used graph clustering algorithm. For large graphs, however, sequential SCAN variants are prohibitively slow, and parallel SCAN variants do not effectively share work among queries with different SCAN parameter settings. Since users of SCAN often explore many parameter settings to find good clusterings, it is worthwhile to precompute an index that speeds up queries.
Topics & Concepts
Cluster analysisComputer scienceIndex (typography)GraphClustering coefficientTheoretical computer scienceArtificial intelligenceWorld Wide WebComplex Network Analysis TechniquesAdvanced Graph Neural NetworksGraph Theory and Algorithms