DocumentCode :
2454637
Title :
Incremental Nyström Low-Rank Decomposition for Dynamic Learning
Author :
Zhang, Lin ; Li, Hongyu
Author_Institution :
Sch. of Software Eng., Tongji University, Shanghai, China
fYear :
2010
fDate :
12-14 Dec. 2010
Firstpage :
561
Lastpage :
566
Abstract :
Eigen-decomposition is a key step in spectral clustering and some kernel methods. The Nyström method is often used to speed up kernel matrix decomposition. However, it cannot effectively update eigenvectors of matrices when datasets dynamically increase with time. In this paper, we propose an incremental Nyström method for dynamic learning. Experimental results demonstrate the feasibility and effectiveness of the proposed method.
Keywords :
eigenvalues and eigenfunctions; learning (artificial intelligence); matrix decomposition; pattern clustering; dynamic learning; eigen decomposition; eigenvector; incremental Nyström low rank decomposition; matrix decomposition; spectral clustering; Approximation algorithms; Approximation methods; Eigenvalues and eigenfunctions; Kernel; Machine learning; Matrix decomposition; Symmetric matrices; Dynamic Learning; Kernel Method; Matrix Decomposition; Nyström;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning and Applications (ICMLA), 2010 Ninth International Conference on
Conference_Location :
Washington, DC
Print_ISBN :
978-1-4244-9211-4
Type :
conf
DOI :
10.1109/ICMLA.2010.87
Filename :
5708886
Link To Document :
بازگشت