{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:01:36Z","timestamp":1763535696612,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T00:00:00Z","timestamp":1581984000000},"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":[[2020,2,18]]},"DOI":"10.1145\/3384544.3384610","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T03:58:24Z","timestamp":1588564704000},"page":"89-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Applying Prefixed-Itemset and Compression Matrix to Optimize the MapReduce-based Apriori Algorithm on Hadoop"],"prefix":"10.1145","author":[{"given":"Rui","family":"Sun","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]},{"given":"Yuqiang","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Wuhan University of Technology, Wuhan, China"}]}],"member":"320","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_2_1","first-page":"487","volume-title":"Proc. 20th int. conf. very large data bases, VLDB","volume":"1215","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal, R. Srikant, et al. Fast algorithms for mining association rules. In Proc. 20th int. conf. very large data bases, VLDB, volume 1215, pages 487--499, 1994."},{"key":"e_1_3_2_1_3_1","volume-title":"An improved apriori algorithm for association rules. arXiv preprint arXiv:1403.3948","author":"Al-Maolegi M.","year":"2014","unstructured":"M. Al-Maolegi and B. Arkok. An improved apriori algorithm for association rules. arXiv preprint arXiv:1403.3948, 2014."},{"key":"e_1_3_2_1_4_1","first-page":"2","article-title":"Improved apriori mining frequent items algorithm [j]","author":"L.","year":"2012","unstructured":"L. Bu-zhong. Improved apriori mining frequent items algorithm [j]. Application Research of Computers, 2, 2012.","journal-title":"Application Research of Computers"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_1_6_1","volume-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data mining and knowledge discovery, 8(1):53--87","author":"Han J.","year":"2004","unstructured":"J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data mining and knowledge discovery, 8(1):53--87, 2004."},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Research and improvement of apriori algorithm for mining association rules [j]","author":"Hao L. H. G. R. J.","year":"2009","unstructured":"L. H. G. R. J. Hao. Research and improvement of apriori algorithm for mining association rules [j]. Computer Applications and Software, 1, 2009.","journal-title":"Computer Applications and Software"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SNPD.2012.31"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSESS.2014.6933531"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44801-2_8"},{"key":"e_1_3_2_1_11_1","volume-title":"Implementing improved algorithm over apriori data mining association rule algorithm 1","author":"Rao S.","year":"2012","unstructured":"S. Rao and P. Gupta. Implementing improved algorithm over apriori data mining association rule algorithm 1. 2012."},{"key":"e_1_3_2_1_12_1","first-page":"36","article-title":"Three optimized methods of apriori algorithm [j]","author":"Shichao X. Z. L. M. Z.","year":"2004","unstructured":"X. Z. L. M. Z. Shichao and L. J. O. Yuming. Three optimized methods of apriori algorithm [j]. Computer Engineering and Applications, 36, 2004.","journal-title":"Computer Engineering and Applications"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3432883"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIC.2012.6510229"},{"key":"e_1_3_2_1_15_1","volume-title":"Fp-growth algorithm based on boolean matrix and mapreduce","author":"Xing-Shu C.","year":"2014","unstructured":"C. Xing-Shu, Z. Shuai, T. Hao, and C. Xiao-jing. Fp-growth algorithm based on boolean matrix and mapreduce. Journal of South China University of Technology (Natural Science Edition), (1):26, 2014."},{"key":"e_1_3_2_1_16_1","volume-title":"A prefixed-itemset-based improvement for apriori algorithm. arXiv preprint arXiv:1601.01746","author":"Yu S.","year":"2016","unstructured":"S. Yu and Y. Zhou. A prefixed-itemset-based improvement for apriori algorithm. arXiv preprint arXiv:1601.01746, 2016."},{"issue":"3","key":"e_1_3_2_1_17_1","first-page":"939","article-title":"Research of frequent itemsets mining algorithm based on vector and matrix","volume":"34","author":"Zhang M.","year":"2013","unstructured":"M. Zhang, L.-W. Yao, and Y. Hou. Research of frequent itemsets mining algorithm based on vector and matrix. Computer Engineering and Design, 34(3):939--943, 2013.","journal-title":"Computer Engineering and Design"}],"event":{"name":"ICSCA 2020: 2020 9th International Conference on Software and Computer Applications","acronym":"ICSCA 2020","location":"Langkawi Malaysia"},"container-title":["Proceedings of the 2020 9th International Conference on Software and Computer Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384544.3384610","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3384544.3384610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:18:47Z","timestamp":1755839927000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3384544.3384610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,18]]},"references-count":17,"alternative-id":["10.1145\/3384544.3384610","10.1145\/3384544"],"URL":"https:\/\/doi.org\/10.1145\/3384544.3384610","relation":{},"subject":[],"published":{"date-parts":[[2020,2,18]]},"assertion":[{"value":"2020-04-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}