{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:30:26Z","timestamp":1742394626377,"version":"3.30.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0304-3975(00)00274-7","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"323-349","source":"Crossref","is-referenced-by-count":19,"title":["Predictive learning models for concept drift"],"prefix":"10.1016","volume":"268","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanne","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00274-7_BIB1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00274-7_BIB2","doi-asserted-by":"crossref","unstructured":"P. Bartlett, S. Ben-David, S. Kulkarni, Learning changing concepts by exploiting the structure of change, Proc. 9th Annual Conf. Computational Learning Theory, Desenzano del Garda, Italy, ACM Press, New York, July 1966, pp. 131\u2013139.","DOI":"10.1145\/238061.238080"},{"key":"10.1016\/S0304-3975(00)00274-7_BIB3","series-title":"Learning switching concepts, Proc. 5th Annual Workshop on Computational Learning Theory, Pittsburgh, Pennsylvania","first-page":"231","author":"Blum","year":"1992"},{"key":"10.1016\/S0304-3975(00)00274-7_BIB4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00274-7_BIB5","unstructured":"M. Devaney, A. Ram, Dynamically adjusting concepts to accommodate changing contexts, Proceedings of AAAI (1995) 1441."},{"key":"10.1016\/S0304-3975(00)00274-7_BIB6","first-page":"94","article-title":"Learning under persistent drift","volume":"Vol. 1208","author":"Freund","year":"1997"},{"issue":"2","key":"10.1016\/S0304-3975(00)00274-7_BIB7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1006\/inco.1994.1084","article-title":"Approximate inference and scientific method","volume":"114","author":"Fulk","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00274-7_BIB8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00993161","article-title":"Tracking drifting concepts by minimizing disagreements","volume":"14","author":"Helmbold","year":"1994","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(00)00274-7_BIB9","first-page":"316","article-title":"Robust learning with infinite additional information","volume":"Vol. 1208","author":"Kaufmann","year":"1997"},{"key":"10.1016\/S0304-3975(00)00274-7_BIB10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0890-5401(91)90011-P","article-title":"One-sided error probabilistic inductive inference and reliable frequency identification","volume":"92","author":"Kinber","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00274-7_BIB11","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1080\/01969729208927471","article-title":"A machine learning based approach to load balancing in computer networks","volume":"23","author":"Kubat","year":"1992","journal-title":"Cybernet. Systems"},{"key":"10.1016\/S0304-3975(00)00274-7_BIB12","unstructured":"N. Littlestone, Mistake bounds and Logarithmic linear-threshold learning algorithms, Ph.D. Thesis, University of California, Santa Cruz, 1989."},{"year":"1997","series-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"Li","key":"10.1016\/S0304-3975(00)00274-7_BIB13"},{"key":"10.1016\/S0304-3975(00)00274-7_BIB14","unstructured":"H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967; Reprinted MIT Press, New York, 1987."},{"key":"10.1016\/S0304-3975(00)00274-7_BIB15","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/S0019-9958(86)80002-X","article-title":"Inductive inference of approximations","volume":"70","author":"Royer","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(00)00274-7_BIB16","series-title":"Zuf\u00e4lligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0112458","author":"Schnorr","year":"1971"},{"key":"10.1016\/S0304-3975(00)00274-7_BIB17","first-page":"259","article-title":"Pattern inference","volume":"Vol. 961","author":"Shinohara","year":"1995"},{"year":"1961","series-title":"Advanced Calculus","author":"Widder","key":"10.1016\/S0304-3975(00)00274-7_BIB18"},{"year":"1994","series-title":"Concept Formation and Knowledge Revision","author":"Wrobel","key":"10.1016\/S0304-3975(00)00274-7_BIB19"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002747?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002747?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T17:12:38Z","timestamp":1733332358000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002747"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0304397500002747"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00274-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}