Fast Random Walk with Restart and its Applications

First Page		Document Content
Date: 2007-02-19 15:29:14 Numerical linear algebra Singular value decomposition Matrix theory NP-complete problems Graph partition Principal component analysis Eigenvalues and eigenvectors Latent semantic analysis Low-rank approximation Algebra Mathematics Linear algebra		Fast Random Walk with Restart and its Applications Add to Reading List Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 151,06 KB Share Document on Facebook

	A Quadratically Convergent Algorithm for Structured Low-Rank Approximation ´ Eric Schost1 and Pierre-Jean Spaenlehauer2 1 DocID: 1uPNr - View Document
	An Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation David Anderson * 1 Ming Gu * 1 Abstract DocID: 1tG55 - View Document
	Low-Rank Tensor Approximation with Laplacian Scale Mixture Modeling for Multiframe Image Denoising Weisheng Dong Xidian University, China Guangyu Li DocID: 1tgsG - View Document
	ridge leverage scores for low-rank matrix approximation Michael B. Cohen, Cameron Musco, Christopher Musco Massachusetts Institute of Technology DocID: 1sUq4 - View Document
	JMLR: Workshop and Conference Proceedings vol 40:1–29, 2015 On the Complexity of Learning with Kernels Nicol`o Cesa-Bianchi NICOLO . CESA - BIANCHI @ UNIMI . IT DocID: 1r9u0 - View Document