{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:49:48Z","timestamp":1760708988188,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Spanish Ministry of Economy and Competitiveness","award":["TIN-2014-55252-P"],"award-info":[{"award-number":["TIN-2014-55252-P"]}]},{"DOI":"10.13039\/501100008530","name":"FEDER","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Spanish Ministry of Education under FPU","award":["AP2010-0041","AP2010-0042"],"award-info":[{"award-number":["AP2010-0041","AP2010-0042"]}]},{"DOI":"10.13039\/501100002701","name":"Ministry of Education under FPU","doi-asserted-by":"publisher","award":["AP2010-0041"],"award-info":[{"award-number":["AP2010-0041"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1109\/tcyb.2015.2496175","type":"journal-article","created":{"date-parts":[[2016,1,19]],"date-time":"2016-01-19T15:51:19Z","timestamp":1453218679000},"page":"3059-3072","source":"Crossref","is-referenced-by-count":33,"title":["Speeding-Up Association Rule Mining With Inverted Index Compression"],"prefix":"10.1109","volume":"46","author":[{"given":"Jose Maria","family":"Luna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Cano","sequence":"additional","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":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.2307\/3001968"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1016\/j.ins.2009.12.010"},{"key":"ref31","first-page":"2677","article-title":"An extension on statistical comparisons of classifiers over multiple data sets for all pairwise comparisons","volume":"9","author":"garc\u00eda","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref30","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"dem\u0161ar","year":"2006","journal-title":"J Mach Learn Res"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1007\/s10618-010-0202-x"},{"year":"2006","author":"cover","journal-title":"Elements of Information Theory","key":"ref36"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1145\/1656274.1656278"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/s10710-010-9109-y"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/1007730.1007744"},{"key":"ref11","first-page":"20","article-title":"DCI closed: A fast and memory efficient algorithm to mine frequent closed itemsets","author":"lucchese","year":"2004","journal-title":"Proc IEEE ICDM Workshop Frequent Itemset Min Implement (FIMI)"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/j.advengsoft.2011.04.005"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.3233\/ICA-140467","article-title":"Reducing gaps in quantitative association rules: A genetic programming free-parameter algorithm","volume":"21","author":"luna","year":"2014","journal-title":"Integr Comput Aided Eng"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TCYB.2014.2381659"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.is.2006.06.001"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1145\/1142473.1142548"},{"key":"ref18","first-page":"97","author":"koh","year":"2005","journal-title":"Finding Sporadic Rules Using Apriori-Inverse"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1007\/s10115-011-0419-z"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1080\/08839510590967316"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/j.patcog.2011.02.020"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1016\/j.jcss.2013.03.010"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1109\/TCYB.2014.2307349","article-title":"Semi-supervised and unsupervised extreme learning machines","volume":"44","author":"gao","year":"2014","journal-title":"IEEE Trans Cybern"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TCYB.2014.2360856"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/TCYB.2014.2358564"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/s00778-014-0354-1"},{"key":"ref8","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"Proc 20th Int Conf Very Large Data Bases (VLDB)"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ICDMW.2009.34"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TCYB.2014.2363878"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/j.artint.2010.04.018"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1038\/498255a"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1016\/j.datak.2013.01.002"},{"key":"ref22","first-page":"307","article-title":"Fast discovery of association rules","author":"agrawal","year":"0","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/s10115-012-0591-9"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TCYB.2014.2306819"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TCYB.2014.2345579"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/s00500-005-0476-x"},{"key":"ref25","first-page":"90","article-title":"Efficient implementations of Apriori and Eclat","author":"borgelt","year":"2003","journal-title":"Proc 1st IEEE ICDM Workshop Frequent Item Set Min Implement (FIMI)"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/7744634\/07386634.pdf?arnumber=7386634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:45:38Z","timestamp":1641987938000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7386634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":37,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2015.2496175","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"type":"print","value":"2168-2267"},{"type":"electronic","value":"2168-2275"}],"subject":[],"published":{"date-parts":[[2016,12]]}}}