David F. Gleich

Orcid: 0000-0002-8107-6474

Affiliations:
  • Purdue University, West Lafayette, Department of Computer Science
  • Stanford University, Institute for Computational and Mathematical Engineering


According to our database1, David F. Gleich authored at least 123 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Better than best low-rank approximation with the singular value decomposition.
CoRR, 2024

2023
Topological structure of complex predictions.
Nat. Mac. Intell., December, 2023

Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple.
SIAM J. Matrix Anal. Appl., September, 2023

Aligning Spatially Constrained Graphs.
IEEE Trans. Knowl. Data Eng., August, 2023

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance.
SIAM Rev., February, 2023

Multi-scale Local Network Structure Critically Impacts Epidemic Spread and Interventions.
CoRR, 2023

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods.
CoRR, 2023

Theoretical bounds on the network community profile from low-rank semi-definite programming.
CoRR, 2023

A Cheeger Inequality for Size-Specific Conductance.
CoRR, 2023

Theoretical Bounds on the Network Community Profile from Low-rank Semi-definite Programming.
Proceedings of the International Conference on Machine Learning, 2023

2022
A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings.
CoRR, 2022

Fauci-Email: A JSON Digest of Anthony Fauci's Released Emails.
Proceedings of the Sixteenth International AAAI Conference on Web and Social Media, 2022

2021
Adaptive Erasure Coded Fault Tolerant Linear System Solver.
ACM Trans. Parallel Comput., 2021

Scalable Algorithms for Multiple Network Alignment.
SIAM J. Sci. Comput., 2021

Higher-order Network Analysis Takes Off, Fueled by Classical Ideas and New Data.
CoRR, 2021

Strongly Local Hypergraph Diffusions for Clustering and Semi-supervised Learning.
Proceedings of the WWW '21: The Web Conference 2021, 2021

2020
Neighborhood and PageRank methods for pairwise link prediction.
Soc. Netw. Anal. Min., 2020

Addressing Computational Bottlenecks in Higher-Order Graph Matching with Tensor Kronecker Product Structure.
CoRR, 2020

Local Hypergraph Clustering using Capacity Releasing Diffusion.
CoRR, 2020

Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs.
CoRR, 2020

Classes of preferential attachment and triangle preferential attachment models with power-law spectra.
J. Complex Networks, 2020

Using Cliques with Higher-order Spectral Embeddings Improves Graph Visualizations.
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

A Parallel Projection Method for Metric Constrained Optimization.
Proceedings of the SIAM Workshop on Combinatorial Scientific Computing, 2020

Strongly local p-norm-cut algorithms for semi-supervised learning and local graph clustering.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Graph Clustering in All Parameter Regimes.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

2019
Metric-Constrained Optimization for Graph Clustering Algorithms.
SIAM J. Math. Data Sci., 2019

Multiway Monte Carlo Method for Linear Systems.
SIAM J. Sci. Comput., 2019

Coin-Flipping, Ball-Dropping, and Grass-Hopping for Generating Random Graphs from Matrices of Edge Probabilities.
SIAM Rev., 2019

Computing Tensor Z-Eigenvectors with Dynamical Systems.
SIAM J. Matrix Anal. Appl., 2019

Non-Exhaustive, Overlapping Clustering.
IEEE Trans. Pattern Anal. Mach. Intell., 2019

Triangle Preferential Attachment Has Power-law Degrees and Eigenvalues; Eigenvalues Are More Stable to Network Sampling.
CoRR, 2019

Multimodal network diffusion predicts future disease-gene-chemical associations.
Bioinform., 2019

Learning Resolution Parameters for Graph Clustering.
Proceedings of the World Wide Web Conference, 2019

Nonlinear Diffusion for Community Detection and Semi-Supervised Learning.
Proceedings of the World Wide Web Conference, 2019

Flow-Based Local Graph Clustering with Better Seed Set Inclusion.
Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

Rigid Graph Alignment.
Proceedings of the Complex Networks and Their Applications VIII, 2019

Centrality in Dynamic Competition Networks.
Proceedings of the Complex Networks and Their Applications VIII, 2019

Pairwise link prediction.
Proceedings of the ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining, 2019

2018
A Short Introduction to Local Graph Clustering Methods and Software.
CoRR, 2018

Low rank methods for multiple network alignment.
CoRR, 2018

A Projection Method for Metric-Constrained Optimization.
CoRR, 2018

A Correlation Clustering Framework for Community Detection.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Low Rank Spectral Network Alignment.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Dynamic Competition Networks: Detecting Alliances and Leaders.
Proceedings of the Algorithms and Models for the Web Graph - 15th International Workshop, 2018

Correlation Clustering Generalized.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

The HyperKron Graph Model for Higher-Order Features.
Proceedings of the IEEE International Conference on Data Mining, 2018

2017
Triangular Alignment (TAME): A Tensor-Based Approach for Higher-Order Network Alignment.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

Erasure Coding for Fault-Oblivious Linear System Solvers.
SIAM J. Sci. Comput., 2017

The Spacey Random Walk: A Stochastic Process for Higher-Order Data.
SIAM Rev., 2017

An Optimization Approach to Locally-Biased Graph Algorithms.
Proc. IEEE, 2017

Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering.
CoRR, 2017

AptRank: an adaptive PageRank model for protein function prediction on bi-relational graphs.
Bioinform., 2017

Correlation Clustering with Low-Rank Matrices.
Proceedings of the 26th International Conference on World Wide Web, 2017

Multimodal Network Alignment.
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

