ResearchTrend.AI
Learning Resolution Parameters for Graph Clustering

Learning Resolution Parameters for Graph Clustering

Nate Veldt
D. Gleich
Anthony Wirth
ArXiv (abs)PDFHTML

Papers citing "Learning Resolution Parameters for Graph Clustering"

4 / 4 papers shown
Title
Temporal Dynamics of Coordinated Online Behavior: Stability, Archetypes, and Influence
Temporal Dynamics of Coordinated Online Behavior: Stability, Archetypes, and Influence
S. Tardelli
Leonardo Nizzoli
Maurizio Tesconi
Mauro Conti
Preslav Nakov
Giovanni Da San Martino
S. Cresci
46
25
0
17 Jan 2023
The Generalized Mean Densest Subgraph Problem
The Generalized Mean Densest Subgraph Problem
Nate Veldt
Austin R. Benson
Jon M. Kleinberg
38
30
0
02 Jun 2021
Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering
Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering
Meng Liu
D. Gleich
53
13
0
15 Jun 2020
Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
Flow-based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
Kimon Fountoulakis
M. Liu
D. Gleich
Michael W. Mahoney
65
11
0
20 Apr 2020