Knebel T, Hochreiter S, Obermayer K. (2008). An SMO algorithm for the potential support vector machine. Neural computation. 20 [PubMed]

See more from authors: Knebel T · Hochreiter S · Obermayer K

References and models cited by this paper

Chang CC, Lin CJ. (2001). LIBSVM: A library for Support Vector Machines Available online at: http:--www.csie.ntu.edu.tw-cjlin-libsvm.

Hochreiter S, Obermayer K. (2006). Support vector machines for dyadic data. Neural computation. 18 [PubMed]

Hoff PD. (2005). Bilinear mixed-effects models for dyadic data J Am Stat Assoc. 100

Keerthi SS, Bhattacharyya C, Shevade SK, Murthy KRK. (2001). Improvements to Platts SMO algorithm for SVM classifier design Neural Comput. 13

Keerthi SS, Shevade SK. (2003). SMO algorithm for least-squares SVM formulations. Neural computation. 15 [PubMed]

Newman D, Hettich S, Blake C, Merz C. (1998). UCI repository of machine learning databases Available online at http:--www.ics.uci.edu-mlearn-MLRepository.html.

Obermayer K, Hochreiter S. (2004). Gene selection for microarray data Kernel methods in computational biology.

Obermayer K, Hochreiter S. (2005). Nonlinear feature selection with the potential support vector machine Feature extraction, foundations and applications.

Palaniswami M, Lai D, Mani N. (2003). A new method to select working sets for faster training for support vector machines Tech Rep MESCE-30-2003 Department of Electrical and Computer Systems Engineering, Monash University.

Platt J. (1999). Fast training of support vector machines using sequential minimal optimization Advances in kernel methods: Support vector learning.

Puzicha J, Hofmann T. (1998). Unsupervised learning from dyadic data Tech. Rep. No. TR-98-042.

Scholkopf B, Smola AJ. (2001). Learning with kernels: Support vector machines, regularization, optimization, and beyond.

Vapnik V. (1998). Statistical Learning Theory.

References and models that cite this paper
This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.