arXiv (All)
open access
Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
Single-linkage clustering (SLC) is a fundamental method for hierarchical data analysis. In the distance setting, a $k$-clustering produced by SLC can be obtained by computing a minimum spanning tree (MST) and deleting its $k-1$ heaviest edges. This naturally induces a cost profile for the SLC hierar
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- RECOB: Reliable Benchmarking of Experimental Optimization in Chemistry and Materials Science#1034865
- Flint: Compiler Enabled Cluster-Free Design Space Exploration for Distributed ML#120476
- Predictive models for computing clusters: a case study based on Ilifu#416039
- Supplemental Data for "Accounting for Mismatch Error in Small Area Estimation with Linked Data"#1042201
- LYRA: The formation and growth of nuclear star clusters in dwarf galaxies#1142474
Record · ID 987485
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive