Large-Scale Euclidean MST and Hierarchical Clustering

author: William March, Georgia Institute of Technology
published: Dec. 29, 2007,   recorded: December 2007,   views: 386
Categories

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

We present new fast algorithms for performing the single-linkage hierarchical clustering method, a classical data mining method used heavily in bioinformatics and astronomy, given similarities which are metrics. We present experimental results that demonstrate significant speedup over previous algorithms on both synthetic and real data, including a dataset of 3 million astronomical observations and a dataset of protein folding trajectories. Additionally, our algorithms use considerably less storage than previous methods. More generally, our algorithm appears to be the fastest practical solution to the well-known Euclidean Minimum Spanning Tree problem.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: