优化拓扑图聚类的有组织模块性度量:确定性退火方法
Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach
摘要:
本文提出了一个有组织的推广纽曼和Girvan的图聚类的模块性措施。通过确定性退火方案优化,该措施产生拓扑有序的图聚类,导致基于聚类诱导图的忠实和可读的图表示。拓扑图聚类提供了一种替代更经典的解决方案,其中应用标准图聚类方法来构建更简单的图,然后用图布局算法表示。对四个顶点数从34到1133的真实图的比较研究表明,所提出的方法与经典解和图的自组织映射有关。
英文摘要:
This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topographic graph clustering provides an alternative to more classical solutions in which a standard graph clustering method is applied to build a simpler graph that is then represented with a graph layout algorithm. A comparative study on four real world graphs ranging from 34 to 1 133 vertices shows the interest of the proposed approach with respect to classical solutions and to self-organizing maps for graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。