Kernel Density Estimation, Kernel Methods, and Fast Learning in Large Data Sets
- 18 June 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 44 (1) , 1-20
Abstract
Kernel methods such as the standard support vector machine and support vector regression trainings take O(N 3 ) time and O(N 2 ) space complexities in their naïve implementations, where N is the training set size. It is thus computationally infeasible in applying them to large data sets, and a replacement of the naive method for finding the quadratic programming (QP) solutions is highly desirable. By observing that many kernel methods can be linked up with kernel density estimate (KDE) which can be efficiently implemented by some approximation techniques, a new learning method called fast KDE (FastKDE) is proposed to scale up kernel methods. It is based on establishing a connection between KDE and the QP problems formulated for kernel methods using an entropy-based integrated-squared-error criterion. As a result, FastKDE approximation methods can be applied to solve these QP problems. In this paper, the latest advance in fast data reduction via KDE is exploited. With just a simple sampling strategy, the resulted FastKDE method can be used to scale up various kernel methods with a theoretical guarantee that their performance does not degrade a lot. It has a time complexity of O(m 3 ) where m is the number of the data points sampled from the training set. Experiments on different benchmarking data sets demonstrate that the proposed method has comparable performance with the state-of-art method and it is effective for a wide range of kernel methods to achieve fast learning in large data sets.Keywords
This publication has 24 references indexed in Scilit:
- FRSDE: Fast reduced set density estimator using minimal enclosing ball approximationPattern Recognition, 2008
- Generalized Core Vector MachinesIEEE Transactions on Neural Networks, 2006
- Rigorous Proof of Termination of SMO Algorithm for Support Vector MachinesIEEE Transactions on Neural Networks, 2005
- Probability density estimation from optimally condensed data samplesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
- 10.1162/15324430260185619Applied Physics Letters, 2000
- Support vector domain descriptionPattern Recognition Letters, 1999
- Weighted Parzen windows for pattern classificationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- Fast Parzen density estimation using clustering-based branch and boundIEEE Transactions on Pattern Analysis and Machine Intelligence, 1994
- Multivariate Adaptive Regression SplinesThe Annals of Statistics, 1991
- Kernel density estimation with binned dataCommunications in Statistics - Theory and Methods, 1985