Fast redshift clustering with the Baire (ultra) metric

04/20/2011
by   Fionn Murtagh, et al.
0

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. 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 cos tly 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 develop a clusterwise nearest neighbor regression procedure for this.

READ FULL TEXT
research
06/11/2011

Fast, Linear Time Hierarchical Clustering using the Baire Metric

The Baire metric induces an ultrametric on a dataset and is of linear co...
research
03/15/2022

Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity

We propose a nearest neighbor based clustering algorithm that results in...
research
02/08/2022

Systematically improving existing k-means initialization algorithms at nearly no cost, by pairwise-nearest-neighbor smoothing

We present a meta-method for initializing (seeding) the k-means clusteri...
research
06/05/2018

Hierarchical Graph Clustering using Node Pair Sampling

We present a novel hierarchical graph clustering algorithm inspired by m...
research
06/14/2010

Penalized K-Nearest-Neighbor-Graph Based Metrics for Clustering

A difficult problem in clustering is how to handle data with a manifold ...
research
12/20/2017

Fast kNN mode seeking clustering applied to active learning

A significantly faster algorithm is presented for the original kNN mode ...
research
12/20/2021

The Cascading Metric Tree

This paper presents the Cascaded Metric Tree (CMT) for efficient satisfa...

Please sign up or login with your details

Forgot password? Click here to reset