Tracking Drifting Concepts Using Random Examples
- 1 January 1991
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Semantic complexity of classes of relational queries and query independent data partitioningPublished by Association for Computing Machinery (ACM) ,1991
- Prediction-preserving reducibilityJournal of Computer and System Sciences, 1990
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- A general lower bound on the number of examples needed for learningInformation and Computation, 1989
- Inductive Principles of the Search for Empirical Dependences (Methods Based on Weak Convergence of Probability Measures)Published by Elsevier ,1989
- A theory of the learnableCommunications of the ACM, 1984
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971