{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:20:16Z","timestamp":1729632016924,"version":"3.28.0"},"reference-count":49,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/icde.2015.7113357","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T19:23:28Z","timestamp":1433359408000},"page":"1071-1082","source":"Crossref","is-referenced-by-count":7,"title":["Towards a parameter-free and parallel itemset mining algorithm in linearithmic time"],"prefix":"10.1109","author":[{"given":"Gregory","family":"Buehrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto L.","family":"de Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Fuhry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.101"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/spe.587"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00333-0"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2601437"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956770"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/978-3-540-30214-8_22","article-title":"Tiling databases","author":"geerts","year":"2004","journal-title":"Discovery Science"},{"key":"ref37","article-title":"Integrating classification and association rule mining","author":"liu","year":"1998","journal-title":"KDD-98"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.37236\/1504","article-title":"Min-wise independent linear permutations","volume":"7","author":"bohman","year":"2000","journal-title":"Electronic Journal of Combinatorics"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1690"},{"key":"ref28","article-title":"Cache-conscious frequent pattern mining on a modern and emerging processors","author":"ghoting","year":"2007","journal-title":"VLDB Journal (VLDBJ)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2463664.2465222"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.21"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90021-6"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335322"},{"key":"ref21","article-title":"Hardness of approximation of the balanced complete bipartite subgraph problem","author":"feige","year":"2004","journal-title":"Technical report MCS04–04 Department of Computer Science and Applied Math The Weizmann Institute of Science"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S089548010240415X"},{"key":"ref23","article-title":"Improved inapproximability results for maxclique, chormatic number and approximate graph coloring","author":"khot","year":"2001","journal-title":"FOCS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40988-2_40"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45841-7_10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0202-x"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401941"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150495"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914857"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0054-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0255-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081907"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0203-9"},{"key":"ref4","first-page":"283","article-title":"New algorithms for fast discovery of association rules","author":"zaki","year":"1997","journal-title":"SIGKDD"},{"key":"ref3","article-title":"Ascending frequency ordered prefix-tree: Efficient mining of frequent patterns","author":"liu","year":"2003","journal-title":"DASFAA"},{"key":"ref6","first-page":"134","article-title":"Sampling large database for association rules","author":"toivenen","year":"1996","journal-title":"VLDB"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/777943.777945"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1002\/0470073047"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014091"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref48","first-page":"721","article-title":"gspan: Graph-based substructure pattern mining","author":"yan","year":"2002","journal-title":"ICDM'03 IEEE"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/775056.775058"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10390646"},{"key":"ref44","article-title":"Teaching an old elephant new tricks","author":"bruno","year":"2009","journal-title":"CIDR"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0057-3"}],"event":{"name":"2015 IEEE 31st International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2015,4,13]]},"location":"Seoul, South Korea","end":{"date-parts":[[2015,4,17]]}},"container-title":["2015 IEEE 31st International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7109453\/7113253\/07113357.pdf?arnumber=7113357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,3]],"date-time":"2020-09-03T00:35:49Z","timestamp":1599093349000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7113357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/icde.2015.7113357","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}