{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:40:02Z","timestamp":1748562002851,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"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":"http:\/\/www.springer.com\/tdm"}],"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_35","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T12:07:51Z","timestamp":1439208471000},"page":"509-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Prime Number Based Approach for Closed Frequent Itemset Mining in Big Data"],"prefix":"10.1007","author":[{"given":"Mehdi","family":"Zitouni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Akbarinia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadok Ben","family":"Yahia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Masseglia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"35_CR1","series-title":"Lecture Notes in Computer Science","first-page":"398","volume-title":"Database Theory - ICDT 1999","author":"N Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"El-hajj, M., Za\u00efane, O.R.: Parallel leap: large-scale maximal pattern mining in a distributed environment. In: Conference on Parallel and Distributed Systems, pp. 135\u2013142 (2006)","DOI":"10.1109\/ICPADS.2006.77"},{"key":"35_CR3","series-title":"Communications in Computer and Information Science","first-page":"249","volume-title":"Information Computing and Applications","author":"K Chen","year":"2011","unstructured":"Chen, K., Zhang, L., Li, S., Ke, W.: Research on association rules parallel algorithm based on FP-growth. In: Liu, C., Chang, J., Yang, A. (eds.) ICICA 2011, Part II. CCIS, vol. 244, pp. 249\u2013256. Springer, Heidelberg (2011)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Za\u00efane, O.R., El-Hajj, M., Lu, P.: Fast parallel association rule mining without candidacy generation. In: ICDM Conference, pp. 665\u2013668 (2001)","DOI":"10.1109\/ICDM.2001.989600"},{"key":"35_CR5","unstructured":"Liu, L., Li, E., Zhang, Y., Tang, Z.: Optimization of frequent itemset mining on multiple-core processor. In: VLDB Conference, pp. 1275\u20131285 (2007)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: Closet+: searching for the best strategies for mining frequent closed itemsets. In: KDD Conference, pp. 236\u2013245 (2003)","DOI":"10.1145\/956750.956779"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Wang, S.-Q., Yang, Y.-B., Gao, Y., Chen, G.-P., Zhang, Y.: Mapreduce-based closed frequent itemset mining with efficient redundancy filtering. In: ICDM Workshops, pp. 449\u2013453. IEEE Computer Society (2012)","DOI":"10.1109\/ICDMW.2012.24"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: Pfp: parallel fp-growth for query recommendation. In: ACM Conference on Recommender Systems (RecSys), pp. 107\u2013114 (2008)","DOI":"10.1145\/1454008.1454027"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. In: KDD Conference, pp. 66\u201375 (2000)","DOI":"10.1145\/380995.381017"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Borgelt, C.: An implementation of the fp-growth algorithm. In: OSDM Workshop, pp. 1\u20135 (2005)","DOI":"10.1145\/1133905.1133907"},{"key":"35_CR11","unstructured":"Pei, J., Han, J., Mao, R.: Closet: an efficient algorithm for mining frequent closed itemsets. In: SIGMOD Workshop on Research Issues in, Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"35_CR12","unstructured":"https:\/\/www.grid5000.fr\/"}],"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_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T23:08:39Z","timestamp":1748560119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22849-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319228488","9783319228495"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22849-5_35","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"}}]}}