arXiv (All)
open access
Applicability and Interpretability of Hierarchical Agglomerative Clustering With or Without Contiguity Constraints
Hierarchical Agglomerative Classification (HAC) with Ward's linkage has been widely used since its introduction in Ward (1963). The present article reviews the different extensions of the method to various input data and the constrained framework, while providing applicability conditions. In additio
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
- VLM4Cluster: Benchmarking Deep Clustering In the Era of Vision-Language Pre-training#1131849
- Cohort organized learning: clustering through agreement#495703
- Evaluating the trustworthiness of the Fréchet Inception Distance with stochastic embedding representations#617946
- Evaluating the trustworthiness of the Fréchet Inception Distance with stochastic embedding representations#617446
- HiMaLAYAS: enrichment-based annotation of hierarchically clustered matrices#147956
Record · ID 925682
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