arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2309.09386cs.DM
收藏

无距离图划分的公理

Axioms for Distanceless Graph Partitioning

James Willson, Tandy Warnow

AI总结:

本文针对无距离矩阵的无权图划分提出并分析一组公理,证明Constant Potts Model满足全部公理,而Modularity与迭代k-core存在多项不满足。

摘要:

2002年,Kleinberg为基于距离的聚类提出了三条公理,并证明任何聚类方法都不可能同时满足这三条公理。尽管此后有大量工作检验并修改这些基于距离聚类的公理,但当图为无权图且不提供距离矩阵时,针对图划分问题相关公理的探索却很少。在此,我们提出并研究了适用于这种情形的图划分公理,包括对Kleinberg公理的修改以及另外三条公理:两条与“分辨率极限”相关,另一条涉及良好连通性。我们证明,Constant Potts Model下的聚类满足所有公理,而Modularity聚类和迭代k-core均未能满足我们提出的多条公理。这些聚类方法的理论性质既与理论研究相关,也对考虑在其领域科学研究中选择何种方法的实践者具有参考意义。

英文摘要:

In 2002, Kleinberg proposed three axioms for distance-based clustering, and proved that it was impossible for a clustering method to satisfy all three. While there has been much subsequent work examining and modifying these axioms for distance-based clustering, little work has been done to explore axioms relevant to the graph partitioning problem when the graph is unweighted and given without a distance matrix. Here, we propose and explore axioms for graph partitioning for this case, including modifications of Kleinberg's axioms and three others: two axioms relevant to the ``Resolution Limit'' and one addressing well-connectedness. We prove that clustering under the Constant Potts Model satisfies all the axioms, while Modularity clustering and iterative k-core both fail many axioms we pose. These theoretical properties of the clustering methods are relevant both for theoretical investigation as well as to practitioners considering which methods to use for their domain science studies.

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

↑