AI Chat AI Image Generator AI Video Text to Speech

Agglomerative Bregman Clustering

06/27/2012

∙

by Matus Telgarsky, et al.

∙

∙

This manuscript develops the theory of agglomerative clustering with Bregman divergences. Geometric smoothing techniques are developed to deal with degenerate clusters. To allow for cluster models based on exponential families with overcomplete representations, Bregman divergences are developed for nondifferentiable convex functions.

Matus Telgarsky
32 publications
Sanjoy Dasgupta
28 publications

page 1

page 2

page 3

page 4

research

∙ 05/18/2021

On Convex Clustering Solutions

Convex clustering is an attractive clustering algorithm with favorable p...

0 Canh Hao Nguyen, et al. ∙

research

∙ 11/04/2022

Clustering above Exponential Families with Tempered Exponential Measures

The link with exponential families has allowed k-means clustering to be ...

0 Ehsan Amid, et al. ∙

research

∙ 12/26/2019

Parameter Free Clustering with Cluster Catch Digraphs (Technical Report)

We propose clustering algorithms based on a recently developed geometric...

0 Artür Manukyan, et al. ∙

research

∙ 01/18/2016

Sparse Convex Clustering

Convex clustering, a convex relaxation of k-means clustering and hierarc...

0 Binhuan Wang, et al. ∙

research

∙ 07/21/2016

Admissible Hierarchical Clustering Methods and Algorithms for Asymmetric Networks

This paper characterizes hierarchical clustering methods that abide by t...

0 Gunnar Carlsson, et al. ∙

research

∙ 06/27/2019

Clustering by the way of atomic fission

Cluster analysis which focuses on the grouping and categorization of sim...

0 Shizhan Lu, et al. ∙

research

∙ 02/28/2018

Clustering of Naturalistic Driving Encounters Using Unsupervised Learning

Deep understanding of driving encounters could help self-driving cars ma...

0 Sisi Li, et al. ∙