{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:53:10Z","timestamp":1794383590404,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"value":"9780387307688","type":"print"},{"value":"9780387301648","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-387-30164-8_738","type":"book-chapter","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T12:24:25Z","timestamp":1293625465000},"page":"875-879","source":"Crossref","is-referenced-by-count":6,"title":["Rule Learning"],"prefix":"10.1007","author":[{"given":"Johannes","family":"F\u00fcrnkranz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"738_CR1_738","first-page":"147","volume-title":"Estimating probabilities: A crucial task in machine learning","author":"B Cestnik","year":"1990","unstructured":"Cestnik, B. (1990). Estimating probabilities: A crucial task in machine learning. In L. Aiello (Ed.), Proceedings of the ninth European conference on artificial intelligence (ECAI-90), Stockholm, Sweden (pp. 147\u2013150). Pitman, London."},{"key":"738_CR2_738","first-page":"151","volume-title":"Rule induction with CN2: Some recent improvements","author":"P Clark","year":"1991","unstructured":"Clark, P., & Boswell, R. (1991). Rule induction with CN2: Some recent improvements. In Proceedings of the fifth European working session on learning (EWSL-91), Porto, Portugal (pp. 151\u2013163). London: Springer."},{"issue":"4","key":"738_CR3_738","first-page":"261","volume":"3","author":"P Clark","year":"1989","unstructured":"Clark, P., & Niblett, T. (1989). The CN2 induction algorithm. Machine Learning, 3(4), 261\u2013283.","journal-title":"Machine Learning"},{"key":"738_CR4_738","first-page":"115","volume-title":"Fast effective rule induction","author":"WW Cohen","year":"1995","unstructured":"Cohen, W. W. (1995). Fast effective rule induction. In A. Prieditis & S. Russell (Eds.), Proceedings of the 12th international conference on machine learning (ML-95), Lake Tahoe, California (pp. 115\u2013123). Morgan Kaufmann, San Mateo, CA."},{"key":"738_CR5_738","first-page":"335","volume-title":"A simple, fast, and effective rule learner","author":"WW Cohen","year":"1999","unstructured":"Cohen, W. W., & Singer, Y. (1999). A simple, fast, and effective rule learner. In Proceedings of the 16th national conference on artificial intelligence (AAAI-99), Orlando (pp. 335\u2013342). Menlo Park: AAAI\/MIT Press."},{"key":"738_CR6_738","first-page":"141","volume":"24","author":"P Domingos","year":"1996","unstructured":"Domingos, P. (1996). Unifying instance-based and rule-based induction. Machine Learning, 24, 141\u2013168.","journal-title":"Machine Learning"},{"issue":"2","key":"738_CR7_738","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007329424533","volume":"27","author":"J F\u00fcrnkranz","year":"1997","unstructured":"F\u00fcrnkranz, J. (1997). Pruning algorithms for rule learning. Machine Learning, 27(2), 139\u2013171.","journal-title":"Machine Learning"},{"issue":"1","key":"738_CR8_738","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1006524209794","volume":"13","author":"J F\u00fcrnkranz","year":"February 1999","unstructured":"F\u00fcrnkranz, J. (February 1999). Separate-and-conquer rule learning. Artificial Intelligence Review, 13(1),\u00a03\u201354.","journal-title":"Artificial Intelligence Review"},{"issue":"1","key":"738_CR9_738","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10994-005-5011-x","volume":"58","author":"J F\u00fcrnkranz","year":"2005","unstructured":"F\u00fcrnkranz, J., & Flach, P. (2005). ROC \u2018n\u2019 rule learning\u00a0\u2013 Towards a better understanding of covering algorithms. Machine Learning, 58(1),\u00a039\u201377.","journal-title":"Machine Learning"},{"key":"738_CR10_738","first-page":"70","volume-title":"Incremental reduced error pruning","author":"J F\u00fcrnkranz","year":"1994","unstructured":"F\u00fcrnkranz, J., & Widmer, G. (1994). Incremental reduced error pruning. In W. Cohen & H. Hirsh (Eds.), Proceedings of the 11th international conference on machine learning (ML-94), New Brunswick, NJ (pp. 70\u201377). Morgan Kaufmann, San Mateo, CA."},{"key":"738_CR11_738","unstructured":"Liu, B., Hsu, W., & Ma, Y. (1998). Integrating classification and association rule mining. In R. Agrawal, P. Stolorz, & G. Piatetsky-Shapiro (Eds.), Proceedings of the fourth international conference on knowledge discovery and data mining (KDD-98), New York City, NY (pp. 80\u201386)."},{"key":"738_CR12_738","unstructured":"Michalski, R. S. (1969). On the quasi-minimal solution of the covering problem. In Proceedings of the fifth international symposium on information processing (FCIP-69), Bled, Yugoslavia. Switching circuits (Vol. A3, pp. 125\u2013128)."},{"key":"738_CR13_738","first-page":"239","volume":"5","author":"JR Quinlan","year":"1990","unstructured":"Quinlan, J. R. (1990). Learning logical definitions from relations. Machine Learning, 5, 239\u2013266.","journal-title":"Machine Learning"},{"key":"738_CR14_738","volume-title":"C4.5: Programs for machine learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J. R. (1993). C4.5: Programs for machine learning. San Mateo: Morgan Kaufmann."},{"key":"738_CR15_738","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","volume":"5","author":"GI Webb","year":"1995","unstructured":"Webb, G. I. (1995). OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 5, 431\u2013465.","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Encyclopedia of Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30164-8_738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T22:00:13Z","timestamp":1703196013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30164-8_738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387307688","9780387301648"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30164-8_738","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30164-8","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011]]}}}