{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:37:09Z","timestamp":1725489429482},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1109\/is.2010.5548388","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T10:51:46Z","timestamp":1282215106000},"page":"108-113","source":"Crossref","is-referenced-by-count":3,"title":["Array-Tree: A persistent data structure to compactly store frequent itemsets"],"prefix":"10.1109","author":[{"given":"Elena","family":"Baralis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tania","family":"Cerquitelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Chiusano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Grand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956827"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.11.004"},{"key":"ref12","article-title":"Afopt: An efficient implementation of pattern growth approach","author":"liu","year":"2003","journal-title":"FIMI"},{"key":"ref13","article-title":"Mining frequent itemsets using patricia tries","author":"pietracaprina","year":"2003","journal-title":"FIMI"},{"key":"ref14","article-title":"Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets","author":"uno","year":"2004","journal-title":"FIMI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1133905.1133916"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914857"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INMIC.2006.358170"},{"year":"0","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1008694.1008706"},{"key":"ref8","article-title":"Dmql: A data mining query language for relational databases","author":"han","year":"1996","journal-title":"DMKD"},{"key":"ref7","article-title":"Efficiently using prefix-trees in mining frequent itemsets","author":"grahne","year":"2003","journal-title":"FIMI"},{"key":"ref2","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"VLDB"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/69.250074"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"}],"event":{"name":"2010 5th IEEE International Conference Intelligent Systems (IS)","start":{"date-parts":[[2010,7,7]]},"location":"London, United Kingdom","end":{"date-parts":[[2010,7,9]]}},"container-title":["2010 5th IEEE International Conference Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5540657\/5548318\/05548388.pdf?arnumber=5548388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,19]],"date-time":"2017-03-19T01:29:46Z","timestamp":1489886986000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5548388\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/is.2010.5548388","relation":{},"subject":[],"published":{"date-parts":[[2010,7]]}}}