Learnability and the Vapnik-Chervonenkis dimension.

Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth: Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36(4): 929-965(1989)

@article{DBLP:journals/jacm/BlumerEHW89,
  author    = {Anselm Blumer and
               Andrzej Ehrenfeucht and
               David Haussler and
               Manfred K. Warmuth},
  title     = {Learnability and the Vapnik-Chervonenkis dimension},
  journal   = {J. ACM},
  volume    = {36},
  number    = {4},
  year      = {1989},
  pages     = {929-965},
  ee        = {db/journals/jacm/BlumerEHW89.html, http://doi.acm.org/10.1145/76359.76371},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

Michael Benedikt, Leonid Libkin: Exact and Approximate Aggregation in Constraint Query. PODS 1999: 102-113
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuzawa, Takeshi Tokuyama, Kunikazu Yoda: Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases. VLDB 1998: 380-391
Se June Hong: Use of Contextaul Information for Feature Ranking and Discretization. IEEE Trans. Knowl. Data Eng. 9(5): 718-730(1997)
Se June Hong: R-MINI: An Iterative Approach for Generating Minimal Rules from Examples. IEEE Trans. Knowl. Data Eng. 9(5): 709-717(1997)
Xiao-Jia M. Zhou, Tharam S. Dillon: Theoretical and Practical Considerations of Uncertainty and Complexity in Automated Knowledge Acquisition. IEEE Trans. Knowl. Data Eng. 7(5): 699-712(1995)
Shaibal Roy: Semantic Complexity of Classes of Relational Queries and Query Independent Data Partitioning. PODS 1991: 259-267

BibTeX