arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.04886physics.data-ancs.DS
收藏

基于路径图的高维聚类分析

High Dimensional Cluster Analysis Using Path Lengths

Kevin McIlhany, Stephen Wiggins

摘要:

提出了一种适用于高维空间的数据聚类的层次化方法($N_{_{D}}>3$)。首先将数据集简化为较小的分区集(多维箱)。使用多种聚类技术,包括谱聚类,然而,也引入了基于彼此连接的分区之间的路径长度的新技术。一个视线算法也被开发用于聚类。一个测试银行的12个数据集具有不同的属性是用来暴露每种技术的优点和缺点。最后,讨论了一个强大的聚类技术的基础上达成共识的多种方法,克服个别发现的弱点。

英文摘要:

A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimension ($N_{_{D}}>3$). The data set is first reduced to a smaller set of partitions (multi-dimensional bins). Multiple clustering techniques are used, including spectral clustering, however, new techniques are also introduced based on the path length between partitions that are connected to one another. A Line-Of-Sight algorithm is also developed for clustering. A test bank of 12 data sets with varying properties is used to expose the strengths and weaknesses of each technique. Finally, a robust clustering technique is discussed based on reaching a consensus among the multiple approaches, overcoming the weaknesses found individually.

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

↑