{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:36Z","timestamp":1750221036029,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T00:00:00Z","timestamp":1540339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,24]]},"DOI":"10.1145\/3289430.3289445","type":"proceedings-article","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T15:29:22Z","timestamp":1543937362000},"page":"53-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Spark-based Incremental Algorithm for Frequent Itemset Mining"],"prefix":"10.1145","author":[{"given":"Haoxing","family":"Wen","sequence":"first","affiliation":[{"name":"Nankai University, Tianjin China"}]},{"given":"Mingdong","family":"Kou","sequence":"additional","affiliation":[{"name":"Nankai University, Tianjin China"}]},{"given":"Hengyi","family":"He","sequence":"additional","affiliation":[{"name":"Nankai University, Tianjin China"}]},{"given":"Xiaoguang","family":"Li","sequence":"additional","affiliation":[{"name":"Nankai University, Tianjin China"}]},{"given":"Huaixiao","family":"Tou","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai China"}]},{"given":"Yulu","family":"Yang","sequence":"additional","affiliation":[{"name":"Nankai University, Tianjin China"}]}],"member":"320","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"487","volume-title":"InProc. VLDB","volume":"1215","author":"Rakesh A.","unstructured":"Rakesh , A. and Ramakrishnan , S . 1994. Fast algorithms for mining association rules . InProc. VLDB , volume 1215 , pages 487 -- 499 . Rakesh, A. and Ramakrishnan, S. 1994. Fast algorithms for mining association rules. InProc. VLDB, volume 1215, pages 487--499."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170072"},{"key":"e_1_3_2_1_3_1","first-page":"263","volume-title":"KDD","author":"Shiby T.","unstructured":"Shiby , T. , Sreenath , B. , Khaled A. , and Sanjay R . 1997. An efficient algorithm for the incremental updation of association rules in large databases . KDD , pages 263 -- 266 . Shiby, T., Sreenath, B., Khaled A., and Sanjay R. 1997. An efficient algorithm for the incremental updation of association rules in large databases. KDD, pages 263--266."},{"key":"e_1_3_2_1_4_1","first-page":"141","volume-title":"ICSESS","author":"Xueyan L.","year":"2014","unstructured":"Xueyan , L. 2014 . Mr-apriori: Association rules algorithm based on mapreduce . ICSESS , pages 141 -- 144 . Xueyan, L. 2014. Mr-apriori: Association rules algorithm based on mapreduce. ICSESS, pages 141--144."},{"key":"e_1_3_2_1_5_1","unstructured":"Hadoop. http:\/\/hadoop.apache.org.  Hadoop. http:\/\/hadoop.apache.org."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2014.185"},{"key":"e_1_3_2_1_7_1","unstructured":"Spark. http:\/\/spark.apache.org.  Spark. http:\/\/spark.apache.org."},{"key":"e_1_3_2_1_8_1","first-page":"106","volume-title":"ICDE.","author":"David W. C.","unstructured":"David , W. C. , Jiawei , H. , Vincent , T. N. , and CY W. 1996. Maintenance of discovered association rules in large databases: An incremental updating technique . In ICDE. pages 106 -- 114 . David, W. C., Jiawei, H., Vincent, T. N., and CY W. 1996. Maintenance of discovered association rules in large databases: An incremental updating technique. In ICDE. pages 106--114."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. NSDI.","author":"Matei Z.","year":"2012","unstructured":"Matei , Z. , Mosharaf . C. , Tathagata . D. , 2012 . Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing . In Proc. NSDI. Matei, Z., Mosharaf. C., Tathagata. D., et al. 2012. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In Proc. NSDI."},{"key":"e_1_3_2_1_10_1","unstructured":"Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data  Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data"}],"event":{"name":"BDIOT 2018: 2018 2nd International Conference on Big Data and Internet of Things","sponsor":["Deakin University"],"location":"Beijing China","acronym":"BDIOT 2018"},"container-title":["Proceedings of the 2018 2nd International Conference on Big Data and Internet of Things"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289430.3289445","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3289430.3289445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:39Z","timestamp":1750207419000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289430.3289445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,24]]},"references-count":10,"alternative-id":["10.1145\/3289430.3289445","10.1145\/3289430"],"URL":"https:\/\/doi.org\/10.1145\/3289430.3289445","relation":{},"subject":[],"published":{"date-parts":[[2018,10,24]]},"assertion":[{"value":"2018-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}