S.S. Keerthi, S.K. Shevade, C. Bhattacharyya, K.R.K. Murthy  Home/Search
Context Related
| nus.edu.sg/~mpessk/npa_tr.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: svm.first.gmd.de/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we give a new, fast iterative algorithm for support vector machine (SVM) classifier design. The basic problem treated is one that does not allow classification violations. The problem is converted to a problem of computing the nearest point between two convex polytopes. The suitability of two classical nearest point algorithms, due to Gilbert, and Mitchell, Dem'yanov and Malozemov, is studied. Ideas from both these algorithms are combined and modified to derive our fast algorithm. ... (Update)
Cited by: More
The Maximum-Margin Approach to Learning Text Classifiers -.. - Joachims (2000) (Correct)
Journal of Machine Learning Research 7 (2006) 1437--1466 .. - Tobias Glasmachers.. (Correct)
S eparateurs a Vaste Marge - Optimisant La Fonction (Correct)
Active bibliography (related documents): More All
4.4: A Fast Iterative Nearest Point Algorithm for.. - Keerthi, Shevade, .. (1999) (Correct)
0.4: Improvements to Platt's SMO Algorithm for SVM.. - Keerthi, Shevade.. (1999) (Correct)
0.3: The Relaxed Online Maximum Margin Algorithm - Li, Long (2000) (Correct)
Similar documents based on text: More All
0.9: Efficient SVM Regression Training with SMO - Flake, Lawrence (2001) (Correct)
0.6: Algorithms for the Optimal Loading of Recursive Neural.. - Chandru, Dattasharma.. (1995) (Correct)
0.6: Concept Network: A Structure for Context Sensitive.. - Murthy, Keerthi, Murthy (2000) (Correct)
Related documents from co-citation: More All
11: Statistical Learning Theory (context) - Vapnik
11: The Nature of Statistical Learning Theory (context) - Vapnik - 1995
10: Fast training of support vector machines using sequential minimal optimization (context) - Platt - 1998
BibTeX entry: (Update)
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (1999). A fast iterative nearest point algorithm for support vector machine classifier design (Technical Report TR-ISL-99-03). Intelligent Systems Labs, Department of Computer Science and Automation, Indian Institute of Science, Bangalor, India. http://citeseer.ist.psu.edu/article/keerthi99fast.html More
@article{ keerthi00fast,
author = "S. S. Keerthi and S. K. Shevade and C. Bhattacharyya and K. R. K. Murthy",
title = "A Fast Iterative Nearest Point Algorithm for Support Vector Machine Classifier Design",
journal = "IEEE-NN",
volume = "11",
number = "1",
month = "January",
pages = "124",
year = "2000",
url = "citeseer.ist.psu.edu/article/keerthi99fast.html" }
Citations (may not include all citations):1291 The Nature of Statistical Learning Theory (context) - Vapnik - 1995
686 Practical Methods of Optimizations (context) - Fletcher - 1987
524 Support Vector Networks - Cortes, Vapnik - 1995
431 A tutorial on support vector machines for pattern recognitio.. - Burges - 1998
203 Solving least squares problems (context) - Lawson, Hanson - 1974
191 Fast training of support vector machines using sequential mi.. (context) - Platt - 1998
124 Robust linear programming discrimination of two linearly ins.. - Bennett, Mangasarian - 1992
109 A fast procedure for computing the distance between complex .. (context) - Gilbert, Johnson et al. - 1988
102 A tutorial on support vector regression - Smola, Scholkopf - 1998
57 Making large-scale support vector machine learning practical - Joachims - 1998
25 Solving the quadratic programming problem arising in support.. (context) - Kaufman - 1998
25 Successive overrelaxation for support vector machines - Mangasarian, Musicant - 1998
25 Convex sets and their applications (context) - Lay - 1982
16 The kernel adatron algorithm: a fast and simple learning pro.. - Friess, Cristianini et al. - 1998
6 Finding the nearest point in a polytope (context) - Wolfe - 1976
5 On fast computation of distance between line segments (context) - Lumelsky - 1985
5 Computation of certain measures of proximity between convex .. (context) - Sancheti, Keerthi - 1992
3 Minimizing the quadratic form on a convex set (context) - Gilbert - 1966
3 Support vector networks: The kernel adatron with bias and so.. (context) - Friess - 1998
2 Finding the point of a polyhedron closest to the origin (context) - Mitchell, Dem'yanov et al. - 1974
2 neural-bench/bench/two-spirals-v (context) - Data, ftp et al.
2 An efficient computational procedure for a generalized quadr.. (context) - Barr - 1969
2 machine-learning-databases/breast-cancer-wisconsin (context) - Cancer, ftp
2 Adult and Web Datasets (context) - Platt
2 Rennselaer Polytechnic Institute (context) - Bennett, Bredensteiner et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://svm.first.gmd.de/publications.html): More
Dynamically Adapting Kernels in Support Vector Machines - Cristianini, Campbell.. (1998) (Correct)
Generalization Bounds and Learning Rates for.. - Smola, Williamson.. (1998) (Correct)
Multiplicative Updatings for Support-Vector Learning - Cristianini, Campbell.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC