no code implementations • NeurIPS 2014 • Assaf Glazer, Omer Weissbrod, Michael Lindenbaum, Shaul Markovitch
The goal of hierarchical clustering is to construct a cluster tree, which can be viewed as the modal structure of a density.
no code implementations • NeurIPS 2013 • Assaf Glazer, Michael Lindenbaum, Shaul Markovitch
In this paper we introduce a novel method that can efficiently estimate a family of hierarchical dense sets in high-dimensional distributions.
no code implementations • NeurIPS 2012 • Assaf Glazer, Michael Lindenbaum, Shaul Markovitch
We propose an efficient, generalized, nonparametric, statistical Kolmogorov-Smirnov test for detecting distributional change in high-dimensional data.