{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:39Z","timestamp":1742914059553,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319234366"},{"type":"electronic","value":"9783319234373"}],"license":[{"start":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T00:00:00Z","timestamp":1441756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T00:00:00Z","timestamp":1441756800000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-23437-3_36","type":"book-chapter","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T13:18:55Z","timestamp":1441718335000},"page":"421-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithm for Finding Zero Factor Free Rules"],"prefix":"10.1007","author":[{"given":"Grete","family":"Lind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rein","family":"Kuusik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,9]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic \u2014 CL 2000","author":"Yves Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Lloyd, J., Dahl, V., Furbach, U., Kerber, M., Lau, K.K., Palamidessi, C., Pereira, L., Sagiv, Y., Stuckey, P. (eds.) Computational Logic\u2014CL 2000, LNCS, vol. 1861, pp. 972\u2013986. Springer, Berlin (2000)"},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explor. Newsl. 2(2), 66\u201375 (2000)","journal-title":"SIGKDD Explor. Newsl."},{"key":"36_CR3","unstructured":"Chesnokov, S.: Determination-analysis of social-economic data in dialogical regime (Preprint). All-Union Institute for Systems Research, Moscow (1980)"},{"key":"36_CR4","unstructured":"Chesnokov, S.: Determinacy analysis of social-economic data. Nauka, Moscow, Russia (1982)"},{"key":"36_CR5","unstructured":"Chesnokov, S.: Determinacy analysis of socio-economic data. Illustrative materials to lectures. Lecture 2: Rules. Lecture 3: Systems of rules (2002), lomonosov Moscow State University, Faculty of Economics, Moscow, unpublished (in Russian)"},{"key":"36_CR6","unstructured":"J\u00f5giste, L.: Prototyping of Zero-factor based DA. Master\u2019s thesis, Tallinn University of Technology (2014)"},{"issue":"10","key":"36_CR7","first-page":"1458","volume":"5","author":"G Lind","year":"2008","unstructured":"Lind, G., Kuusik, R.: New developments for determinacy analysis: diclique-based approach. WSEAS Trans. Inf. Sci. Appl. 5(10), 1458\u20131469 (2008)","journal-title":"WSEAS Trans. Inf. Sci. Appl."},{"key":"36_CR8","unstructured":"Lind, G., Kuusik, R.: Some problems in determinacy analysis approaches development. In: DMIN 2008, pp. 102\u2013108. Las Vegas, Nevada (2008)"},{"key":"36_CR9","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Pruning closed itemset lattices for association rules. In: BDA 1998, pp. 177\u2013196. Hammamet, Tunisie (1998)"},{"key":"36_CR10","first-page":"463","volume-title":"Machine Learning","author":"J.Ross Quinlan","year":"1983","unstructured":"Quinlan, J.R.: Learning efficient classification procedures and their application to chess end games. In: Michalski, R., Carbonell, J., Mitchell, T. (eds.) Machine learning. An Artificial Intelligence Approach, pp. 463\u2013482. Springer, Berlin (1984)"},{"issue":"1","key":"36_CR11","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"36_CR12","unstructured":"UCI: Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml\/datasets\/Nursery"},{"key":"36_CR13","first-page":"457","volume":"2002","author":"MJ Zaki","year":"2002","unstructured":"Zaki, M.J., Hsiao, C.J.: CHARM: an efficient algorithm for closed itemset mining. SIAM 2002, 457\u2013473 (2002)","journal-title":"SIAM"}],"container-title":["Advances in Intelligent Systems and Computing","Man\u2013Machine Interactions 4"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23437-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T16:15:02Z","timestamp":1675872902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23437-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,9]]},"ISBN":["9783319234366","9783319234373"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23437-3_36","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,9,9]]},"assertion":[{"value":"9 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}