{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T12:10:02Z","timestamp":1752149402333,"version":"3.41.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1023\/a:1017980905332","type":"journal-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T09:36:44Z","timestamp":1041241004000},"page":"235-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Construction of Regression Trees with Range and Region Splitting"],"prefix":"10.1007","volume":"45","author":[{"given":"Yasuhiko","family":"Morimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiromu","family":"Ishii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinichi","family":"Morishita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"358702_CR1","unstructured":"Asano, T., Chen, D., Katoh, N., & Tokuyama, T. (1996). Polynomial-time solutions to image segmentations. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (pp. 104\u2013113)."},{"key":"358702_CR2","unstructured":"Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984). Classification and Regression Trees. Wadsworth."},{"key":"358702_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1022607123649","volume":"19","author":"C. E. Brodley","year":"1995","unstructured":"Brodley, C. E. & Utgoff, P. E. (1995). Multivariate decision trees. Machine Learning, 19, 45\u201377.","journal-title":"Machine Learning"},{"key":"358702_CR4","doi-asserted-by":"crossref","unstructured":"Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1996). Data mining using two-dimensional optimized association rules: Scheme, algorithms, and visualization. In Proceedings of the ACM SIGMOD Conference on Management of Data (pp. 13\u201323).","DOI":"10.1145\/233269.233313"},{"key":"358702_CR5","volume-title":"Computer and Intractability. A Guide to NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. & Johnson, D. S. (1979). Computer and Intractability. A Guide to NP-Completeness. San Francisco, CA: W. H. Freeman."},{"key":"358702_CR6","unstructured":"Gehrke, J. E., Ramakrishnan, R., & Ganti, V. (1998). RainForest\u2014A framework for fast decision tree construction of large datasets. In Proceedings of the International Conference on Very Large Data Bases (pp. 416\u2013427)."},{"key":"358702_CR7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"Hyafil, L. & Rivest, R. L. (1976). Constructing optimal binary decision trees is np-complete. Information Processing Letters, 5, 15\u201317.","journal-title":"Information Processing Letters"},{"key":"358702_CR8","unstructured":"Ittner, A. & Schlosser, M. (1996). Non-linear decision trees\u2014NDT. In Proceedings of the International Conference on Machine Learning (pp. 252\u2013258)."},{"key":"358702_CR9","doi-asserted-by":"crossref","unstructured":"Lubinsky, D. (1996). Tree structured interpretable regression. Learning from Data: AI and Statistics V (pp. 387\u2013398).","DOI":"10.1007\/978-1-4612-2404-4_37"},{"key":"358702_CR10","first-page":"18","volume-title":"Proceedings of the International Conference on Extending Database Technology","author":"M. Mehta","year":"1996","unstructured":"Mehta, M., Agrawal, R., & Rissanen, J. (1996). SLIQ: A fast scalable classifier for data mining. In Proceedings of the International Conference on Extending Database Technology (Vol. 1057, pp. 18\u201332). Berlin: Springer."},{"key":"358702_CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1022604100933","volume":"4","author":"J. Mingers","year":"1989","unstructured":"Mingers, J. (1989). An empirical comparison of pruning methods for decision tree induction. Machine Learning, 4, 227\u2013243.","journal-title":"Machine Learning"},{"issue":"3\/4","key":"358702_CR12","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1023\/A:1009755828992","volume":"2","author":"Y. Morimoto","year":"1997","unstructured":"Morimoto, Y., Fukuda, T., Morishita, S., & Tokuyama, T. (1997). Implementation and evaluation of decision trees with range and region splitting. Constraints, an International Journal, 2(3\/4), 401\u2013427.","journal-title":"Constraints, an International Journal"},{"key":"358702_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.63","volume":"2","author":"S. K. Murthy","year":"1994","unstructured":"Murthy, S. K., Kasif, S., & Salzberg, S. (1994). A system for induction of oblique decision trees. Journal of Artificial Intelligence Research, 2, 1\u201332.","journal-title":"Journal of Artificial Intelligence Research"},{"volume-title":"Knowledge Discovery in Databases","year":"1991","key":"358702_CR14","unstructured":"Piatetsky-Shapiro, G. & Frawley, W. J. (Eds.) (1991). Knowledge Discovery in Databases. Menlo Park, CA: AAAI Press."},{"key":"358702_CR15","volume-title":"C4.5: Programs for Machine Learning","author":"J. R. Quinlan","year":"1993","unstructured":"Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann."},{"key":"358702_CR16","unstructured":"Shafer, J. C., Agrawal, R., & Mehta, M. (1996). SPRINT: A scalable parallel classifier for data mining. In Proceedings of the International Conference on Very Large Data Bases (pp. 544\u2013555)."},{"key":"358702_CR17","unstructured":"Yoda, K., Fukuda, T., Morimoto, Y., Morishita, S., & Tokuyama, T. (1997). Computing optimized rectilinear regions for association rules. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (pp. 96\u2013103)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017980905332.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1017980905332\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017980905332.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:40:48Z","timestamp":1752147648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1017980905332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["358702"],"URL":"https:\/\/doi.org\/10.1023\/a:1017980905332","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2001,12]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}