Statistical guarantees for local graph clustering

Local graph clustering methods aim to find small clusters in very large graphs. These methods take as input a graph and a seed node, and they return as output a good cluster in a running time that depends on the size of the output cluster but that is independent of the size of the input graph. In th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Ha, Wooseok, Fountoulakis, Kimon, Mahoney, Michael W
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Learning Mathematics - Optimization and Control Mathematics - Statistics Theory Statistics - Machine Learning Statistics - Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!