带惊奇的图聚类:复杂性与精确解
Graph Clustering with Surprise: Complexity and Exact Solutions
摘要:
基于簇内链接数量与随机图中该数量的期望值的比较的聚类图在过去十年中获得了大量的关注和普及。最近,Aldecoa和Marin提出了一种相关的,但略有不同的方法,导致质量测量惊喜,并报告了在合成和真实世界基准测试的背景下良好的行为。我们发现,找到一个集群与最佳惊喜的问题是NP难的。此外,一个双判据的观点,允许计算最佳解决方案的小实例,通过解决少量的整数线性规划,并导致树的多项式时间算法。
英文摘要:
Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularity in the last decade. Recently, Aldecoa and Marin proposed a related, but slightly different approach leading to the quality measure surprise, and reported good behavior in the context of synthetic and real world benchmarks. We show that the problem of finding a clustering with optimum surprise is NP-hard. Moreover, a bicriterial view on the problem permits to compute optimum solutions for small instances by solving a small number of integer linear programs, and leads to a polynomial time algorithm on trees.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。