{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T04:33:21Z","timestamp":1769747601133,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T00:00:00Z","timestamp":1518134400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Korea government (MSIT), Institute for Information & communications Technology Promotion","award":["R0190-15-2012"],"award-info":[{"award-number":["R0190-15-2012"]}]},{"name":"Korea government (MSIT), Institute for Information & communications Technology Promotion","award":["R7124-16-0004"],"award-info":[{"award-number":["R7124-16-0004"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s10586-018-1812-0","type":"journal-article","created":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T07:31:40Z","timestamp":1518161500000},"page":"1507-1520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["BIGMiner: a fast and scalable distributed frequent pattern miner for big data"],"prefix":"10.1007","volume":"21","author":[{"given":"Kang-Wook","family":"Chon","sequence":"first","affiliation":[]},{"given":"Min-Soo","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,9]]},"reference":[{"key":"1812_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2","volume-title":"Frequent Pattern Mining","author":"CC Aggarwal","year":"2014","unstructured":"Aggarwal, C.C., Han, J.: Frequent Pattern Mining. Springer, New York (2014)"},{"key":"1812_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499 (1994). http:\/\/www.vldb.org\/conf\/1994\/P487.PDF"},{"key":"1812_CR3","unstructured":"Apache Hadoop (2006). http:\/\/hadoop.apache.org"},{"key":"1812_CR4","unstructured":"Apache Mahout (2013). http:\/\/mahout.apache.org"},{"key":"1812_CR5","unstructured":"Apache Spark MLlib (2014). http:\/\/spark.apache.org\/mllib\/"},{"key":"1812_CR6","unstructured":"BigFIM (2013). https:\/\/gitlab.com\/adrem\/bigfim-sa"},{"key":"1812_CR7","doi-asserted-by":"crossref","unstructured":"Buehrer, G., de\u00a0Oliveira, R.L., Fuhry, D., Parthasarathy, S.: Towards a parameter-free and parallel itemset mining algorithm in linearithmic time. In: 2015 IEEE 31st International Conference on Data Engineering (ICDE), pp. 1071\u20131082. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113357"},{"key":"1812_CR8","unstructured":"Cheng, L., Kotoulas, S.: Efficient skew handling for outer joins in a cloud computing environment. IEEE Transactions on Cloud Computing (2015)"},{"key":"1812_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, L., Kotoulas, S., Ward, T.E., Theodoropoulos, G.: Robust and skew-resistant parallel joins in shared-nothing systems. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 1399\u20131408. ACM (2014)","DOI":"10.1145\/2661829.2661888"},{"issue":"1","key":"1812_CR10","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":"1812_CR11","doi-asserted-by":"crossref","unstructured":"Fang, W., Lu, M., Xiao, X., He, B., Luo, Q.: Frequent itemset mining on graphics processors. In: DaMon, pp. 34\u201342. ACM (2009)","DOI":"10.1145\/1565694.1565702"},{"key":"1812_CR12","unstructured":"FIMI Repository (2005). http:\/\/fimi.ua.ac.be"},{"key":"1812_CR13","doi-asserted-by":"crossref","unstructured":"Gonen, Y., Gudes, E.: An improved mapreduce algorithm for mining closed frequent itemsets. In: 2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE), pp. 77\u201383. IEEE (2016)","DOI":"10.1109\/SWSTE.2016.19"},{"key":"1812_CR14","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2011","unstructured":"Han, J., Pei, J., Kamber, M.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (2011)"},{"key":"1812_CR15","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD Record. vol.\u00a029, pp. 1\u201312. ACM (2000)","DOI":"10.1145\/342009.335372"},{"key":"1812_CR16","doi-asserted-by":"crossref","unstructured":"Kovacs, F., Ill\u00e9s, J.: Frequent itemset mining on hadoop. In: 2013 IEEE 9th International Conference on Computational Cybernetics (ICCC), pp. 241\u2013245. IEEE (2013)","DOI":"10.1109\/ICCCyb.2013.6617596"},{"key":"1812_CR17","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: Pfp: parallel fp-growth for query recommendation. In: RecSys, pp. 107\u2013114. ACM (2008)","DOI":"10.1145\/1454008.1454027"},{"key":"1812_CR18","doi-asserted-by":"crossref","unstructured":"Li, N., Zeng, L., He, Q., Shi, Z.: Parallel implementation of apriori algorithm based on mapreduce. In: 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing (SNPD), pp. 236\u2013241. IEEE (2012)","DOI":"10.1109\/SNPD.2012.31"},{"key":"1812_CR19","doi-asserted-by":"crossref","unstructured":"Li, X., Han, J., Gonzalez, H.: High-dimensional olap: a minimal cubing approach. In: PVLDB, pp. 528\u2013539. VLDB Endowment (2004)","DOI":"10.1016\/B978-012088469-8.50048-6"},{"key":"1812_CR20","doi-asserted-by":"crossref","unstructured":"Lin, M.Y., Lee, P.Y., Hsueh, S.C.: Apriori-based frequent itemset mining algorithms on mapreduce. In: ICUIMC, p.\u00a076. ACM (2012)","DOI":"10.1145\/2184751.2184842"},{"issue":"1","key":"1812_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1013284820704","volume":"6","author":"W Lin","year":"2002","unstructured":"Lin, W., Alvarez, S.A., Ruiz, C.: Efficient adaptive-support association rule mining for recommender systems. Data Min. Knowl. Discov. 6(1), 83\u2013105 (2002)","journal-title":"Data Min. Knowl. Discov."},{"key":"1812_CR22","unstructured":"Lucchese, C., Orlando, S., Perego, R., Silvestri, F.: Webdocs: a real-life huge transactional dataset. In: FIMI, vol. 126 (2004)"},{"key":"1812_CR23","doi-asserted-by":"crossref","unstructured":"Moens, S., Aksehirli, E., Goethals, B.: Frequent itemset mining for big data. In: Big Data, pp. 111\u2013118. IEEE (2013)","DOI":"10.1109\/BigData.2013.6691742"},{"key":"1812_CR24","doi-asserted-by":"crossref","unstructured":"Sandvig, J.J., Mobasher, B., Burke, R.: Robustness of collaborative recommendation based on association rule mining. In: Recsys, pp. 105\u2013112. ACM (2007)","DOI":"10.1145\/1297231.1297249"},{"key":"1812_CR25","doi-asserted-by":"crossref","unstructured":"Schlegel, B.: Frequent itemset mining on multiprocessor systems. Dissertation, Technischen Universit $$\\ddot{a}$$ a \u00a8 t Dresden (2013)","DOI":"10.1145\/2485278.2485281"},{"key":"1812_CR26","doi-asserted-by":"crossref","unstructured":"Sethi, K.K., Ramesh, D.: Hfim: a spark-based hybrid frequent itemset mining algorithm for big data processing. J. Supercomput. 1\u201317 (2017)","DOI":"10.1007\/s11227-017-1963-4"},{"issue":"8","key":"1812_CR27","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.12733\/jics20103619","volume":"11","author":"L Wang","year":"2014","unstructured":"Wang, L., Feng, L., Zhang, J., Liao, P.: An efficient algorithm of frequent itemsets mining based on mapreduce. J. Inf. Comput. Sci. 11(8), 2809\u20132816 (2014)","journal-title":"J. Inf. Comput. Sci."},{"issue":"1","key":"1812_CR28","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TPDS.2016.2560176","volume":"28","author":"Y Xun","year":"2017","unstructured":"Xun, Y., Zhang, J., Qin, X., Zhao, X.: Fidoop-dp: data partitioning in frequent itemset mining on hadoop clusters. IEEE Trans. Parallel Distrib. Syst. 28(1), 101\u2013114 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1812_CR29","unstructured":"Yahoo webscope. Yahoo! altavista web page hyperlink connectivity graph (2009). http:\/\/webscope.sandbox.yahoo.com"},{"key":"1812_CR30","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1016\/j.proeng.2011.08.340","volume":"15","author":"H Yu","year":"2011","unstructured":"Yu, H., Wen, J., Wang, H., Jun, L.: An improved apriori algorithm based on the boolean matrix and hadoop. Procedia Eng. 15, 1827\u20131831 (2011)","journal-title":"Procedia Eng."},{"key":"1812_CR31","first-page":"283","volume":"97","author":"MJ Zaki","year":"1997","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W., et al.: New algorithms for fast discovery of association rules. KDD. 97, 283\u2013286 (1997)","journal-title":"KDD."},{"key":"1812_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Bakos, J.D.: Gpapriori: Gpu-accelerated frequent itemset mining. In: Cluster, pp. 590\u2013594 (2011). http:\/\/dx.doi.org\/10.1109\/CLUSTER.2011.61","DOI":"10.1109\/CLUSTER.2011.61"},{"issue":"1","key":"1812_CR33","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s11227-013-0887-x","volume":"66","author":"Fan Zhang","year":"2013","unstructured":"Zhang, F., Zhang, Y., Bakos, J.D.: Accelerating frequent itemset mining on graphics processing units. J. Supercomput. 66(1), 94\u2013117 (2013). http:\/\/dx.doi.org\/10.1007\/s11227-013-0887-x","journal-title":"The Journal of Supercomputing"},{"key":"1812_CR34","doi-asserted-by":"crossref","unstructured":"Zhou, L., Zhong, Z., Chang, J., Li, J., Huang, J.Z., Feng, S.: Balanced parallel fp-growth with mapreduce. In: 2010 IEEE Youth Conference on Information Computing and Telecommunications (YC-ICT), pp. 243\u2013246. IEEE (2010)","DOI":"10.1109\/YCICT.2010.5713090"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-018-1812-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-1812-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-018-1812-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T22:39:47Z","timestamp":1693521587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-018-1812-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,9]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["1812"],"URL":"https:\/\/doi.org\/10.1007\/s10586-018-1812-0","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,9]]},"assertion":[{"value":"3 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}