Efficient hierarchical clustering for continuous data

Details Efficient hierarchical clustering for continuous data Efficient hierarchical clustering for continuous data

2012-04-20

arxiv.org/abs/1204.4708v1

Statistics

Machine Learning

17 pages, 3 figures, 4 tables

Scientific paper

We present an new sequential Monte Carlo sampler for coalescent based Bayesian hierarchical clustering. Our model is appropriate for modeling non-i.i.d. data and offers a substantial reduction of computational cost when compared to the original sampler without resorting to approximations. We also propose a quadratic complexity approximation that in practice shows almost no loss in performance compared to its counterpart. We show that as a byproduct of our formulation, we obtain a greedy algorithm that exhibits performance improvement over other greedy algorithms, particularly in small data sets. In order to exploit the correlation structure of the data, we describe how to incorporate Gaussian process priors in the model as a flexible way to model non-i.i.d. data. Results on artificial and real data show significant improvements over closely related approaches.

Affiliated with

Also associated with

No associations

Rating

Efficient hierarchical clustering for continuous data 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 Efficient hierarchical clustering for continuous data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient hierarchical clustering for continuous data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-6253