Learning Kernel Perceptrons on Noisy Data Using Random Projections
From MaRDI portal
Recommendations
- An algorithmic theory of learning: robust concepts and random projection
- A polynomial-time algorithm for learning noisy linear threshold functions
- Can PAC learning algorithms tolerate random attribute noise?
- Noise tolerant variants of the perceptron algorithm
- An algorithmic theory of learning: Robust concepts and random projection
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- A polynomial-time algorithm for learning noisy linear threshold functions
- Algorithmic Learning Theory
- An introduction to support vector machines and other kernel-based learning methods.
- Large margin classification using the perceptron algorithm
- Learning in the Presence of Malicious Errors
- On the Generalization Ability of On-Line Learning Algorithms
- Soft margins for AdaBoost
- The Perceptron: A Model for Brain Functioning. I
Cited in
(7)- Unconfused ultraconservative multiclass algorithms
- scientific article; zbMATH DE number 6982911 (Why is no real title available?)
- Classification in the presence of class noise using a probabilistic kernel Fisher method
- Infinite max-margin factor analysis via data augmentation
- Learning kernel logistic regression in the presence of class label noise
- Learning from binary labels with instance-dependent noise
- Breaking the waves: asymmetric random periodic features for low-bitrate kernel machines
This page was built for publication: Learning Kernel Perceptrons on Noisy Data Using Random Projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520070)
