{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:11:59Z","timestamp":1717978319687},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T00:00:00Z","timestamp":1430352000000},"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":["Computing"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00607-015-0457-6","type":"journal-article","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T07:50:37Z","timestamp":1430293837000},"page":"235-256","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A fast and distributed algorithm for mining frequent patterns in congested networks"],"prefix":"10.1007","volume":"98","author":[{"given":"Kawuu W.","family":"Lin","sequence":"first","affiliation":[]},{"given":"Sheng-Hao","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Chun-Cheng","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"issue":"2","key":"457_CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/s10489-007-0099-2","volume":"30","author":"M Adnan","year":"2009","unstructured":"Adnan M, Alhajj R (2009) DRFP-tree: disk-resident frequent pattern tree. Appl Intell 30(2):84\u201397","journal-title":"Appl Intell"},{"key":"457_CR2","unstructured":"Agrawal R, Srikant R (1994) Quest synthetic data generator. IBM Almaden Research Center, San Jose. http:\/\/sourceforge.net\/projects\/ibmquestdatagen\/"},{"key":"457_CR3","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th international conference on very large data bases, VLDB, Santiago, pp 487\u2013499"},{"issue":"6","key":"457_CR4","doi-asserted-by":"crossref","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","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"457_CR5","doi-asserted-by":"crossref","unstructured":"Baralis E, Cerquitelli T, Chiusano S, Grand A (2013) P-mine: parallel itemset mining on large datasets. ICDE","DOI":"10.1109\/ICDEW.2013.6547461"},{"key":"457_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-642-03730-6_11","volume":"5691","author":"CI Ezeife","year":"2009","unstructured":"Ezeife CI, Zhang D (2009) TidFP: mining frequent patterns in different databases with transaction ID. Data Warehousing Knowl Discov, Lecture Notes Comput Sci 5691:125\u2013137","journal-title":"Data Warehousing Knowl Discov, Lecture Notes Comput Sci"},{"key":"457_CR7","unstructured":"Grahne G, Zhu J (2003) Efficiently using prefix-trees in mining frequent itemsets. In: Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations"},{"key":"457_CR8","doi-asserted-by":"crossref","unstructured":"Grahne G, Zhu J (2004) Mining frequent itemsets from secondary memory. International conference on data mining, pp 91\u201398","DOI":"10.1109\/ICDM.2004.10116"},{"key":"457_CR9","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"457_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. J Data Min Knowl Discov 8(1):53\u201387","journal-title":"J Data Min Knowl Discov"},{"key":"457_CR11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/B:DAPD.0000031634.19130.bd","volume":"16","author":"A Javed","year":"2004","unstructured":"Javed A, Khokhar A (2004) Frequent pattern mining on message passing multiprocessor systems. Distrib Parallel Databases 16:321\u2013334","journal-title":"Distrib Parallel Databases"},{"key":"457_CR12","doi-asserted-by":"crossref","unstructured":"Schlegel B, Gemulla R, Lehner W (2011) Memory-efficient frequent-itemset mining. In: EDBT\/ICDT11 proceedings of the 14th international conference on extending database technology, pp 461\u2013472","DOI":"10.1145\/1951365.1951420"},{"key":"457_CR13","doi-asserted-by":"crossref","unstructured":"Lai Y, Zhongzhi S (2010) An efficient data mining framework on Hadoop using java persistence API. International conference on computer and information technology, pp 203\u2013209","DOI":"10.1109\/CIT.2010.71"},{"key":"457_CR14","unstructured":"Lai Y, Zhongzhi S, Xu LD, Fan L, Kirsh I (2011) DH-TRIE frequent pattern mining on hadoop using JPA. International conference on granular computing, pp 875\u2013878"},{"key":"457_CR15","doi-asserted-by":"crossref","unstructured":"Lin KW, Luo YC (2009) A fast parallel algorithm for discovering frequent patterns. GRC \u201909. IEEE international conference on granular computing, pp 398\u2013403","DOI":"10.1109\/GRC.2009.5255089"},{"key":"457_CR16","unstructured":"Lin KW, Lo YC (2013) Efficient algorithms for frequent pattern mining in many-task computing environments. Knowl Based Syst 49"},{"key":"457_CR17","unstructured":"Qiu Y, Lan YJ, Xie QS (2004) An improved algorithm of mining from FP- tree. In: Proceedings of the third international conference on machine learning and cybernetics, pp 26\u201329"},{"key":"457_CR18","doi-asserted-by":"crossref","unstructured":"Vu L, Alaghband G (2013) Novel parallel method for mining frequent patterns on multi-core shared memory systems. In: DISCS-2013 proceedings of the 2013 international workshop on data-intensive scalable computing systems, pp 49\u201354","DOI":"10.1145\/2534645.2534653"},{"key":"457_CR19","unstructured":"Wu X, Zhu X, Gong-Qing W, Ding W (2014) Data mining with big data, TKDE"},{"key":"457_CR20","doi-asserted-by":"crossref","unstructured":"Yang XY, Liu Z, Fu Y (2010) MapReduce as a programming model for association rules algorithm on Hadoop. International conference on information sciences and interaction sciences, pp 99\u2013102","DOI":"10.1109\/ICICIS.2010.5534718"},{"key":"457_CR21","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-642-01307-2_23","volume":"5476","author":"SJ Yen","year":"2009","unstructured":"Yen SJ, Lee YS, Wang CK, Wu JW, Ouyang LY (2009) The studies of mining frequent patterns based on frequent pattern tree. Adv Knowl Discov Data Min, Lecture Notes Comput Sci 5476:232\u2013241","journal-title":"Adv Knowl Discov Data Min, Lecture Notes Comput Sci"},{"key":"457_CR22","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3)","DOI":"10.1109\/69.846291"},{"key":"457_CR23","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-540-68083-3_5","volume":"5036","author":"J Zhou","year":"2008","unstructured":"Zhou J, Yu KM (2008) Tidset-based Parallel FP-tree algorithm for the frequent pattern mining problem on PC clusters. Adv Grid Pervas Comput, Lecture Notes Comput Sci 5036:18\u201328","journal-title":"Adv Grid Pervas Comput, Lecture Notes Comput Sci"},{"key":"457_CR24","doi-asserted-by":"crossref","unstructured":"Zhou J, Yu KM (2008) Balanced tidset-based parallel FP-tree algorithm for the frequent pattern mining on grid system. Fourth international conference on semantics, knowledge and grid, pp 103\u2013108","DOI":"10.1109\/SKG.2008.65"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-015-0457-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-015-0457-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-015-0457-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T03:46:56Z","timestamp":1566618416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-015-0457-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,30]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["457"],"URL":"https:\/\/doi.org\/10.1007\/s00607-015-0457-6","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,30]]}}}