0


大规模欧氏MST与分层聚类

Large-Scale Euclidean MST and Hierarchical Clustering
课程网址: http://videolectures.net/eml07_march_lse/  
主讲教师: William March
开课单位: 佐治亚理工学院
开课时间: 2007-12-29
课程语种: 英语
中文简介:
我们提出了用于执行单链接层次聚类方法的新快速算法,这是一种在生物信息学和天文学中大量使用的经典数据挖掘方法,给出了作为度量的相似性。我们提供的实验结果表明,在合成数据和实际数据方面均优于先前的算法,包括300万天文观测数据集和蛋白质折叠轨迹数据集。此外,我们的算法比以前的方法使用更少的存储空间。更一般地,我们的算法似乎是众所周知的欧几里得最小生成树问题的最快实际解决方案。
课程简介: 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.
关 键 词: 单链接层次; 数据挖掘; 天文观测数据集
课程来源: 视频讲座网
最后编审: 2019-04-10:lxf
阅读次数: 60