{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:25:26Z","timestamp":1725740726273},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642397110"},{"type":"electronic","value":"9783642397127"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39712-7_36","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T08:55:48Z","timestamp":1373532948000},"page":"466-480","source":"Crossref","is-referenced-by-count":0,"title":["When Classification becomes a Problem: Using Branch-and-Bound to Improve Classification Efficiency"],"prefix":"10.1007","author":[{"given":"Armand","family":"Prieditis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moontae","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Moore, A.: K-Means and Hierchical Clustering (2001), tutorial at \n                  \n                    http:\/\/www.autonlab.org\/tutorials\/kmeans11.pdf"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society. Series B (Methodological), 1\u201338 (1977)","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"issue":"1-3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF00993063","volume":"12","author":"A.E. Prieditis","year":"1993","unstructured":"Prieditis, A.E.: Machine discovery of effective admissible heuristics. Machine Learning\u00a012(1-3), 117\u2013141 (1993)","journal-title":"Machine Learning"},{"key":"36_CR4","unstructured":"Nowozin, S.: Improved information gain estimates for decision tree induction. arXiv preprint arXiv:1206.4620 (2012)"},{"issue":"3","key":"36_CR5","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica\u00a028(3), 497\u2013520 (1960)","journal-title":"Econometrica"},{"key":"36_CR6","unstructured":"Nilsson, N.: Principles of Artificial Intelligence. Tioga Publishing Company (1980)"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. Korf","year":"1985","unstructured":"Korf, R.: Depth-first Iterative-Deepening: An Optimal Admissible Tree Search. Artificial Intelligence\u00a027, 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"key":"36_CR8","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann (2006)"},{"issue":"9","key":"36_CR9","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"key":"36_CR10","unstructured":"Moore, A.: Very Fast EM-based Mixture Model Clustering Using Multiresolution kd-trees. In: Advances in Neural Information Processing Systems. Morgan Kaufmann (1999)"},{"key":"36_CR11","unstructured":"Moore, A., Schneider, J., et al.: Efficient Locally Weighted Polynomial Regression Predictions. In: Fourteenth International Conference on Machine Learning. Morgan Kaufmann (1997)"},{"key":"36_CR12","first-page":"361","volume":"5","author":"D.D. Lewis","year":"2004","unstructured":"Lewis, D.D., Yang, Y., Rose, T., Li, F.: A New Benchmark Collection for Text Categorization Research. Journal of Machine Learning Research\u00a05, 361\u2013397 (2004), \n                  \n                    http:\/\/www.jmlr.org\/papers\/volume5\/lewis04a\/lewis04a.pdf","journal-title":"Journal of Machine Learning Research"},{"key":"36_CR13","unstructured":"Gene Ontology dataset, \n                  \n                    http:\/\/www.geneontology.org\/"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39712-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:21:06Z","timestamp":1557944466000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39712-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642397110","9783642397127"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39712-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}