{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:49:41Z","timestamp":1648846181688},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T00:00:00Z","timestamp":1490313600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10115-017-1041-5","type":"journal-article","created":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T12:46:32Z","timestamp":1490359592000},"page":"207-237","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Data placement in massively distributed environments for fast parallel mining of frequent itemsets"],"prefix":"10.1007","volume":"53","author":[{"given":"Saber","family":"Salah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Akbarinia","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":[[2017,3,24]]},"reference":[{"issue":"6","key":"1041_CR1","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal R, Shafer JC (1996) Parallel mining of association rules. IEEE Trans Knowl Data Eng 8(6):962\u2013969. doi: 10.1109\/69.553164","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1041_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Bocca JB, Jarke M, Zaniolo C (eds) Proceedings of international conference on very large data bases (VLDB), Santiago de Chile, pp.\u00a0487\u2013499"},{"key":"1041_CR3","unstructured":"Amazon (n.d.). http:\/\/snap.stanford.edu\/data\/web-Amazon-links.html"},{"key":"1041_CR4","volume-title":"Mining of massive datasets","author":"R Anand","year":"2012","unstructured":"Anand R (2012) Mining of massive datasets. Cambridge University Press, New York, Cambridge"},{"key":"1041_CR5","volume-title":"Survey of text mining clustering, classification, and retrieval","author":"M Berry","year":"2004","unstructured":"Berry M (2004) Survey of text mining clustering, classification, and retrieval. Springer, New York, NY"},{"issue":"4","key":"1041_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2094114.2094129","volume":"40","author":"C Bizer","year":"2011","unstructured":"Bizer C, Boncz PA, Brodie ML, Erling O (2011) The meaningful use of big data: four perspectives - four challenges. SIGMOD Rec 40(4):56\u201360. doi: 10.1145\/2094114.2094129","journal-title":"SIGMOD Rec"},{"issue":"1","key":"1041_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"1041_CR8","unstructured":"English Wikipedia Articles (2014). http:\/\/dumps.wikimedia.org\/enwiki\/latest"},{"key":"1041_CR9","volume-title":"Graph algorithms","author":"S Even","year":"1979","unstructured":"Even S (1979) Graph algorithms. Computer Science Press, Potomac"},{"issue":"2","key":"1041_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2481244.2481246","volume":"14","author":"W Fan","year":"2013","unstructured":"Fan W, Bifet A (2013) Mining big data: Current status, and forecast to the future. SIGKDD Explor Newsl 14(2):1\u20135. doi: 10.1145\/2481244.2481246","journal-title":"SIGKDD Explor Newsl"},{"key":"1041_CR11","unstructured":"Grid5000 (n.d.). https:\/\/www.grid5000.fr\/mediawiki\/index.php\/Grid5000:Home"},{"key":"1041_CR12","unstructured":"Hadoop (2014). http:\/\/hadoop.apache.org"},{"key":"1041_CR13","doi-asserted-by":"crossref","unstructured":"Han, Pei, Yin (2000) Mining frequent patterns without candidate generation, SIGMODREC: ACM SIGMOD Rec 29:1\u201312","DOI":"10.1145\/335191.335372"},{"key":"1041_CR14","volume-title":"Introduction to parallel computing: design and analysis of algorithms","author":"V Kumar","year":"1994","unstructured":"Kumar V, Grama A, Gupta A, Karypis G (1994) Introduction to parallel computing: design and analysis of algorithms. Benjamin-Cummings Publishing Co., Inc., Redwood City"},{"issue":"12","key":"1041_CR15","doi-asserted-by":"publisher","first-page":"2032","DOI":"10.14778\/2367502.2367572","volume":"5","author":"A Labrinidis","year":"2012","unstructured":"Labrinidis A, Jagadish HV (2012) Challenges and opportunities with big data. Proc VLDB Endow 5(12):2032\u20132033. doi: 10.14778\/2367502.2367572","journal-title":"Proc VLDB Endow"},{"key":"1041_CR16","doi-asserted-by":"publisher","unstructured":"Li H, Wang Y, Zhang D, Zhang M, Chang EY (2008) Pfp: parallel fp-growth for query recommendation. In: Pu P, Bridge DG, Mobasher B, Ricci F (eds) Proceedings of the 2008 ACM conference on recommender systems, RecSys 2008, Lausanne, October 23-25, 2008, ACM, pp\u00a0107\u2013114. doi: 10.1145\/1454008.1454027","DOI":"10.1145\/1454008.1454027"},{"key":"1041_CR17","unstructured":"Liroz-Gistau M, Akbarinia R, Pacitti E, Porto F, Valduriez P (2014) Dynamic Workload-Based Partitioning Algorithms for Continuously Growing Databases, Transactions on Large-Scale Data- and Knowledge-Centered Systems, p\u00a0105. http:\/\/hal-lirmm.ccsd.cnrs.fr\/lirmm-00906966"},{"key":"1041_CR18","doi-asserted-by":"crossref","unstructured":"Moens S, Aksehirli E, Goethals B (2013) Frequent itemset mining for big data. In: Big Data, 2013 IEEE international conference on, pp\u00a0111\u2013118","DOI":"10.1109\/BigData.2013.6691742"},{"key":"1041_CR19","volume-title":"Mahout in action","author":"S Owen","year":"2012","unstructured":"Owen S (2012) Mahout in action. Manning Publications Co, Shelter Island"},{"key":"1041_CR20","unstructured":"PaToH (2011). http:\/\/bmi.osu.edu\/~umit\/PaToH\/manual.pdf"},{"key":"1041_CR21","doi-asserted-by":"crossref","unstructured":"Riondato M, DeBrabant JA, Fonseca R, Upfal E (2012) Parma: a parallel randomized algorithm for approximate association rules mining in mapreduce. In: 21st ACM international conference on information and knowledge management (CIKM), Maui, HI, USA. ACM, pp\u00a085\u201394. http:\/\/dl.acm.org\/citation.cfm?id=2396761","DOI":"10.1145\/2396761.2396776"},{"key":"1041_CR22","doi-asserted-by":"crossref","unstructured":"Salah S, Akbarinia R, Masseglia F (2015) Data partitioning for fast mining of frequent itemsets in massively distributed environments. In: 26th international conference on dand expert systems applications (DEXA)","DOI":"10.1007\/978-3-319-22849-5_21"},{"key":"1041_CR23","unstructured":"Savasere A, Omiecinski E, Navathe SB (1995) An efficient algorithm for mining association rules in large databases. In: Proceedings of international conference on very large data bases (VLDB), pp\u00a0432\u2013444"},{"issue":"6","key":"1041_CR24","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.knosys.2008.03.011","volume":"21","author":"W Song","year":"2008","unstructured":"Song W, Yang B, Xu Z (2008) Index-bittablefi: an improved algorithm for mining frequent itemsets. Knowl Based Syst 21(6):507\u2013513","journal-title":"Knowl Based Syst"},{"key":"1041_CR25","unstructured":"The ClueWeb09 Dataset (2009). http:\/\/www.lemurproject.org\/clueweb09.php\/"},{"issue":"1\u20134","key":"1041_CR26","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ins.2003.08.013","volume":"160","author":"Y-J Tsay","year":"2004","unstructured":"Tsay Y-J, Chang-Chien Y-W (2004) An efficient cluster and decomposition algorithm for mining association rules. Inf Sci Inf Comput Sci 160(1\u20134):161\u2013171. doi: 10.1016\/j.ins.2003.08.013","journal-title":"Inf Sci Inf Comput Sci"},{"key":"1041_CR27","unstructured":"Zaharia M, Chowdhury M, Franklin MJ, Shenker S, Stoica I (2010) Spark: Cluster computing with working sets. In: Proceedings of the 2Nd USENIX conference on hot topics in cloud computing, HotCloud\u201910, USENIX Association, Berkeley, pp\u00a010\u201310. http:\/\/dl.acm.org\/citation.cfm?id=1863103.1863113"},{"issue":"4","key":"1041_CR28","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"MJ Zaki","year":"1999","unstructured":"Zaki MJ (1999) Parallel and distributed association mining: a survey. IEEE Concur 7(4):14\u201325. doi: 10.1109\/4434.806975","journal-title":"IEEE Concur"},{"issue":"4","key":"1041_CR29","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1009773317876","volume":"1","author":"MJ Zaki","year":"1997","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) Parallel algorithms for discovery of association rules. Data Min Knowl Discov 1(4):343\u2013373. doi: 10.1023\/A:1009773317876","journal-title":"Data Min Knowl Discov"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1041-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1041-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1041-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T04:48:22Z","timestamp":1568954902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1041-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,24]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1041"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1041-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,24]]}}}