Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox

Picture for David F. Gleich

Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering


Jun 15, 2020
Meng Liu, David F. Gleich

* 23 pages. Code available at http://github.com/MengLiuPurdue/SLQ 

  Access Paper or Ask Questions

Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs


Feb 21, 2020
Nate Veldt, Anthony Wirth, David F. Gleich


  Access Paper or Ask Questions

Learning Resolution Parameters for Graph Clustering


Mar 12, 2019
Nate Veldt, David F. Gleich, Anthony Wirth


  Access Paper or Ask Questions

A Parallel Projection Method for Metric Constrained Optimization


Jan 29, 2019
Cameron Ruggles, Nate Veldt, David F. Gleich


  Access Paper or Ask Questions

Low rank methods for multiple network alignment


Sep 21, 2018
Huda Nassar, Georgios Kollias, Ananth Grama, David F. Gleich

* 17 pages, 10 figures 

  Access Paper or Ask Questions

Correlation Clustering with Low-Rank Matrices


Mar 17, 2017
Nate Veldt, Anthony Wirth, David F. Gleich


  Access Paper or Ask Questions

Multi-way Monte Carlo Method for Linear Systems


Aug 15, 2016
Tao Wu, David F. Gleich


  Access Paper or Ask Questions

Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering


Feb 05, 2016
Yangyang Hou, Joyce Jiyoung Whang, David F. Gleich, Inderjit S. Dhillon

* 9 pages. 2 figures 

  Access Paper or Ask Questions

Scalable methods for nonnegative matrix factorizations of near-separable tall-and-skinny matrices


Feb 27, 2014
Austin R. Benson, Jason D. Lee, Bartek Rajwa, David F. Gleich

* Proceedings of Neural Information Processing Systems, 2014 

  Access Paper or Ask Questions

Dynamic PageRank using Evolving Teleportation


Mar 27, 2012
Ryan A. Rossi, David F. Gleich

* WAW 2012 

  Access Paper or Ask Questions

Moment based estimation of stochastic Kronecker graph parameters


Jun 08, 2011
David F. Gleich, Art B. Owen

* 22 pages, 4 figures 

  Access Paper or Ask Questions