Learning SVMs from sloppily labeled data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5768 LNCS, Issue PART 1, 2009, Pages 884-893

  Stempfel, Guillaume ^a   Ralaivola, Liva ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CLASSIFICATION; LABELED DATA; NONCONVEX; SVM ALGORITHM; UNLABELED DATA;

BACKPROPAGATION; EDUCATION; LABELS; NEURAL NETWORKS; SUPPORT VECTOR MACHINES;

LEARNING ALGORITHMS;

EID: 70350610827     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04274-4_91     Document Type: Conference Paper

References (6)

1. Bartlett, P.L., Mendelson, S.: Rademacher and gaussian complexities: Risk bounds and structural results. J. of Machine Learning Research 3, 463-482 (2002)
2. Blum, A., Mitchell, T.: Combining Labeled and Unlabeled Data with Co-Training. In: Proc. of the 11th Conf. on Computational Learning Theory, pp. 92-100 (1998)
3. Chapelle, O.: Training a support vector machine in the primal. Neural Comput. 19(5), 1155-1178 (2007)
4. Magnan, C.: Asymmetrical Semi-Supervised Learning and Prediction of Disulfide Connectivity in Proteins. RIA, New Methods in Machine Learning: Theory and applications 20(6), 673-695 (2006)
5. McDiarmid, C.: On the method of bounded differences. In: Survey in Combinatorics, pp. 148-188 (1989)
6. Schölkopf, B., Smola, A.J.: Learning with Kernels, Support Vector Machines, Regularization, Optimization and Beyond. MIT University Press, Cambridge (2002)