{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:38:21Z","timestamp":1757781501316,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319228488"},{"type":"electronic","value":"9783319228495"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-22849-5_27","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T12:07:51Z","timestamp":1439208471000},"page":"401-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Parallel Eclat for Opportunistic Mining of Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Junqiang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongsheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingfeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin C. M.","family":"Fung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanghui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binxiao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal, R., Shafer, J.: Parallel mining of association rules. IEEE Trans. Knowl. Data Eng. 8, 962\u2013969 (1996)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"27_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: 20th VLDB, p. 487 (1994)"},{"key":"27_CR3","first-page":"139","volume":"3","author":"X Chen","year":"2009","unstructured":"Chen, X., He, Y., Chen, P., Miao, S., Song, W., Yue, M.: HPFP-Miner: a novel parallel frequent itemset mining algorithm. ICNC 3, 139\u2013143 (2009)","journal-title":"ICNC"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Cyrans, J.-D., Ratt, S., Champagne, R.: Adaptation of apriori to MapReduce to build a warehouse of relations between named entities across the web. In: 2010 DBKDA, pp. 185\u2013189 (2010)","DOI":"10.1109\/DBKDA.2010.34"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Dunkel, B., Soparkar, N.: Data organization and access for efficient data mining. In: 15th ICDE, pp. 522\u2013529 (1999)","DOI":"10.1109\/ICDE.1999.754968"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Farzanyar, Z., Cercone, N.: Efficient mining of frequent itemsets in social network data based on MapReduce framework. In: ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1183\u20131188 (2013)","DOI":"10.1145\/2492517.2500301"},{"key":"27_CR8","unstructured":"Hammoud, S.: MapReduce network enabled algorithms for classification based on association rules. Ph.D. Thesis, Brunel University (2011)"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: 2000 SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: PFP: parallel FP-growth for query recommendation. In: 2008 ACM Conference on Recommender System (RecSys 2008), pp. 107\u2013114 (2008)","DOI":"10.1145\/1454008.1454027"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Li, L., Zhang, M.: The strategy of mining association rules based on cloud computing. In: BCGIN, pp. 475\u2013478 (2011)","DOI":"10.1109\/BCGIn.2011.125"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Li, N., Zeng, L., He, Q., Shi, Z.: Parallel implementation of apriori algorithm based on MapReduce. In: ACIS International Conference on Software Engineering, Artificial Intelligence, Networking & Parallel\/Distributed Computing, pp. 236\u2013241 (2012)","DOI":"10.1109\/SNPD.2012.31"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Lin, M.-Y., Lee, P.-Y., Hsueh, S.-C.: Apriori-based frequent itemset mining algorithms on MapReduce. In: ICUIMC (2012)","DOI":"10.1145\/2184751.2184842"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Riondato, M., DeBrabant, J.A., Fonseca, R., Upfal, E.: PARMA: a randomized parallel algorithm for approximate association rule mining in MapReduce. In: 21st CIKM, pp. 85\u201394 (2012)","DOI":"10.1145\/2396761.2396776"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Sarawagi, S., Thomas, S., Agrawal, R.: Integrating association rule mining with databases: alternatives and implications. In: 1998 SIGMOD, pp. 343\u2013354 (1998)","DOI":"10.1145\/276305.276335"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Shenoy, P., Haritsa, J.R., Sudarshan, S.: Turbo-charging vertical mining of large databases. In: 2000 SIGMOD, pp. 22\u201333 (2000)","DOI":"10.1145\/342009.335376"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.knosys.2012.09.005","volume":"37","author":"MK Sohrabi","year":"2013","unstructured":"Sohrabi, M.K., Barforoush, A.A.: Parallel frequent itemset mining using systolic arrays. Knowl. Based Syst. 37, 462\u2013471 (2013)","journal-title":"Knowl. Based Syst."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Yang, X.Y., Liu, Z., Fu, Y.: MapReduce as a programming model for association rules algorithm on Hadoop. In: ICIS (2010)","DOI":"10.1109\/ICICIS.2010.5534718"},{"issue":"3","key":"27_CR19","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl Data Eng. 12(3), 372\u2013390 (2000)","journal-title":"IEEE Trans. Knowl Data Eng."},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: 9th SIGKDD, pp. 326\u2013335 (2003)","DOI":"10.1145\/956750.956788"},{"issue":"4","key":"27_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1009773317876","volume":"1","author":"MJ Zaki","year":"1997","unstructured":"Zaki, M.J., Ogihara, M., Parthasarathy, S., Li, W.: Parallel algorithms for discovery of association rules. Data Min. Knowl. Disc. 1(4), 343\u2013373 (1997)","journal-title":"Data Min. Knowl. Disc."},{"key":"27_CR22","unstructured":"Apache Mahout. http:\/\/mahout.apache.org\/"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22849-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:35:13Z","timestamp":1676471713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22849-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228488","9783319228495"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22849-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}