{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:49:54Z","timestamp":1761058194853},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1007\/bf00993161","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T12:18:07Z","timestamp":1105273087000},"page":"27-45","source":"Crossref","is-referenced-by-count":46,"title":["Tracking drifting concepts by minimizing disagreements"],"prefix":"10.1007","volume":"14","author":[{"given":"David P.","family":"Helmbold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip M.","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"M. Anthony, N. Biggs, and J. Shawe-Taylor, (1990). The learnability of formal concepts.The 1990 Workshop on Computational Learning Theory, 246?257.","DOI":"10.1016\/B978-1-55860-146-8.50022-9"},{"issue":"2","key":"CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D. Angluin","year":"1979","unstructured":"D. Angluin and L. Valiant, (1979). Fast probabilistic algorithms for Hamiltonion circuits and matchings.Journal of Computer and System Sciences, 18(2):155?193.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"D. Aldous and U. Vazirani, (1990). A Markovian extension of Valiant's learning model.Proceedings of the 31st Annual Symposium on the Foundations of Computer Science, pages 392?396.","DOI":"10.1109\/FSCS.1990.89558"},{"issue":"4","key":"CR4","first-page":"449","volume":"E75-D","author":"N. Abe","year":"1992","unstructured":"N. Abe and O. Watanabe, (1992). Polynomially sparse variations and reducibility among prediction problems.IEICE Trans. Inf. & Syst., E75-D(4):449?458, 1992.","journal-title":"IEICE Trans. Inf. & Syst."},{"issue":"4","key":"CR5","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth, (1989). Learnability and the Vapnik-Chervonenkis dimension.JACM, 36(4):929?965.","journal-title":"JACM"},{"issue":"3","key":"CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"A. Ehrenfeucht, D. Haussler, M. Kearns, and L.G. Valiant, (1989). A general lower bound on the number of examples needed for learning.Information and Computation, 82(3):247?251.","journal-title":"Information and Computation"},{"key":"CR7","unstructured":"D. Haussler, (1991). Decision theoretic generalizations of the PAC model for neural net and other learning applications. Technical Report UCSC-CRL-91-02, University of California at Santa Cruz."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"D.P. Helmbold and P.M. Long, (1991). Tracking drifting concepts using random examples.The 1991 Workshop on Computational Learning Theory, pages 13?23.","DOI":"10.1016\/B978-1-55860-213-7.50006-7"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"D. Haussler, N. Littlestone, and M.K. Warmuth, (1988). Predicting {0, 1} functions on randomly drawn points.Proceedings of the 29th Annual Symposium on the Foundations of Computer Science, pages 100?109.","DOI":"10.1109\/SFCS.1988.21928"},{"key":"CR10","unstructured":"David Haussler, Nick Littlestone, and Manfred Warmuth, (1990). Predicting {0, 1}-functions on randomly drawn points. Technical Report UCSC-CRL-90-54, University of California Santa Cruz. To appear in Information and Computation."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"T. Hagerup and C. Rub, (1990). A guided tour of Chernov bounds.Information Processing Letters, 33:305?308.","journal-title":"Information Processing Letters"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"M. Kearns and M. Li, (1988). Learning in the presence of malicious errors.Proceedings of the 20th ACM Symposium on the Theory of Computation, pages 267?279.","DOI":"10.1145\/62212.62238"},{"key":"CR13","unstructured":"T. Kuh, T. Petsche, and R. Rivest, (1990). Learning time varying concepts. InNIPS 3. Morgan Kaufmann."},{"key":"CR14","unstructured":"T. Kuh, T. Petsche, and R. Rivest, (1991). Mistake bounds of incremental learners when concepts drift with applications to feedforward networks. InNIPS 4. Morgan Kaufmann."},{"key":"CR15","unstructured":"N. Littlestone, (1989).Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, UC Santa Cruz."},{"key":"CR16","unstructured":"P.M. Long, (1992).Towards a more comprehensive theory of learning in computers. PhD thesis, UC Santa Cruz."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"N. Littlestone and M.K. Warmuth, (1989). The weighted majority algorithm.Proceedings of the 30th Annual Symposium on the Foundations of Computer Science.","DOI":"10.1109\/SFCS.1989.63487"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"D. Pollard, (1984).Convergence of Stochastic Processes. Springer Verlag.","DOI":"10.1007\/978-1-4612-5254-2"},{"issue":"4","key":"CR19","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"L. Pitt and L.G. Valiant, (1988). Computational limitations on learning from examples.Journal of the Association for Computing Machinery, 35(4):965?984.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"L. Pitt and M.K. Warmuth, (1990). Prediction preserving reducibility.Journal of Computer and System Sciences, 41(3).","DOI":"10.1016\/0022-0000(90)90028-J"},{"issue":"11","key":"CR21","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"L.G. Valiant, (1984). A theory of the learnable.Communications of the ACM, 27(11):1134?1142.","journal-title":"Communications of the ACM"},{"key":"CR22","unstructured":"V.N. Vapnik, (1982).Estimation of Dependencies based on Empirical Data. Springer Verlag."},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"V.N. Vapnik, (1989). Inductive principles of the search for empirical dependences (methods based on weak convergence of probability measures).The 1989 Workshop on Computational Learning Theory.","DOI":"10.1016\/B978-0-08-094829-4.50004-0"},{"issue":"2","key":"CR24","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"V.N. Vapnik and A.Y. Chervonenkis, (1971). On the uniform convergence of relative frequencies of events to their probabilities.Theory of Probability and its Applications, 16(2):264?280.","journal-title":"Theory of Probability and its Applications"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993161.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00993161\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:58:41Z","timestamp":1556564321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00993161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF00993161"],"URL":"https:\/\/doi.org\/10.1007\/bf00993161","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}