Combinatorics and connectionism

DOI10.1016/0012-365X(92)00048-VMaRDI QIDQ1313821zbMATH OpenOpenAlexFDO

Authors Norman L. Biggs

Publication date 31 October 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)00048-v

zbMATH Keywords

learningVapnik-Chervonenkis dimensionhuman brainconnectionismcognitive functions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cognitive psychology (91E10)

Recommendations

• Connectionist networks qua graphs
• scientific article; zbMATH DE number 8767
• scientific article; zbMATH DE number 1028240
• Results on learnability and the Vapnik-Chervonenkis dimension
• scientific article; zbMATH DE number 53984

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• scientific article; zbMATH DE number 67626 (Why is no real title available?)
• scientific article; zbMATH DE number 3314813 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• A combinatorial problem; stability and order for models and theories in infinitary languages
• A theory of the learnable
• Bounding sample size with the Vapnik-Chervonenkis dimension
• Computational limitations on learning from examples
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Learnability and the Vapnik-Chervonenkis dimension
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the density of families of sets
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Randomised algorithms
• Some special Vapnik-Chervonenkis classes
• -nets and simplex range queries

Cited in

(2)

• Geiringer theorems: from population genetics to computational intelligence, memory evolutive systems and Hebbian learning
• A result of Vapnik with applications

This page was built for publication: Combinatorics and connectionism

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