{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:28:36Z","timestamp":1777645716270,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-4","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>In this paper, we present the newest version of the MLEM2 algorithm\n\t\t\t for rule induction, a basic component of the LERS data mining system. This\n\t\t\t version of the MLEM2 algorithm is based on local lower and upper\n\t\t\t approximations, and in its current formis presented in this paper for the first\n\t\t\t time. Additionally, we present results of experiments comparing the local\n\t\t\t version of the MLEM2 algorithm for rule induction with an older version of\n\t\t\t MLEM2, which was based on global lower and upper approximations. Our\n\t\t\t experiments show that the local version of MLEM2 is significantly better than\n\t\t\t the global version of MLEM2 (2% significance level, two-tailed Wilcoxon test).<\/jats:p>","DOI":"10.3233\/fi-2010-265","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:09:01Z","timestamp":1575328141000},"page":"99-116","source":"Crossref","is-referenced-by-count":26,"title":["A Local Version of the MLEM2 Algorithm for Rule Induction"],"prefix":"10.1177","volume":"100","author":[{"given":"Jerzy W.","family":"Grzymala-Busse","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer\r\t\t\t Science, University of Kansas Lawrence, KS 66045, USA and Institute of Computer\r\t\t\t Science, Polish Academy of Sciences, 01\u2013237 Warsaw, Poland.\r\t\t\t E-mail: jerzy@eecs.ukans.edu"}]},{"given":"Wojciech","family":"Rzasa","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Rzeszow,\r\t\t\t 35\u2013310 Rzeszow, Poland. E-mail: wrzasa@univ.rzeszow.pl"}]}],"member":"179","published-online":{"date-parts":[[2010,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2010-265","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2010-265","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:33:04Z","timestamp":1777444384000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2010-265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":0,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.3233\/FI-2010-265"],"URL":"https:\/\/doi.org\/10.3233\/fi-2010-265","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}