1.3k citations · 2.2k across the 67 of their papers we have counts for
11 papers · 1 filter
Higher-order organization of complex networks
Austin R. Benson, David F. Gleich, Jure Leskovec
Networks are a fundamental tool for understanding and modeling complex systems in physics, biology, neuroscience, engineering, and social science. Many networks are known to exhibi…
Correlation Clustering with Low-Rank Matrices
Nate Veldt, Anthony Wirth, David F. Gleich
Correlation clustering is a technique for aggregating data based on qualitative information about which pairs of objects are labeled 'similar' or 'dissimilar.' Because the optimiza…
Mining and modeling character networks
Anthony Bonato, David Ryan D'Angelo, Ethan R. Elenberg +2
We investigate social networks of characters found in cultural works such as novels and films. These character networks exhibit many of the properties of complex networks such as s…
Multi-way Monte Carlo Method for Linear Systems
Tao Wu, David F. Gleich
We study the Monte Carlo method for solving a linear system of the form . A sufficient condition for the method to work is , which greatly limits the usab…
An optimization approach to locally-biased graph algorithms
Kimon Fountoulakis, David Gleich, Michael Mahoney
Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a large data graph. In some cases, this can be accomplished by adding some sor…
A Simple and Strongly-Local Flow-Based Method for Cut Improvement
Nate Veldt, David F. Gleich, Michael W. Mahoney
Many graph-based learning problems can be cast as finding a good set of vertices nearby a seed set, and a powerful methodology for these problems is based on maximum flows. We intr…
General Tensor Spectral Co-clustering for Higher-Order Data
Tao Wu, Austin R. Benson, David F. Gleich
Spectral clustering and co-clustering are well-known techniques in data analysis, and recent work has extended spectral clustering to square, symmetric tensors and hypermatrices de…
A randomized algorithm for enumerating zonotope vertices
Kerrek Stinson, David F. Gleich, Paul G. Constantine
We propose a randomized algorithm for enumerating the vertices of a zonotope, which is a low-dimensional linear projection of a hypercube. The algorithm produces a pair of the zono…
Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering
Yangyang Hou, Joyce Jiyoung Whang, David F. Gleich +1
Clustering is one of the most fundamental and important tasks in data mining. Traditional clustering algorithms, such as K-means, assign every data point to exactly one cluster. Ho…
The Spacey Random Walk: a Stochastic Process for Higher-order Data
Austin R. Benson, David F. Gleich, Lek-Heng Lim
Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the frac…
AptRank: An Adaptive PageRank Model for Protein Function Prediction on Bi-relational Graphs
Biaobin Jiang, Kyle Kloster, David F. Gleich +1
Diffusion-based network models are widely used for protein function prediction using protein network data and have been shown to outperform neighborhood- and module-based methods.…