{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T13:39:54Z","timestamp":1712324394630},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3886,"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":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00179-2","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T14:53:32Z","timestamp":1042815212000},"page":"417-430","source":"Crossref","is-referenced-by-count":29,"title":["Iterative Bayes"],"prefix":"10.1016","volume":"292","author":[{"given":"Jo\u00e3o","family":"Gama","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00179-2_BIB1","doi-asserted-by":"crossref","unstructured":"C. Blake, E. Keogh, C. Merz, UCI repository of Machine Learning databases, 1999, URL http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html.","DOI":"10.1023\/A:1007507221352"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF00994660","article-title":"Multivariate decision trees","volume":"19","author":"Brodley","year":"1995","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1007413511361","article-title":"On the optimality of the simple Bayesian classifier under zero-one loss","volume":"29","author":"Domingos","year":"1997","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB4","series-title":"Proc. 12th Internat. Conf. on Machine Learning","article-title":"Supervised and unsupervised discretization of continuous features","author":"Dougherty","year":"1995"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB5","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB6","unstructured":"C. Elkan, Boosting and naive Bayesian learning, Technical Report CS97-557, University of California, San Diego, 1997."},{"key":"10.1016\/S0304-3975(02)00179-2_BIB7","series-title":"Advances on Artificial Intelligence-SBIA2000","article-title":"A Linear-Bayes classifier","volume":"Vol. 1952","author":"Gama","year":"2000"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB8","unstructured":"G. John, Enhancements to the data mining process, Ph.D. Thesis, Stanford University, 1997."},{"key":"10.1016\/S0304-3975(02)00179-2_BIB9","series-title":"Proc. 11th Internat. Conf. on Machine Learning","article-title":"Irrelevant features and the subset selection problem","author":"John","year":"1994"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB10","unstructured":"R. Kohavi, Scaling up the accuracy of naive Bayes classifiers: a decision tree hybrid, in: Proc. 2nd Internat. Conf. on Knowledge Discovery and Data Mining, AAAI Press, New York, 1996."},{"key":"10.1016\/S0304-3975(02)00179-2_BIB11","series-title":"Proc. 13th Internat. Conf. on Machine Learning","article-title":"Bias plus variance decomposition for zero-one loss functions","author":"Kohavi","year":"1996"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB12","series-title":"European Working Session on Learning-EWSL91","article-title":"Semi-naive Bayesian classifier","volume":"Vol. 482","author":"Kononenko","year":"1991"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB13","series-title":"Proc. European Conf. on Machine Learning","article-title":"Induction of recursive Bayesian classifiers","volume":"Vol. 667","author":"Langley","year":"1993"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB14","series-title":"Proc. 16th Internat. Conf. on Machine Learning","article-title":"Tractable average-case analysis of naive Bayesian classifiers","author":"Langley","year":"1999"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB15","series-title":"Feature Selection for Knowledge Discovery and Data Mining","author":"Liu","year":"1998"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB16","series-title":"Machine Learning, Neural and Statistical Classification","author":"Michie","year":"1994"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB17","series-title":"Machine Learning","author":"Mitchell","year":"1997"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1007692713085","article-title":"Text classification from labeled and unlabeled documents using EM","volume":"39","author":"Nigam","year":"2000","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB19","unstructured":"M. Pazzani, Constructive induction of Cartesian product attributes, in: Proc. Conf. ISIS96: Information, Statistics and Induction in Science, World Scientific, Singapore, 1996, pp. 66\u201377."},{"key":"10.1016\/S0304-3975(02)00179-2_BIB20","series-title":"Proc. Fourth Internat. Conf. on Knowledge Discovery and Data Mining","article-title":"Interpretable boosted naive bayes classification","author":"Ridgeway","year":"1998"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB21","series-title":"Pattern Recognition and Neural Networks","author":"Ripley","year":"1996"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB22","series-title":"Proc. 14th Internat. Conf. on Machine Learning","article-title":"Boosting the margin: a new explanation for the effectiveness of voting methods","author":"Schapire","year":"1997"},{"key":"10.1016\/S0304-3975(02)00179-2_BIB23","doi-asserted-by":"crossref","unstructured":"G. Webb, M. Pazzani, Adjusted probability naive Bayesian induction, in: Proc. 11th Australian Joint Conf. on Artificial Intelligence, World Scientific, Singapore, 1998.","DOI":"10.1007\/BFb0095060"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001792?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001792?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:58:41Z","timestamp":1555178321000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502001792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502001792"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00179-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}