Learning Kernel Perceptrons on Noisy Data Using Random Projections
From MaRDI portal
Publication:3520070
DOI10.1007/978-3-540-75225-7_27zbMath1142.68408OpenAlexW1496805632MaRDI QIDQ3520070
Guillaume Stempfel, Liva Ralaivola
Publication date: 19 August 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75225-7_27
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (5)
Learning from binary labels with instance-dependent noise ⋮ Infinite max-margin factor analysis via data augmentation ⋮ Learning kernel logistic regression in the presence of class label noise ⋮ Unnamed Item ⋮ Unconfused ultraconservative multiclass algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial-time algorithm for learning noisy linear threshold functions
- Large margin classification using the perceptron algorithm
- Learning in the Presence of Malicious Errors
- The Perceptron: A Model for Brain Functioning. I
- On the Generalization Ability of On-Line Learning Algorithms
- Algorithmic Learning Theory
- Soft margins for AdaBoost
This page was built for publication: Learning Kernel Perceptrons on Noisy Data Using Random Projections
