{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:04:35Z","timestamp":1747544675276},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410669"},{"type":"electronic","value":"9783540453727"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45372-5_35","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T03:21:49Z","timestamp":1186888909000},"page":"345-352","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Genetic Algorithm-Based Solution for the Problem of Small Disjuncts"],"prefix":"10.1007","author":[{"given":"Deborah R.","family":"Carvalho","sequence":"first","affiliation":[]},{"given":"Alex A.","family":"Freitas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"35_CR1","unstructured":"CARVALHO, D.R. and FREITAS, A.A. A hybrid decision tree\/genetic algorithm for coping with the problem of small disjuncts in data mining. To appear in Proc. 2000 Genetic and Evolutionary Computation Conf. (GECCO-2000). Las Vegas, NV, USA. July 2000."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"COVER, T.M., THOMAS, J.A. (1991) Elements of Information Theory. John Wiley & Sons.","DOI":"10.1002\/0471200611"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"DANYLUK, A., P. and PROVOST, F.,J. (1993). Small Disjuncts in Action: Learning to Diagnose Errors in the Local Loop of the Telephone Network, Proc. 10th International Conference Machine Learning, 81\u201388.","DOI":"10.1016\/B978-1-55860-307-3.50017-4"},{"key":"35_CR4","unstructured":"FREITAS, A.A. (2000) Evolutionary Algorithms. Chapter of forthcoming Handbook of Data Mining and Knowledge Discovery. Oxford University Press, 2000."},{"key":"35_CR5","unstructured":"FREITAS, A.A. and LAVINGTON, S.H. (1998) Mining Very Large Databases with Parallel Processing. Kluwer."},{"key":"35_CR6","unstructured":"HAND, D.J.(1997) Construction and Assessment of Classification Rules. John Wiley & Sons"},{"key":"35_CR7","unstructured":"HOLTE, R.C.; ACKER, L.E. and PORTER, B.W. (1989). Concept Learning and the Problem of Small Disjuncts, Proc. IJCAI-89, 813\u2013818."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"MICHALEWICZ, Z. (1996) Genetic Algorithms + Data Structures = Evolution Programs. 3rd Ed. Springer-Verlag.","DOI":"10.1007\/978-3-662-03315-9"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"NAZAR, K. and BRAMER, M.A. (1999) Estimating concept difficulty with cross entropy. In: Bramer, M.A. (Ed.) Knowledge Discovery and Data Mining, 3\u201331. London: IEE.","DOI":"10.1049\/PBPC001E_ch1"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"NODA, E.; LOPES, H.S.; FREITAS, A.A. (1999) Discovering interesting prediction rules with a genetic algorithm. Proc. Congress on Evolutionary Comput. (CEC-99), 1322\u20131329","DOI":"10.1109\/CEC.1999.782601"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"PROVOST, F. and ARONIS, J.M. (1996). Scaling up inductive learning with massive parallelism. Machine Learning\n                           vn23 (1), Apr. 1996, 33\u201346.","DOI":"10.1007\/BF00116898"},{"key":"35_CR12","unstructured":"QUINLAN, J.R. (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann."},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1111\/j.1467-8640.1990.tb00298.x","volume":"6","author":"L. Rendell","year":"1990","unstructured":"RENDELL, L. and SESHU, R. (1990) Learning hard concepts through constructive induction: framework and rationale. Computational Intelligence 6, 247\u2013270.","journal-title":"Computational Intelligence"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45372-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:22:07Z","timestamp":1558261327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45372-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410669","9783540453727"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45372-5_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 July 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}