Iterative merging heuristics for correlation clustering

Andrzej Lingas,Mia Persson,Dzmitry Sledneu

International Journal of Metaheuristics（2014）

引用 5|浏览13

暂无评分

摘要

straightforward natural iterative heuristic for correlation clustering in the general setting is to start from singleton clusters and whenever merging two clusters improves the current quality score merge them into a single cluster. We analyse the approximation and complexity aspects of this heuristic and its three simple deterministic or random refinements.

查看译文

关键词

graph clustering,time complexity,approximation algorithms,correlation clustering

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要