Axioms for graph clustering quality functions

v1v2 (latest)

Axioms for graph clustering quality functions

15 August 2013

Twan van Laarhoven

ArXiv (abs)PDF HTML

Papers citing "Axioms for graph clustering quality functions"

8 / 8 papers shown

Title
High-Dimensional Wide Gap $k$ -Means Versus Clustering Axioms M. Klopotek 118 0 0 30 Nov 2022
How To Overcome Richness Axiom Fallacy M. Klopotek R. A. Klopotek 58 0 0 27 Oct 2022
Towards Continuous Consistency Axiom M. Klopotek R. A. Klopotek 75 5 0 12 Feb 2022
Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach Gunnar Carlsson Facundo Mémoli Santiago Segarra 39 3 0 16 Aug 2021
Overlapping community detection in networks based on link partitioning and partitioning around medoids Alexander Ponomarenko L. Pitsoulis Marat Shamshetdinov 46 12 0 20 Jul 2019
Possibility results for graph clustering: A novel consistency axiom Fabio Strazzeri Rubén J. Sánchez-García 111 10 0 15 Jun 2018
Excisive Hierarchical Clustering Methods for Network Data Gunnar Carlsson Facundo Mémoli Alejandro Ribeiro Santiago Segarra 45 5 0 21 Jul 2016
Admissible Hierarchical Clustering Methods and Algorithms for Asymmetric Networks Gunnar Carlsson Facundo Mémoli Alejandro Ribeiro Santiago Segarra 56 12 0 21 Jul 2016