arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.2663cs.SIcs.LGphysics.soc-phstat.ML
收藏

考虑传染扩散的谱聚类

Spectral Clustering with Epidemic Diffusion

California State University, Fullerton(加州州立大学富勒顿分校);USC Information Sciences Institute(南加州大学信息科学研究所);Claremont Graduate University(克莱蒙特研究生大学);HP Labs(惠普实验室)

Laura M. Smith, Kristina Lerman, Cristina Garcia-Cardona, Allon G. Percus, Rumi Ghosh

摘要:

谱聚类被广泛用于将图划分为不同的模块或社区。现有的谱聚类方法使用图拉普拉斯算子的特征值和特征向量,这是一种与图上的随机游走密切相关的算子。我们提出了一种新的谱分割方法,利用流行病扩散的属性。流行病是一个动态过程,与随机游走不同,它同时转移到给定节点的所有邻居。我们发现,复制,一个操作符描述流行病扩散,是等价的对称归一化拉普拉斯算子的重加权图的边缘重加权的特征向量中心的事件节点。因此,更多的权重被给予连接更多中心节点的边。我们描述了一种方法,分区节点的复制的第二特征向量的第一分量比的基础上,并比较其性能与传统的谱聚类技术与已知的社区结构的合成图。我们证明了复制因子优先考虑密集的,类cnc的结构,使其能够更有效地发现社区,可能被掩盖的密集社区间的联系。

英文摘要:

Spectral clustering is widely used to partition graphs into distinct modules or communities. Existing methods for spectral clustering use the eigenvalues and eigenvectors of the graph Laplacian, an operator that is closely associated with random walks on graphs. We propose a new spectral partitioning method that exploits the properties of epidemic diffusion. An epidemic is a dynamic process that, unlike the random walk, simultaneously transitions to all the neighbors of a given node. We show that the replicator, an operator describing epidemic diffusion, is equivalent to the symmetric normalized Laplacian of a reweighted graph with edges reweighted by the eigenvector centralities of their incident nodes. Thus, more weight is given to edges connecting more central nodes. We describe a method that partitions the nodes based on the componentwise ratio of the replicator's second eigenvector to the first, and compare its performance to traditional spectral clustering techniques on synthetic graphs with known community structure. We demonstrate that the replicator gives preference to dense, clique-like structures, enabling it to more effectively discover communities that may be obscured by dense intercommunity linking.

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

↑