GSHAC performs exact HAC on large geographic point sets by building a sparse geodesic graph and proving that connected-component subproblems yield identical results to the dense algorithm for all standard linkages at cut heights below the sparsity threshold.
Mostofa Ali Patwary, Ankit Agrawal, Wei- keng Liao, and Alok Choudhary
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
GSHAC performs exact HAC on large geographic point sets by building a sparse geodesic graph and proving that connected-component subproblems yield identical results to the dense algorithm for all standard linkages at cut heights below the sparsity threshold.