{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:19Z","timestamp":1725472039063},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540464914"},{"type":"electronic","value":"9783540464938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11893318_9","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T14:14:10Z","timestamp":1160403250000},"page":"53-64","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Bayesian 2D-Discretization for Variable Ranking in Regression"],"prefix":"10.1007","author":[{"given":"Marc","family":"Boull\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carine","family":"Hue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Classification and Regression Trees","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Boull\u00e9, M.: Modl: A Bayes optimal discretization method for continuous attributes. Machine Learning (accepted for publication, 2006)","DOI":"10.1007\/s10994-006-8364-x"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017012","volume-title":"Machine Learning - EWSL-91","author":"J. Catlett","year":"1991","unstructured":"Catlett, J.: On changing continuous variables into ordered discrete variables. In: Kodratoff, Y. (ed.) EWSL 1991. LNCS, vol.\u00a0482. Springer, Heidelberg (1991)"},{"key":"9_CR4","unstructured":"Chapman, P., Clinton, J., Kerber, R., Khabaza, T., Reinartz, T., Shearer, C., Wirth, R.: Crisp-dm 1.0: step-by-step data mining guide. Applied Statistics Algorithms (2000)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Dougherty, J., Kohavi, R., Sahami, M.: Supervised and unsupervised discretization of continuous features. In: Proceedings of the 12th International Conference on Machine Learning, pp. 194\u2013202 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"9_CR6","unstructured":"Blake, C.L., Newman, D.J., Hettich, S., Merz, C.J.: UCI repository of machine learning databases (1998)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Fisher, R.A.: The use of multiple measurements in taxonomic problems. Annual Eugenics\u00a07 (1936)","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"9_CR8","unstructured":"Guyon, I., Elissef, A.: An introduction to variable and feature selection. Journal of Machine Learning Research (2003)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Holte, R.C.: Very simple classification rules perform well on most commonly used datasets. Machine Learning (1993)","DOI":"10.1023\/A:1022631118932"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Leray, Ph., Gallinari, P.: Feature selection with neural networks. Behaviormetrika (1999)","DOI":"10.2333\/bhmk.26.145"},{"key":"9_CR11","unstructured":"Liu, H., Hussain, F., Tan, C.L., Dash, M.: Discretization: An enabling technique. Data Mining and Knowledge Discovery (2002)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica (1978)","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Schwarz, G.: Estimating the dimension of a model. Annals of Statistics (1978)","DOI":"10.1214\/aos\/1176344136"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell systems technical journal (1948)","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Vitanyi, P.M.B., Li, M.: Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Trans. Inform. Theory (2000)","DOI":"10.1109\/18.825807"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11893318_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:30Z","timestamp":1605642930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11893318_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540464914","9783540464938"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11893318_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}