Please use this identifier to cite or link to this item:
|Title:||A fast dual algorithm for kernel logistic regression|
|Citation:||Keerthi, S.S., Duan, K.B., Shevade, S.K., Poo, A.N. (2005-11). A fast dual algorithm for kernel logistic regression. Machine Learning 61 (1-3) : 151-165. ScholarBank@NUS Repository. https://doi.org/10.1007/s10994-005-0768-5|
|Abstract:||This paper gives a new iterative algorithm for kernel logistic regression. It is based on the solution of a dual problem using ideas similar to those of the Sequential Minimal Optimization algorithm for Support Vector Machines. Asymptotic convergence of the algorithm is proved. Computational experiments show that the algorithm is robust and fast. The algorithmic ideas can also be used to give a fast dual algorithm for solving the optimization problem arising in the inner loop of Gaussian Process classifiers.|
|Source Title:||Machine Learning|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 14, 2018
WEB OF SCIENCETM
checked on Nov 6, 2018
checked on Oct 13, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.