Axioms for Distanceless Graph Partitioning
share
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, i.e., when the graph is given without a distance matrix. Here, we propose and explore axioms for graph partitioning when given graphs without distance matrices, including modifications of Kleinberg's axioms for the distanceless case and two others (one axiom 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.
READ FULL TEXT