Timezone: »

 
Poster
Approximating Hierarchical MV-sets for Hierarchical Clustering
Assaf Glazer · Omer Weissbrod · Michael Lindenbaum · Shaul Markovitch

Thu Dec 11 11:00 AM -- 03:00 PM (PST) @ Level 2, room 210D #None

The goal of hierarchical clustering is to construct a cluster tree, which can be viewed as the modal structure of a density. For this purpose, we use a convex optimization program that can efficiently estimate a family of hierarchical dense sets in high-dimensional distributions. We further extend existing graph-based methods to approximate the cluster tree of a distribution. By avoiding direct density estimation, our method is able to handle high-dimensional data more efficiently than existing density-based approaches. We present empirical results that demonstrate the superiority of our method over existing ones.

Author Information

Assaf Glazer (Technion)
Omer Weissbrod (Technion)
Michael Lindenbaum (Technion)
Shaul Markovitch (Technion)

More from the Same Authors