{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:16:33Z","timestamp":1673144193668},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,12,12]],"date-time":"2007-12-12T00:00:00Z","timestamp":1197417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10115-007-0115-1","type":"journal-article","created":{"date-parts":[[2007,12,11]],"date-time":"2007-12-11T12:24:32Z","timestamp":1197375872000},"page":"359-391","source":"Crossref","is-referenced-by-count":11,"title":["Efficient mining of maximal frequent itemsets from databases on a cluster of workstations"],"prefix":"10.1007","volume":"16","author":[{"given":"Soon M.","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Congnan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,12]]},"reference":[{"key":"115_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal RC, Aggarwal CC, Prasad VVV (2000) Depth first generation of long patterns. In: Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, pp 108\u2013118","DOI":"10.1145\/347090.347114"},{"key":"115_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB conference, pp 487\u2013499"},{"issue":"6","key":"115_CR3","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal R and 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":"115_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo RJ (1998) Efficient mining long patterns from databases. In: Proceedings of ACM SIGMOD international conference on management of data, pp 85\u201393","DOI":"10.1145\/276305.276313"},{"key":"115_CR5","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Ullman J, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. In: Proceedings of ACM SIGMOD international conference on management of data, pp 255\u2013264","DOI":"10.1145\/253260.253325"},{"key":"115_CR6","doi-asserted-by":"crossref","unstructured":"Burdick D, Calimlim M, Gehrke J (2001) MAFIA: a maximal frequent itemset\u00a0algorithm for transaction databases. In: Proceedings of international conference on data engineering, pp 443\u2013452","DOI":"10.1109\/ICDE.2001.914857"},{"key":"115_CR7","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng V, Fu AW, Fu Y (1996) A fast distributed algorithm for mining association rules. In: Proceedings of the 4th international conference on parallel and distributed information systems, pp 31\u201343","DOI":"10.1109\/PDIS.1996.568665"},{"issue":"3","key":"115_CR8","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/TKDE.2002.1000339","volume":"14","author":"DW Cheung","year":"2002","unstructured":"Cheung DW, Lee SD and Xiao Y (2002). Effect of data skewness and workload balance in parallel data mining. IEEE Trans Knowl Data Eng 14(3): 498\u2013514","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"115_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1109\/71.485502","volume":"7","author":"SM Chung","year":"1996","unstructured":"Chung SM and Yang J (1996). A parallel distributive join algorithm for cube-connected multiprocessors. IEEE Trans Parallel Distrib Systems 7(2): 127\u2013137","journal-title":"IEEE Trans Parallel Distrib Systems"},{"key":"115_CR10","unstructured":"Frequent Itemset Mining Implementations (FIMI) Repository (2004) http:\/\/fimi.cs.helsinki.fi\/fimi04\/"},{"key":"115_CR11","unstructured":"Geurts K, Wets G, Brijs T, Vanhoof K (2003) Profiling high frequency accident locations using association rules. In: Proceedings of the 82nd annual meeting of the transportation research board, Washington, p 18"},{"key":"115_CR12","doi-asserted-by":"crossref","unstructured":"Gouda K, Zaki MJ (2001) Efficiently mining maximal frequent itemsets. In: Proceedings of the 1st IEEE international conference on data mining, pp 163\u2013170","DOI":"10.1109\/ICDM.2001.989514"},{"key":"115_CR13","doi-asserted-by":"crossref","unstructured":"Guha S, Rastogi R, Shim K (1999) ROCK: a robust clustering algorithm for categorical attributes. In: Proceedings of international conference on data engineering, pp 512\u2013521","DOI":"10.1109\/ICDE.1999.754967"},{"issue":"3","key":"115_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/69.846289","volume":"12","author":"EH Han","year":"2000","unstructured":"Han EH, Karypis G and Kumar V (2000). Scalable parallel data mining for association rules. IEEE Trans Knowl Data Eng 12(3): 337\u2013352","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"115_CR15","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD international conference on management of data, pp 1\u201312","DOI":"10.1145\/335191.335372"},{"issue":"2","key":"115_CR16","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/PL00011664","volume":"3","author":"JD Holt","year":"2001","unstructured":"Holt JD and Chung SM (2001). Multipass algorithms for mining association rules in text databases. Knowl Inf Systems 3(2): 168\u2013183","journal-title":"Knowl Inf Systems"},{"issue":"4","key":"115_CR17","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0020-0190(01)00330-1","volume":"83","author":"JD Holt","year":"2002","unstructured":"Holt JD and Chung SM (2002). Mining association rules using inverted hashing and pruning. Inf Process Lett 83(4): 211\u2013220","journal-title":"Inf Process Lett"},{"issue":"3","key":"115_CR18","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TKDE.2002.1000342","volume":"14","author":"D Lin","year":"2002","unstructured":"Lin D and Kedem ZM (2002). Pincer-Search: an efficient algorithm for discovering the maximal frequent set. IEEE Trans Knowl Data Eng 14(3): 553\u2013566","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"115_CR19","volume-title":"MPI: the complete reference","author":"M Snir","year":"1996","unstructured":"Snir M, Otto S, Huss-Lederman S, Walker D and Dongarra J (1996). MPI: the complete reference. MIT Press, Cambridge"},{"key":"115_CR20","doi-asserted-by":"crossref","unstructured":"Park JS, Chen MS, Yu PS (1995) Efficient parallel mining for association rules. In: Proceedings of international conference on information and knowledge management, pp 31\u201336","DOI":"10.1145\/221270.221320"},{"issue":"5","key":"115_CR21","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1109\/69.634757","volume":"9","author":"JS Park","year":"1997","unstructured":"Park JS, Chen MS and Yu PS (1997). Using a hash-based method with transaction trimming for mining association rules. IEEE Trans Knowl Data Eng 9(5): 813\u2013825","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"115_CR22","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of international conference on database theory, LNCS, vol 1540, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"115_CR23","unstructured":"Savasere A, Omiecinski E, Navathe S (1995) An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21st VLDB conference, pp 432\u2013444"},{"issue":"1","key":"115_CR24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1177\/1094342005051521","volume":"19","author":"R Thakur","year":"2000","unstructured":"Thakur R, Rabenseifner R and Gropp W (2000). Optimization of collective communication operations in MPICH. Int J High Perform Comput Appl 19(1): 49\u201366","journal-title":"Int J High Perform Comput Appl"},{"key":"115_CR25","doi-asserted-by":"crossref","unstructured":"Wang K, Xu C, Liu B (1999) Clustering transactions using large items. In: Proceedings of international conference on information and knowledge management, pp 483\u2013490","DOI":"10.1145\/319950.320054"},{"key":"115_CR26","doi-asserted-by":"crossref","unstructured":"Yang Y, Guan X, You J (2002) CLOPE: a fast and effective clustering algorithm for transactional data. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining, pp 682\u2013687","DOI":"10.1145\/775047.775149"},{"key":"115_CR27","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) New algorithms for fast discovery of association rules. Computer Science Department Technical Rep. #651, University of Rochester","DOI":"10.1007\/978-1-4615-5669-5_1"},{"issue":"4","key":"115_CR28","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1009773317876","volume":"1","author":"MJ Zaki","year":"1997","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M and Li W (1997). Parallel algorithms for fast discovery of association rules. Data Mining Knowl Discovery 1(4): 343\u2013373","journal-title":"Data Mining Knowl Discovery"},{"issue":"3","key":"115_CR29","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000). Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3): 372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"115_CR30","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2000) Generating non-redundant association rules. In: Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, pp 34\u201343","DOI":"10.1145\/347090.347101"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0115-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-007-0115-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-007-0115-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:17Z","timestamp":1559110217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-007-0115-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,12]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s10115-007-0115-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,12]]}}}