Clustering tool optimized for sparse distance matrices: ~16M elements with ~190M connections clustered in minutes.
-
Updated
Sep 12, 2026 - C++
Clustering tool optimized for sparse distance matrices: ~16M elements with ~190M connections clustered in minutes.
implementation of agglomerative single linkage clustering with minimum spanning tree algorithm
楕円で大まかに指定した範囲から、画像の前景のアルファマットを求めるPythonのライブラリ。論文、評価のコード、評価の結果も収録しています。
Robust Single-Linkage Clustering
Agglomerative hierarchical clustering over a sparse similarity matrix. Memory is O(nnz) instead of O(n^2), so it clusters 10^5-10^6 objects where scipy's dense linkage needs ~320 GB. C++17 core, no dependencies; Python binding, C API, scipy-compatible export.
University Course Assignment - Pattern Recognition
HELP International is an international humanitarian NGO that is committed to fighting poverty and providing the people of backward countries with basic amenities and relief during the time of disasters and natural calamities. It runs a lot of operational projects from time to time along with advocacy drives to raise awareness as well as for fund…
To associate your repository with the single-linkage topic, visit your repo's landing page and select "manage topics."