{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:28:26Z","timestamp":1763141306889,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/bigdata47090.2019.9006305","type":"proceedings-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T06:05:34Z","timestamp":1582610734000},"page":"1143-1150","source":"Crossref","is-referenced-by-count":5,"title":["Enhancing Itemset Tree Rules and Performance"],"prefix":"10.1109","author":[{"given":"Jay","family":"Lewis","sequence":"first","affiliation":[]},{"given":"Ryan G.","family":"Benton","sequence":"additional","affiliation":[]},{"given":"David","family":"Bourrie","sequence":"additional","affiliation":[]},{"given":"Jennifer","family":"Lavergne","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335372"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"ref12","first-page":"51","article-title":"Min-Max Itemset Trees for Dense and Categorical Datasets","author":"lavergne","year":"2012","journal-title":"International Symposium on Methodologies for Intelligent Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-53917-6_9"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","article-title":"A Tree Projection Algorithm for Generation of Frequent Item Sets","volume":"61","author":"agarwal","year":"2001","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref15","first-page":"61","article-title":"TRARM-RelSup: Targeted Rare Association Rule Mining Using Itemset Trees and the Relative Support Measure","author":"lavergne","year":"2012","journal-title":"International Symposium on Methodologies for Intelligent Systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2013.43"},{"key":"ref17","first-page":"220","article-title":"Dynamic Data Mining","author":"raghavan","year":"2000","journal-title":"Thirteenth International Conference on Industrial Engineering Applications of AI and Expert Systems"},{"key":"ref18","first-page":"487","article-title":"Fast Algorithms for Mining Association Rules in Large Databases","author":"agrawal","year":"1994","journal-title":"International Conference on Very Large Data Bases"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.01.025"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ssci.2007.12.001"},{"journal-title":"Contrast Data Mining Concepts Algorithms and Applications","year":"2013","author":"dong","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ssci.2009.12.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1245290"},{"key":"ref5","article-title":"Investigating the Pattern of Traffic Crashes Under Rainy Weather by Association Rules in Data Mining","author":"das","year":"2014","journal-title":"Transportation Research Board Annu Meeting"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2006-10202"},{"key":"ref7","first-page":"183","article-title":"The Item-Set tree: A Data Structure for Data Mining","author":"hafez","year":"1999","journal-title":"International Conference on Data Warehousing and Knowledge Discovery"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkq500"},{"key":"ref9","first-page":"148","article-title":"Mining Frequent Itemsets Using Re-Usable Data Structure","author":"yakout","year":"2007","journal-title":"International Conference on Data Mining"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.03.004"},{"key":"ref22","first-page":"32","author":"agrawal","year":"1994","journal-title":"Fast Algorithms for Mining Association Rules in Large Databases"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/07408170600897460"},{"journal-title":"Datasets","year":"2016","author":"fournier-viger","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3141\/1840-14"},{"journal-title":"UCI Machine Learning Repository","year":"2013","author":"lichman","key":"ref25"}],"event":{"name":"2019 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2019,12,9]]},"location":"Los Angeles, CA, USA","end":{"date-parts":[[2019,12,12]]}},"container-title":["2019 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8986695\/9005444\/09006305.pdf?arnumber=9006305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:50:58Z","timestamp":1658094658000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9006305\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/bigdata47090.2019.9006305","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}