arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.1318stat.ML
收藏

谱图聚类的有效特征更新算法

Efficient Eigen-updating for Spectral Graph Clustering

Charanpal Dhanjal, Romaric Gaudel, Stéphan Clémençon

摘要:

将图划分为顶点组,使得每个组中的顶点比分配给不同组的顶点连接得更紧密,这称为图聚类,通常用于深入了解大规模网络的组织和可视化目的。虽然最近已经提出了大量的专用技术的静态图,设计的在线图聚类方法,为不断发展的网络是一个具有挑战性的问题,少得多的文献记载。出于各种各样的应用程序有关,从生物网络的研究,通过探索通信网络,如万维网的科学参考网络的分析,这是本文的主要目的,介绍一种新的,计算效率高,方法图聚类在进化的背景下。也就是说,在这篇文章中提出的方法可以被看作是一个增量特征值解的谱聚类方法所描述的Ng。等人(2001)。增量特征值法是求对称矩阵的近似特征向量的一般方法。以及详细概述的方法,我们提出了一个理论界的质量的近似特征向量扰动理论。然后,我们推导出一种新的谱聚类算法称为增量近似谱聚类(IASC)。IASC算法易于实现,其有效性在模拟艾滋病毒流行病演变的合成和真实数据集、引用网络和电子商务网站的购买历史图上都得到了证明。

英文摘要:

Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the organisation of large scale networks and for visualisation purposes. Whereas a large number of dedicated techniques have been recently proposed for static graphs, the design of on-line graph clustering methods tailored for evolving networks is a challenging problem, and much less documented in the literature. Motivated by the broad variety of applications concerned, ranging from the study of biological networks to the analysis of networks of scientific references through the exploration of communications networks such as the World Wide Web, it is the main purpose of this paper to introduce a novel, computationally efficient, approach to graph clustering in the evolutionary context. Namely, the method promoted in this article can be viewed as an incremental eigenvalue solution for the spectral clustering method described by Ng. et al. (2001). The incremental eigenvalue solution is a general technique for finding the approximate eigenvectors of a symmetric matrix given a change. As well as outlining the approach in detail, we present a theoretical bound on the quality of the approximate eigenvectors using perturbation theory. We then derive a novel spectral clustering algorithm called Incremental Approximate Spectral Clustering (IASC). The IASC algorithm is simple to implement and its efficacy is demonstrated on both synthetic and real datasets modelling the evolution of a HIV epidemic, a citation network and the purchase history graph of an e-commerce website.

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

↑