From trees to continuous embeddings and back: Hyperbolic hierarchical clustering
Abstract Similarity-based Hierarchical Clustering (HC) is a classical unsupervised machine
learning algorithm that has traditionally been solved with heuristic algorithms like Average …
learning algorithm that has traditionally been solved with heuristic algorithms like Average …
Approximation bounds for hierarchical clustering: Average linkage, bisecting k-means, and local search
Hierarchical clustering is a data analysis method that has been used for decades. Despite its
widespread use, the method has an underdeveloped analytical foundation. Having a well …
widespread use, the method has an underdeveloped analytical foundation. Having a well …
Gradient-based hierarchical clustering using continuous representations of trees in hyperbolic space
Hierarchical clustering is typically performed using algorithmic-based optimization searching
over the discrete space of trees. While these optimization methods are often effective, their …
over the discrete space of trees. While these optimization methods are often effective, their …
Topological clustering of multilayer networks
Multilayer networks continue to gain significant attention in many areas of study, particularly
due to their high utility in modeling interdependent systems such as critical infrastructures …
due to their high utility in modeling interdependent systems such as critical infrastructures …
Sublinear algorithms for hierarchical clustering
Hierarchical clustering over graphs is a fundamental task in data mining and machine
learning with applications in many domains including phylogenetics, social network …
learning with applications in many domains including phylogenetics, social network …
Subquadratic high-dimensional hierarchical clustering
A Abboud, V Cohen-Addad… - Advances in Neural …, 2019 - proceedings.neurips.cc
We consider the widely-used average-linkage, single-linkage, and Ward's methods for
computing hierarchical clusterings of high-dimensional Euclidean inputs. It is easy to show …
computing hierarchical clusterings of high-dimensional Euclidean inputs. It is easy to show …
Objective-based hierarchical clustering of deep embedding vectors
S Naumov, G Yaroslavtsev, D Avdiukhin - Proceedings of the AAAI …, 2021 - ojs.aaai.org
We initiate a comprehensive experimental study of objective-based hierarchical clustering
methods on massive datasets consisting of deep embedding vectors from computer vision …
methods on massive datasets consisting of deep embedding vectors from computer vision …
Hierarchical clustering: A 0.585 revenue approximation
Hierarchical Clustering trees have been widely accepted as a useful form of clustering data,
resulting in a prevalence of adopting fields including phylogenetics, image analysis …
resulting in a prevalence of adopting fields including phylogenetics, image analysis …
Hierarchical Clustering: -Approximation for Well-Clustered Graphs
BA Manghiuc, H Sun - advances in neural information …, 2021 - proceedings.neurips.cc
Hierarchical clustering studies a recursive partition of a data set into clusters of successively
smaller size, and is a fundamental problem in data analysis. In this work we study the cost …
smaller size, and is a fundamental problem in data analysis. In this work we study the cost …
Hierarchical clustering of data streams: Scalable algorithms and approximation guarantees
A Rajagopalan, F Vitale, D Vainstein… - International …, 2021 - proceedings.mlr.press
We investigate the problem of hierarchically clustering data streams containing metric data
in R^ d. We introduce a desirable invariance property for such algorithms, describe a …
in R^ d. We introduce a desirable invariance property for such algorithms, describe a …