scientific article; zbMATH DE number 6276186

zbMATH Open1433.68365MaRDI QIDQ5405192FDOQ5405192

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

Title of this publication is not available (Why is that?)

Recommendations

• Publication:4886053
• 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

zbMATH Keywords

Laplacian matrixsemi-supervised learningspectral graph partitioningpersonalized PageRanklocal spectral algorithms

Mathematics Subject Classification ID

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

Cited In (15)

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

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)