The learnability of formal concepts

Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990

Volumn , Issue , 1990, Pages 246-257

  Anthony, Martin ^a   Biggs, Norman ^a   Shawe Taylor, John ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84967907292     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/b978-1-55860-146-8.50022-9     Document Type: Conference Paper

References (15)

1. Martin Anthony Norman Biggs John Shawe-Taylor Learnability and formal concept analysis 1990 Department of Computer Science, Royal Holloway and Bedford New College (University of London) Technical Report CSD-TR-624
2. Gyora M. Benedek and Alon Itai, Learnability by fixed distributions, Proceedings of the First Workshop on Computational Learning Theory , Morgan Kaufman, San Mateo, CA, 1988.
3. Shai Ben-David, Gyora M. Benedek and Yishay Mansour, A parameterization scheme for classifying models of learnability, Proceedings of the Second Workshop on Computational Learning Theory , Morgan Kaufman, San Mateo, CA, 1989.
4. Anselm Blumer Andrzej Ehrenfeucht David Haussler K. Manfred Warmuth Learnability and the Vapnik-Chervonenkis dimension Journal of the ACM 36 4 1989
5. D. Cohen, Contexts with predetermined VC dimension, manuscript, 1989.
6. David Haussler Quantifying inductive bias: AI learning algorithms and Valiant's learning framework Artificial Intelligence 36 1988 177 221
7. David Haussler Generalizing the PAC model for neural net and other learning applications 1989 University of California Computer Research Laboratory Santa Cruz, CA Techical Report UCSC-CRL-89–30
8. David Haussler Michael Kearns Nick Littlestone K. Manfred Warmuth Equivalence of models for polynomial learnability 1988 University of California Computer Research Laboratory Santa Cruz, CA Technical Report UCSC-CRL-88–06
9. David Haussler Emo Welzl ɛ-nets and simplex range queries Discrete Comp. Geom. 2 1987 127 151
10. David Pollard Convergence of Stochastic Processes 1984 Springer-Verlag
11. N. Sauer On the density of families of sets J. Combinatorial Theory (A) 13 1972 145 147
12. John Shawe-Taylor Martin Anthony Norman Biggs Bounding sample size with the Vapnik-Chervonenkis dimension 1989 Department of Computer Science, Royal Holloway and Bedford New College (University of London) Technical Report CSD-TR-618
13. G. Leslie Valiant A theory of the learnable Communications of the ACM 27 1984 1134 1142
14. V.N. Vapnik A.Ya. Chervonenkis On the uniform convergence of relative frequencies of events to their probabilities Theor. Prob. Appl. 16 2 1971 264 280
15. R. Wille Restructuring lattice theory: an approach based on hierarchies of concepts NATO Advanced Study Institute Series 83 1982 445 470