Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Google Scholar
Right arrow Articles by Gins, G.
Right arrow Articles by Van Impe, J. F.
PubMed
Right arrow Articles by Gins, G.
Right arrow Articles by Van Impe, J. F.
(Neural Computation. 2008;20:523-554.)
© 2008 The MIT Press


Letter

Efficient Tracking of the Dominant Eigenspace of a Normalized Kernel Matrix

Geert Gins

geert.gins{at}cit.kuleuven.be Bioprocess Technology and Control, Katholieke Universiteit Leuven, W. de Croylaan 46, B-3001 Leuven, Belgium

Ilse Y. Smets

ilse.smets{at}cit.kuleuven.be Bioprocess Technology and Control, Katholieke Universiteit Leuven, W. de Croylaan 46, B-3001 Leuven, Belgium

Jan F. Van Impe

jan.vanimpe{at}cit.kuleuven.be Bioprocess Technology and Control, Katholieke Universiteit Leuven, W. de Croylaan 46, B-3001 Leuven, Belgium

Various machine learning problems rely on kernel-based methods. The power of these methods resides in the ability to solve highly nonlinear problems by reformulating them in a linear context. The dominant eigenspace of a (normalized) kernel matrix is often required. Unfortunately, the computational requirements of the existing kernel methods are such that the applicability is restricted to relatively small data sets. This letter therefore focuses on a kernel-based method for large data sets. More specifically, a numerically stable tracking algorithm for the dominant eigenspace of a normalized kernel matrix is proposed, which proceeds by an updating (the addition of a new data point) followed by a downdating (the exclusion of an old data point) of the kernel matrix. Testing the algorithm on some representative case studies reveals that a very good approximation of the dominant eigenspace is obtained, while only a minimal amount of operations and memory space per iteration step is required.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2008 by The MIT Press.