DG

David Gleich

Sort by
Engineering Data Science Objectives for Social Network Analysis
Correlation clustering and community detection in graphs and networks
Spectral clustering with motifs and higher-order structures
Higher-order organization of complex networks
Spacey random walks and higher-order data analysis
Non-exhaustive, Overlapping K-means
Using Local Spectral Methods to Robustify Graph-Based Learning
Spacey random walks and higher order Markov chains
Localized methods in graph mining
PageRank Centrality of dynamic graph structures
Iterative methods with special structures
Big data matrix factorizations and Overlapping community detection in graphs
Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow
Localized methods for diffusions in large graphs
Anti-differentiating Approximation Algorithms: PageRank and MinCut