March 4, 2024, 5:43 a.m. | Annie Gray, Alexander Modell, Patrick Rubin-Delanchy, Nick Whiteley

cs.LG updates on arXiv.org arxiv.org

arXiv:2305.15022v3 Announce Type: replace-cross
Abstract: In this paper we offer a new perspective on the well established agglomerative clustering algorithm, focusing on recovery of hierarchical structure. We recommend a simple variant of the standard algorithm, in which clusters are merged by maximum average dot product and not, for example, by minimum distance or within-cluster variance. We demonstrate that the tree output by this algorithm provides a bona fide estimate of generative hierarchical structure in data, under a generic probabilistic graphical …

abstract algorithm arxiv clustering clustering algorithm cs.lg example hidden hierarchical paper perspective product products recovery simple standard stat.ml tree type

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Alternance DATA/AI Engineer (H/F)

@ SQLI | Le Grand-Quevilly, France