Fast, Linear Time Hierarchical Clustering using the Baire Metric

Details Fast, Linear Time Hierarchical Clustering using the Baire Metric Fast, Linear Time Hierarchical Clustering using the Baire Metric

2011-06-11

arxiv.org/abs/1106.2229v1

Statistics

Machine Learning

27 pages, 6 tables, 10 figures

Scientific paper

The Baire metric induces an ultrametric on a dataset and is of linear computational complexity, contrasted with the standard quadratic time agglomerative hierarchical clustering algorithm. In this work we evaluate empirically this new approach to hierarchical clustering. We compare hierarchical clustering based on the Baire metric with (i) agglomerative hierarchical clustering, in terms of algorithm properties; (ii) generalized ultrametrics, in terms of definition; and (iii) fast clustering through k-means partititioning, in terms of quality of results. For the latter, we carry out an in depth astronomical study. We apply the Baire distance to spectrometric and photometric redshifts from the Sloan Digital Sky Survey using, in this work, about half a million astronomical objects. We want to know how well the (more costly to determine) spectrometric redshifts can predict the (more easily obtained) photometric redshifts, i.e. we seek to regress the spectrometric on the photometric redshifts, and we use clusterwise regression for this.

Affiliated with

Also associated with

No associations

Rating

Fast, Linear Time Hierarchical Clustering using the Baire Metric does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast, Linear Time Hierarchical Clustering using the Baire Metric, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast, Linear Time Hierarchical Clustering using the Baire Metric will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414247