SVMlight Algorithm
Jump to navigation
Jump to search
An SVMlight Algorithm is a SVM Algorithm managed by Thorsten Joachims.
- Context:
- SVMstruct: SVM learning for multivariate and structured outputs like trees, sequences, and sets (available here).
- SVMperf: New training algorithm for linear classification SVMs that can be much faster than SVMlight for large datasets. It also lets you directly optimize multivariate performance measures like F1-Score, ROC-Area, and the Precision/Recall Break-Even Point. (available here).
- SVMrank: N
- See: libsvm Algorithm, TinySVM Algorithm.
References
2009
- http://svmlight.joachims.org/
- SVMlight is an implementation of Support Vector Machines (SVMs) in C. The main features of the program are the following:
- fast optimization algorithm
- working set selection based on steepest feasible descent
- "shrinking" heuristic
- caching of kernel evaluations
- use of folding in the linear case
- …
- fast optimization algorithm
- SVMlight is an implementation of Support Vector Machines (SVMs) in C. The main features of the program are the following:
2002
- (Joachims, 2002) ⇒ Thorsten Joachims. (2002). “Learning to Classify Text Using Support Vector Machines: Methods, Theory, and Algorithms." Dissertation, Kluwer. ISBN:0-7923-7679-X
1999
- (Joachims, 1999) ⇒ Thorsten Joachims. (1999). “Making large-Scale SVM Learning Practical.” In: Advances in Kernel Methods - Support Vector Learning, Bernhard Schölkopf and C. Burges and Alexander J. Smola (ed.), MIT-Press.