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

单纯形聚类

Clustering with Simplicial Complexes

Indian Institute of Science(印度科学学院);ENS de Lyon(里昂高等师范学院);CNRS(法国国家科学研究中心)

Thummaluru Siddartha Reddy, Sundeep Prabhakar Chepuri, Pierre Borgnat

摘要:

在这项工作中,我们提出了一种新的聚类算法,基于二阶单纯形(又名填充三角形)对网络中的节点进行分组,以利用高阶网络交互。我们定义了一个单纯的电导函数,它最小化,产生一个最佳的分区与较高的密度填充三角形内的集合,而填充三角形的密度是较小的跨集。为此,我们提出了一个单纯邻接算子,通过二阶单纯形捕捉节点之间的关系。这使我们能够扩展著名的Cheeger不等式来聚类单纯复形。然后,利用Cheeger不等式,我们提出了单纯谱聚类算法。我们报告的合成和真实世界的网络数据的数值实验结果,以证明所提出的方法的有效性。

英文摘要:

In this work, we propose a new clustering algorithm to group nodes in networks based on second-order simplices (aka filled triangles) to leverage higher-order network interactions. We define a simplicial conductance function, which on minimizing, yields an optimal partition with a higher density of filled triangles within the set while the density of filled triangles is smaller across the sets. To this end, we propose a simplicial adjacency operator that captures the relation between the nodes through second-order simplices. This allows us to extend the well-known Cheeger inequality to cluster a simplicial complex. Then, leveraging the Cheeger inequality, we propose the simplicial spectral clustering algorithm. We report results from numerical experiments on synthetic and real-world network data to demonstrate the efficacy of the proposed approach.

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

↑