Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19576
Title: Kernel density estimation, kernel methods, and fast learning in large data sets
Authors: Wang, S
Wang, J
Chung, FL 
Keywords: Kernel density estimate (KDE)
Kernel methods
Quadratic programming (QP)
Sampling
Support vector machine (SVM)
Issue Date: 2014
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on cybernetics, 2014, v. 44, no. 1, 6542693, p. 1-20 How to cite?
Journal: IEEE transactions on cybernetics 
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.
URI: http://hdl.handle.net/10397/19576
ISSN: 2168-2267
EISSN: 2168-2275
DOI: 10.1109/TSMCB.2012.2236828
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

18
Last Week
0
Last month
1
Citations as of Oct 9, 2017

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
0
Citations as of Oct 15, 2017

Page view(s)

38
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.