scientific article; zbMATH DE number 6276186

MaRDI QIDQ5405192zbMATH OpenFDO

Authors Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi

Publication date 1 April 2014

Full work available at URL http://www.jmlr.org/papers/v13/mahoney12a.html

zbMATH Keywords

Laplacian matrixlocal spectral algorithmspersonalized PageRanksemi-supervised learningspectral graph partitioning

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Multivariate analysis (62H99) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 910879
• A general method to obtain the spectrum and local spectra of a graph from its regular partitions
• A conjugate gradient method for the spectral partitioning of graphs
• A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
• Graph partitioning via adaptive spectral techniques
• Multi-level spectral graph partitioning method
• Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition
• A distributed algorithm for spectral sparsification of graphs with applications to data clustering

Cited in

(16)

• Variational perspective on local graph clustering
• Spectral clustering revisited: information hidden in the Fiedler vector
• Locally supported eigenvectors of matrices associated with connected and unweighted power-law graphs
• PageRank beyond the web
• A general method to obtain the spectrum and local spectra of a graph from its regular partitions
• Localized eigenvectors of the non-backtracking matrix
• Seeded PageRank solution paths
• Constrained graph partitioning via matrix differential equations
• Compressive sensing for cut improvement and local clustering
• scientific article; zbMATH DE number 7626762 (Why is no real title available?)
• Semi-supervised eigenvectors for large-scale locally-biased learning
• Experimental and Efficient Algorithms
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• A compressed sensing based least squares approach to semi-supervised local cluster extraction
• A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings
• Structured linear stability problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405192)