Local Higher-Order Graph Clustering.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Retrospective Higher-Order Markov Processes for User Trails.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Revisiting Power-law Distributions in Spectra of Real World Networks.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Distributed Fault Tolerant Linear System Solvers Based on Erasure Coding.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016
Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion.
IEEE Trans. Knowl. Data Eng., 2016

Current and Future Challenges in Mining Large Networks: Report on the Second SDM Workshop on Mining Networks and Graphs.
SIGKDD Explor., 2016

A parallel min-cut algorithm using iteratively reweighted least squares targeting at problems with floating-point edge weights.
Parallel Comput., 2016

Multi-way Monte Carlo Method for Linear Systems.
CoRR, 2016

A randomized algorithm for enumerating zonotope vertices.
CoRR, 2016

Higher-order organization of complex networks.
CoRR, 2016

Mining and Modeling Character Networks.
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

Fast Multiplier Methods to Optimize Non-exhaustive, Overlapping Clustering.
Proceedings of the 2016 SIAM International Conference on Data Mining, 2016

General Tensor Spectral Co-clustering for Higher-Order Data.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Deconvolving Feedback Loops in Recommender Systems.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

A Simple and Strongly-Local Flow-Based Method for Cut Improvement.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Massive graph processing on nanocomputers.
Proceedings of the 2016 IEEE International Conference on Big Data (IEEE BigData 2016), 2016

Mining Large Graphs.
Proceedings of the Handbook of Big Data., 2016

2015
Parallel Maximum Clique Algorithms with Applications to Network Analysis.
SIAM J. Sci. Comput., 2015

PageRank Beyond the Web.
SIAM Rev., 2015

Multilinear PageRank.
SIAM J. Matrix Anal. Appl., 2015

Sublinear Column-wise Actions of the Matrix Exponential on Social Networks.
Internet Math., 2015

A Parallel Min-Cut Algorithm using Iteratively Reweighted Least Squares.
CoRR, 2015

Personalized PageRank Solution Paths.
CoRR, 2015

Strong Localization in Personalized PageRank Vectors.
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

Non-exhaustive, Overlapping <i>k</i>-means.
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

Tensor Spectral Clustering for Partitioning Higher-order Network Structures.
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

Non-exhaustive, Overlapping Clustering via Low-Rank Semidefinite Programming.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

Differential flux balance analysis of quantitative proteomic data on protein interaction networks.
Proceedings of the 2015 IEEE Global Conference on Signal and Information Processing, 2015

2014
Model Reduction With MapReduce-enabled Tall and Skinny Singular Value Decomposition.
SIAM J. Sci. Comput., 2014

A Dynamical System for PageRank with Time-Dependent Teleportation.
Internet Math., 2014

Using Triangles to Improve Community Detection in Directed Networks.
CoRR, 2014

Dimensionality of social networks using motifs and eigenvalues.
CoRR, 2014

Fast maximum clique algorithms for large graphs.
Proceedings of the 23rd International World Wide Web Conference, 2014

Scalable Methods for Nonnegative Matrix Factorizations of Near-separable Tall-and-skinny Matrices.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Heat kernel based community detection.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Message-Passing Algorithms for Sparse Network Alignment.
ACM Trans. Knowl. Discov. Data, 2013

The power and Arnoldi methods in an algebra of circulants.
Numer. Linear Algebra Appl., 2013

Expanders, tropical semi-rings, and nuclear norms: oh my!
XRDS, 2013

A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components
CoRR, 2013

A Fast Relaxation Method for Computing a Column of the Matrix Exponential of Stochastic Matrices from Large, Sparse Networks.
CoRR, 2013

A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

Overlapping community detection using seed set expansion.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Direct QR factorizations for tall-and-skinny matrices in MapReduce architectures.
Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2012
Moment-Based Estimation of Stochastic Kronecker Graph Parameters.
Internet Math., 2012

Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores.
Internet Math., 2012

What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks
CoRR, 2012

Overlapping clusters for distributed computation.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Dynamic PageRank Using Evolving Teleportation.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

A multithreaded algorithm for network alignment via approximate matching.
Proceedings of the SC Conference on High Performance Computing Networking, 2012

Vertex neighborhoods, low conductance cuts, and good seeds for local community methods.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Distinguishing signal from noise in an SVD of simulation data.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012

2011
A Factorization of the Spectral Galerkin System for Parameterized Matrix Equations: Derivation and Applications.
SIAM J. Sci. Comput., 2011

Neighborhoods are good communities
CoRR, 2011

Fast matrix computations for pair-wise and column-wise commute times and Katz scores
CoRR, 2011

Rank aggregation via nuclear norm minimization.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010
An Inner-Outer Iteration for Computing PageRank.
SIAM J. Sci. Comput., 2010

Spectral Methods for Parameterized Matrix Equations.
SIAM J. Matrix Anal. Appl., 2010

Tracking the random surfer: empirically measured teleportation parameters in PageRank.
Proceedings of the 19th International Conference on World Wide Web, 2010

Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

2009
Random Alpha PageRank.
Internet Math., 2009

Algorithms for Large, Sparse Network Alignment Problems.
Proceedings of the ICDM 2009, 2009

2008
A Monte Carlo method for solving unsteady adjoint equations.
J. Comput. Phys., 2008

2007
Approximating Personalized PageRank with Minimal Use of Web Graph Data.
Internet Math., 2007

Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Three results on the PageRank vector: eigenstructure, sensitivity, and the derivative.
Proceedings of the Web Information Retrieval and Linear Algebra Algorithms, 11.02., 2007

2004
SVD based Term Suggestion and Ranking System.
Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004


  Loading...