{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:47:50Z","timestamp":1760708870184},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T00:00:00Z","timestamp":1437004800000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10115-015-0859-y","type":"journal-article","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T05:09:07Z","timestamp":1436936947000},"page":"571-594","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Mining exceptional relationships with grammar-guided genetic programming"],"prefix":"10.1007","volume":"47","author":[{"given":"Jose Maria","family":"Luna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mykola","family":"Pechenizkiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Ventura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"859_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of 20th International Conference on Very Large Data Bases, VLDB\u201994. Santiago de Chile, Chile, Morgan Kaufmann, pp. 487\u2013499"},{"issue":"3","key":"859_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3233\/IDA-2002-6303","volume":"6","author":"F Berzal","year":"2002","unstructured":"Berzal F, Blanco I, S\u00e1nchez D, Vila MA (2002) Measuring the accuracy and interest of association rules: a new framework. Intell Data Anal 6(3):221\u2013235","journal-title":"Intell Data Anal"},{"issue":"3","key":"859_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1132960.1132963","volume":"38","author":"L Geng","year":"2006","unstructured":"Geng L, Hamilton HJ (2006) Interestingness measures for data mining: a survey. ACM Comput Surv 38(3):9","journal-title":"ACM Comput Surv"},{"key":"859_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8:53\u201387","journal-title":"Data Min Knowl Discov"},{"key":"859_CR5","doi-asserted-by":"crossref","unstructured":"McKay RI, Nguyen XH, Whigham PA, Shan Y, O\u2019Neill M (2010) Grammar-based genetic programming: a survey. Genet Program Evol Mach, 11(3\u20134):365\u2013396","DOI":"10.1007\/s10710-010-9109-y"},{"key":"859_CR6","doi-asserted-by":"crossref","unstructured":"Jaroszewicz S (2008) Minimum variance associations\u2014discovering relationships in numerical data. In: The Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Osaka, Japan, pp. 172\u2013183","DOI":"10.1007\/978-3-540-68125-0_17"},{"key":"859_CR7","doi-asserted-by":"crossref","DOI":"10.4018\/978-1-60566-754-6","volume-title":"Rare association rule mining and knowledge discovery: technologies for infrequent and critical event detection","author":"YS Koh","year":"2010","unstructured":"Koh YS, Rountree N (2010) Rare association rule mining and knowledge discovery: technologies for infrequent and critical event detection. Information Science Reference, Hershey"},{"key":"859_CR8","volume-title":"Genetic programming: on the programming of computers by means of natural selection","author":"JR Koza","year":"1992","unstructured":"Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection. The MIT Press, Cambridge"},{"issue":"2","key":"859_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10618-010-0187-5","volume":"21","author":"M Leeuwen","year":"2010","unstructured":"Leeuwen M (2010) Maximal exceptions with minimal descriptions. Data Min Knowl Discov 21(2):259\u2013276","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"859_CR10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/s10618-012-0273-y","volume":"25","author":"Matthijs Leeuwen","year":"2012","unstructured":"Leeuwen Matthijs, Knobbe Arno (2012) Diverse subgroup set discovery. Data Min Knowl Discov 25(2):208\u2013242","journal-title":"Data Min Knowl Discov"},{"key":"859_CR11","doi-asserted-by":"crossref","unstructured":"Leman D, Feelders A, Knobbe AJ (2008) Exceptional model mining. In: Proceedings of the European Conference in Machine Learning and Knowledge Discovery in Databases, volume 5212 of ECML\/PKDD 2008, Antwerp, Belgium, Springer, pp. 1\u201316","DOI":"10.1007\/978-3-540-87481-2_1"},{"issue":"1","key":"859_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10115-011-0419-z","volume":"32","author":"JM Luna","year":"2012","unstructured":"Luna JM, Romero JR, Ventura S (2012) Design and behavior study of a grammar-guided genetic programming algorithm for mining association rules. Knowl Inf Syst 32(1):53\u201376","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"859_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10115-012-0591-9","volume":"38","author":"JM Luna","year":"2014","unstructured":"Luna JM, Romero JR, Ventura S (2014) On the adaptability of G3PARM to the extraction of rare association rules. Knowl Inf Syst 38(2):391\u2013418","journal-title":"Knowl Inf Syst"},{"key":"859_CR14","unstructured":"Romero C, Luna JM, Romero JR, Ventura S (2010) Mining rare association rules from e-learning data. In: Proceedings of the 3rd International Conference on Educational Data Mining, EDM 2010, pp. 171\u2013180"},{"issue":"8","key":"859_CR15","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/j.advengsoft.2011.04.005","volume":"42","author":"C Romero","year":"2011","unstructured":"Romero C, Luna JM, Romero JR, Ventura S (2011) RM-Tool: a framework for discovering and evaluating association rules. Adv Eng Softw 42(8):566\u2013576","journal-title":"Adv Eng Softw"},{"key":"859_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10115-010-0363-3","volume":"30","author":"A Salam","year":"2012","unstructured":"Salam A, Khayal M (2012) Mining top-k frequent patterns without minimum support threshold. Knowl Inf Syst 30:57\u201386","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"859_CR17","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s00500-007-0172-0","volume":"12","author":"S Ventura","year":"2008","unstructured":"Ventura S, Romero C, Zafra A, Delgado JA, Herv\u00e1s C (2008) JCLEC: a java framework for evolutionary computation. Soft Comput 12(4):381\u2013392","journal-title":"Soft Comput"},{"key":"859_CR18","doi-asserted-by":"crossref","unstructured":"Webb GI (2001) Discovering associations with numeric variables. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, KDD \u201901. New York, NY, USA, ACM, pp. 383\u2013388","DOI":"10.1145\/502512.502569"},{"issue":"1","key":"859_CR19","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.neucom.2011.03.052","volume":"75","author":"A Zafra","year":"2012","unstructured":"Zafra A, Pechenizkiy M, Ventura S (2012) ReliefF-MI: an extension of ReliefF to multiple instance learning. Neurocomputing 75(1):210\u2013218","journal-title":"Neurocomputing"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0859-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0859-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0859-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T03:40:09Z","timestamp":1566963609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0859-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,16]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["859"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0859-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,16]]}}}