Incremental spectral clustering by efficiently updating the eigen-system

First Page		Document Content
Date: 2010-07-25 04:16:40 Algebra Linear algebra Mathematics Numerical linear algebra Matrix theory Algebraic graph theory Matrices Spectral clustering Eigenvalues and eigenvectors Graph partition Eigendecomposition of a matrix Laplacian matrix		Incremental spectral clustering by efficiently updating the eigen-system Add to Reading List Source URL: www.ifp.illinois.edu Download Document from Source Website File Size: 655,13 KB Share Document on Facebook

	Spectral clustering is a well-known way to partition a graph or network into clusters or communities with provable guarantees on the quality of the clusters. This guarantee is known as the Cheeger inequality and it holds DocID: 1rFa4 - View Document
	A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken DocID: 1rpJU - View Document
	Spectral graph theory and its applications Daniel A. Spielman Spectral graph theory—the study of the eigenvectors and eigenvalues of matrices associated with graphs—is a large field with many beautiful results. Most DocID: 1r9xi - View Document
	Aydın Buluc¸ C ONTACT I NFORMATION Lawrence Berkeley National Laboratory. Mailstop 59R4104 DocID: 1r6qI - View Document
	Sparse Matrix-Matrix Multiplication: Applications, Algorithms, and Implementations Organizers: Grey Ballard and Alex Druinsky SIAM Conference on Applied Linear Algebra October 26, 2015 DocID: 1r1mf - View Document