arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.03671cs.LG
收藏

基于层次聚类的高维数据快速近邻交互

Rapid Near-Neighbor Interaction of High-dimensional Data via Hierarchical Clustering

Aristotle University of Thessaloniki(塞萨洛尼基亚里士多德大学);Duke University(杜克大学)

Nikos Pitsianis, Dimitris Floros, Alexandros-Stavros Iliopoulos, Kostas Mylonakis, Nikos Sismanis, Xiaobai Sun

摘要:

计算高维、不规则分布的数据点之间的近邻交互是许多基于图或基于核的机器学习算法和应用的基本任务。这样的计算,涉及大的,稀疏的相互作用矩阵,暴露了传统的数据和计算重新排序技术的限制,以提高现代计算机存储层次结构上的空间和时间的局部性。我们介绍了一种新的方法来获得矩阵置换,使一个理想的稀疏配置文件。该方法的区别在于指导原则,以获得具有密集块的块稀疏的轮廓。我们的配置文件模型和措施捕获影响空间和时间局部性的基本属性,并允许在稀疏配置文件的变化,而不施加限制到一个固定的模式。第二个区别在于通过探索和利用隐藏在数据中但固有的多尺度聚类结构来获得所需配置文件的有效算法。该算法完成其任务的关键组件低维嵌入数据特定的主特征轴,分层数据聚类,多级矩阵压缩存储,和多级交互计算。我们提供了两个重要的数据分析算法的案例研究的实验结果。由此产生的性能是显着可比的BLAS性能的最佳情况下的相互作用所管辖的一个定期带状矩阵具有相同的稀疏性。

英文摘要:

Calculation of near-neighbor interactions among high dimensional, irregularly distributed data points is a fundamental task to many graph-based or kernel-based machine learning algorithms and applications. Such calculations, involving large, sparse interaction matrices, expose the limitation of conventional data-and-computation reordering techniques for improving space and time locality on modern computer memory hierarchies. We introduce a novel method for obtaining a matrix permutation that renders a desirable sparsity profile. The method is distinguished by the guiding principle to obtain a profile that is block-sparse with dense blocks. Our profile model and measure capture the essential properties affecting space and time locality, and permit variation in sparsity profile without imposing a restriction to a fixed pattern. The second distinction lies in an efficient algorithm for obtaining a desirable profile, via exploring and exploiting multi-scale cluster structure hidden in but intrinsic to the data. The algorithm accomplishes its task with key components for lower-dimensional embedding with data-specific principal feature axes, hierarchical data clustering, multi-level matrix compression storage, and multi-level interaction computations. We provide experimental results from case studies with two important data analysis algorithms. The resulting performance is remarkably comparable to the BLAS performance for the best-case interaction governed by a regularly banded matrix with the same sparsity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