arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1407.1352cs.CV
收藏

基于局部非对称几何的同伦聚类

Homophilic Clustering by Locally Asymmetric Geometry

HTC Beijing Advanced Technology and Research Center(HTC北京先进技术与研究中心);The Chinese University of Hong Kong(香港中文大学)

Deli Zhao, Xiaoou Tang

摘要:

聚类是许多科学学科中数据分析不可或缺的一部分。从强噪声中检测聚类仍然具有挑战性,特别是对于高维稀疏数据。基于图论框架,本文提出了一种新的算法来解决这个问题。数据点之间的邻域的局部非对称几何形状导致有向相似性图来模拟数据点的结构连接。简单地通过其邻接矩阵的幂在这个有向图上执行相似性传播会导致一个有趣的发现,在这个意义上,如果入度由相应的排序出度排序,则它们将根据簇密度的不同分布自组织为homophilic层,这被称为Homophilic In-degree图(HI图)。利用HI图,我们可以很容易地挑出所有的核心集群,识别集群和噪声之间的边界,并可视化集群的内在结构。基于入度同伦,我们还提出了一种简单有效的线性空间复杂度聚类算法。在玩具和真实科学数据上的实验验证了算法的有效性。

英文摘要:

Clustering is indispensable for data analysis in many scientific disciplines. Detecting clusters from heavy noise remains challenging, particularly for high-dimensional sparse data. Based on graph-theoretic framework, the present paper proposes a novel algorithm to address this issue. The locally asymmetric geometries of neighborhoods between data points result in a directed similarity graph to model the structural connectivity of data points. Performing similarity propagation on this directed graph simply by its adjacency matrix powers leads to an interesting discovery, in the sense that if the in-degrees are ordered by the corresponding sorted out-degrees, they will be self-organized to be homophilic layers according to the different distributions of cluster densities, which is dubbed the Homophilic In-degree figure (the HI figure). With the HI figure, we can easily single out all cores of clusters, identify the boundary between cluster and noise, and visualize the intrinsic structures of clusters. Based on the in-degree homophily, we also develop a simple efficient algorithm of linear space complexity to cluster noisy data. Extensive experiments on toy and real-world scientific data validate the effectiveness of our algorithms.

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

↑