{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T09:31:08Z","timestamp":1696671068566},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0167-8191(02)00096-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T23:55:37Z","timestamp":1034639737000},"page":"815-825","source":"Crossref","is-referenced-by-count":3,"title":["Parallel frequent set counting"],"prefix":"10.1016","volume":"28","author":[{"given":"D.B.","family":"Skillicorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00096-0_BIB1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, J. Shafer, Parallel mining of association rules: Design, implementation and experience, Technical Report RJ10004, IBM Research Report, February 1996","DOI":"10.1109\/69.553164"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, R. Srikant, Mining sequential patterns, in: P.S. Yu, A.L.P. Chen (Eds.), in: Proceedings of the 11th International Conference on Data Engineering, ICDE, IEEE Computer Society Press, 1995, pp. 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00058655","article-title":"Bagging predictors","volume":"24","author":"Breiman","year":"1996","journal-title":"Mach. Learn."},{"issue":"2","key":"10.1016\/S0167-8191(02)00096-0_BIB4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/253262.253325","article-title":"Dynamic itemset counting and implication rules for market basket data","volume":"26","author":"Brin","year":"1997","journal-title":"SIGMOD Record"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB5","doi-asserted-by":"crossref","unstructured":"P.B. Gibbons, Y. Matias, New sampling-based summary statistics for improving approximate query answers, in: Proceedings of ACM Conference on the Management of Data, 1998, pp. 331\u2013342","DOI":"10.1145\/276304.276334"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB6","doi-asserted-by":"crossref","unstructured":"E.H. Han, G. Karypis, V. Kumar, Scalable parallel data mining for association rules, in: Proceedings of ACM Conference on the Management of Data, 1997, pp. 277\u2013288","DOI":"10.1145\/253260.253330"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB7","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, Mining frequent patterns by pattern-growth: Methodology and implications, ACM SIGKDD Explorations 2 (2) (December 2000) (special issue on Scalable Data Mining Algorithms)","DOI":"10.1145\/380995.381002"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB8","unstructured":"Z. Hu, W.-N. Chin, M. Takeichi, Calculating a new data mining algorithm for market basket analysis, in: Second International Workshop on Practical Aspects of Declarative Languages (PADL'00), Lecture Notes in Computer Science, Boston, Massachusetts, Springer Verlag, January 2000"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB9","doi-asserted-by":"crossref","unstructured":"N. Lesh, M. Zaki, M. Ogihara, Mining features for sequence classification, in: Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), San Diego, CA, August 1999","DOI":"10.1145\/312129.312275"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB10","unstructured":"J. Pei, J. Han, B. Mortazavi, H. Pinto, PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth, in: Proceedings of 2001 International Conference on Data Engineering (ICDE'01), Heidelberg, Germany, April 2001"},{"key":"10.1016\/S0167-8191(02)00096-0_BIB11","unstructured":"A. Savasere, E. Omiecinski, S. Navathe, An efficient algorithm for mining association rules in large databases, Technical Report GIT-CC-95-04, College of Computing, Georgia Institute of Technology, 1995"},{"issue":"3","key":"10.1016\/S0167-8191(02)00096-0_BIB12","first-page":"249","article-title":"Questions and answers about BSP","volume":"6","author":"Skillicorn","year":"1997","journal-title":"Sci. Program."},{"key":"10.1016\/S0167-8191(02)00096-0_BIB13","first-page":"407","article-title":"Mining generalized association rules","author":"Srikant","year":"1995","journal-title":"VLDB J."},{"key":"10.1016\/S0167-8191(02)00096-0_BIB14","unstructured":"H. Toivonen, Discovery of frequent patterns in large data collections, Technical Report A-1996-5, Department of Computer Science, University of Helsinki, 1996"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000960?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000960?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T13:58:50Z","timestamp":1555163930000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102000960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0167819102000960"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00096-0","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}