Using the Perceptron Algorithm to Find Consistent Hypotheses

DOI10.1017/S0963548300000778MaRDI QIDQ4290090zbMATH OpenOpenAlexFDO

Authors Martin Anthony, John Shawe-Taylor

Publication date 18 December 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300000778

zbMATH Keywords

Boolean functionlearningperceptron

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning binary perceptrons perfectly efficiently.
• Perceptron, Winnow, and PAC Learning
• Perceptron algorithms for the classification of non-separable populations
• scientific article; zbMATH DE number 822102
• LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES

Cites work

• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• Learnability and the Vapnik-Chervonenkis dimension
• Linear function neurons: Structure and training
• On Complete Sets of Logic Primitives

Cited in

(6)

• On data classification by iterative linear partitioning
• Classification by polynomial surfaces
• On specifying Boolean functions by labelled examples
• scientific article; zbMATH DE number 2044685 (Why is no real title available?)
• Statistical computational learning
• Learning binary perceptrons perfectly efficiently.

This page was built for publication: Using the Perceptron Algorithm to Find Consistent Hypotheses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290090)