{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:02:42Z","timestamp":1770498162928,"version":"3.49.0"},"reference-count":41,"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)00095-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T19:55:37Z","timestamp":1034625337000},"page":"793-813","source":"Crossref","is-referenced-by-count":26,"title":["High-performance data mining with skeleton-based structured parallel programming"],"prefix":"10.1016","volume":"28","author":[{"given":"Massimo","family":"Coppola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Vanneschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(02)00095-9_BIB1","first-page":"21","article-title":"Heterogeneous HPC environments","volume":"vol. 1470 of LNCS","author":"Vanneschi","year":"1998"},{"issue":"4","key":"10.1016\/S0167-8191(02)00095-9_BIB2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/4434.736429","article-title":"PQE2000: HPC tools for industrial applications","volume":"6","author":"Vanneschi","year":"1998","journal-title":"IEEE Concurrency: Parallel, Distributed and Mobile Computing"},{"issue":"13\u201314","key":"10.1016\/S0167-8191(02)00095-9_BIB3","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1016\/S0167-8191(99)00072-1","article-title":"SkIE: A heterogeneous environment for HPC applications","volume":"25","author":"Bacci","year":"1999","journal-title":"Parallel Computing"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB4","first-page":"1441","article-title":"Mining of association rules in very large databases: a structured parallel approach","volume":"vol. 1685 of LNCS","author":"Becuzzi","year":"1999"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB5","doi-asserted-by":"crossref","unstructured":"P. Becuzzi, M. Coppola, S. Ruggieri, M. Vanneschi, Parallelisation of C4.5 as a particular divide and conquer computation, in: Rolim et al. [39], pp. 382\u2013389","DOI":"10.1007\/3-540-45591-4_50"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB6","doi-asserted-by":"crossref","unstructured":"G. Carletti, M. Coppola, Structured parallel programming and shared objects: experiences in data mining classifiers, in: G. Joubert, A. Murli, F. Peters, M. Vanneschi (Eds.), Parallel Computing, Advances and Current Issues, Proc. of the Internat. Conf. ParCo 2001, Naples, Italy. Imperial College Press, London, 2002","DOI":"10.1142\/9781860949630_0050"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB7","article-title":"Experiments in parallel clustering with DBSCAN","volume":"vol. 2150 of LNCS","author":"Arlia","year":"2001"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB8","unstructured":"M. Vanneschi, The programming model of ASSIST, an environment for parallel and distributed portable applications. To appear in Parallel Computing"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB9","doi-asserted-by":"crossref","unstructured":"W.A. Maniatty, M.J. Zaki, A requirement analysis for parallel KDD systems, in: Rolim et al. [39], pp. 358\u2013365","DOI":"10.1007\/3-540-45591-4_47"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB10","doi-asserted-by":"crossref","unstructured":"G. Williams, I. Altas, S. Bakin, P. Christen, M. Hegland, A. Marquez, P. Milne, R. Nagappan, S. Roberts, The integrated delivery of large-scale data mining: the ACSys data mining project, in: Zaki and Ho [40], pp. 24\u201354","DOI":"10.1007\/3-540-46502-2_2"},{"issue":"2","key":"10.1016\/S0167-8191(02)00095-9_BIB11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/280277.280278","article-title":"Models and languages for parallel computation","volume":"30","author":"Skillicorn","year":"1998","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB12","series-title":"Foundations of Parallel Programming","author":"Skillicorn","year":"1994"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB13","first-page":"19","article-title":"Skeletons for Structured Parallel Programming","author":"Darlington","year":"1995"},{"issue":"4","key":"10.1016\/S0167-8191(02)00095-9_BIB14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/4434.806976","article-title":"Strategies for parallel data mining","volume":"7","author":"Skillicorn","year":"1999","journal-title":"IEEE Concurrency"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB15","doi-asserted-by":"crossref","unstructured":"M. J. Zaki, Parallel and distributed data mining: an introduction, in: Zaki and Ho [40], pp. 1\u201323","DOI":"10.1007\/3-540-46502-2_1"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB16","doi-asserted-by":"crossref","unstructured":"S. Partharasarty, S. Dwarkadas, M. Ogihara, Active mining in a distributed setting, in: Zaki and Ho [40], pp. 65\u201382","DOI":"10.1007\/3-540-46502-2_4"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB17","doi-asserted-by":"crossref","unstructured":"S. Bailey, E. Creel, R. Grossman, S. Gutti, H. Sivakumar, A high performance implementation of the data space transfer protocol (DSTP), in: Zaki and Ho [40], pp. 55\u201364","DOI":"10.1007\/3-540-46502-2_3"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB18","series-title":"Advances in Knowledge Discovery and Data Mining","year":"1996"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB19","unstructured":"A. Mueller, Fast sequential and parallel algorithms for association rule mining: a comparison, Tech. Rep. CS-TR-3515, Department of Computer Science, University of Maryland, College Park, MD, August 1995"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB20","first-page":"209","article-title":"Data mining, hypergraph transversals, and machine learning (ext. abstract)","author":"Gunopulos","year":"1997"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB21","first-page":"432","article-title":"An efficient algorithm for mining association rules in large databases","author":"Savasere","year":"1995"},{"issue":"6","key":"10.1016\/S0167-8191(02)00095-9_BIB22","doi-asserted-by":"crossref","first-page":"962","DOI":"10.1109\/69.553164","article-title":"Parallel mining of association rules","volume":"8","author":"Agrawal","year":"1996","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB23","first-page":"217","article-title":"When Is \u201cNearest Neighbor\u201d Meaningful?","volume":"vol. 1540 of LNCS","author":"Beyer","year":"1999"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB24","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","author":"Ester","year":"1996"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB25","first-page":"322","article-title":"The R*-tree: an efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB26","first-page":"28","article-title":"The X-Tree: an index structure for high-dimensional data","author":"Bertchold","year":"1996"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB27","series-title":"C4.5: Programs for Machine Learning","author":"Quinlan","year":"1993"},{"issue":"2","key":"10.1016\/S0167-8191(02)00095-9_BIB28","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/69.991727","article-title":"Efficient C4.5","volume":"14","author":"Ruggieri","year":"2002","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB29","first-page":"437","article-title":"Parallel induction algorithms for data mining","volume":"vol. 1280 of LNCS","author":"Darlington","year":"1997"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB30","doi-asserted-by":"crossref","unstructured":"M. Mehta, R. Agrawal, J. Rissanen, SLIQ: a fast scalable classifier for data mining, in: Proceedings of the Fifth International Conference on Extending Database Technology, 1996","DOI":"10.1007\/BFb0014141"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB31","unstructured":"J. Shafer, R. Agrawal, M. Mehta, SPRINT: a scalable parallel classifier for data mining, in: Proceedings of the 22nd VLDB Conference, 1996"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB32","doi-asserted-by":"crossref","unstructured":"M.V. Joshi, G. Karypis, V. Kumar, ScalParC: a new scalable and efficient parallel classification algorithm for mining large datasets, in: Proceedings of 1998 International Parallel Processing Symposium, 1998","DOI":"10.1109\/IPPS.1998.669983"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB33","first-page":"555","article-title":"Parallel out-of-core divide-and-conquer techniques with application to classification trees","author":"Sreenivas","year":"1999"},{"issue":"3","key":"10.1016\/S0167-8191(02)00095-9_BIB34","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/A:1009832825273","article-title":"Parallel formulations of decision-tree classification algorithms","volume":"3","author":"Srivastava","year":"1999","journal-title":"Data Mining and Knowledge Discovery: An International Journal"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB35","first-page":"411","article-title":"Using available remote memory for parallel data mining application","author":"Oguchi","year":"2000"},{"issue":"2","key":"10.1016\/S0167-8191(02)00095-9_BIB36","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/384192.384193","article-title":"External memory algorithms and data structures: dealing with MASSIVE DATA","volume":"33","author":"Vitter","year":"2001","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB37","doi-asserted-by":"crossref","unstructured":"D. Goswami, A. Singh, B.R. Preiss, Using object-oriented techniques for realizing parallel architectural skeletons, in: Matsuoka et al. [41], pp. 130\u2013141","DOI":"10.1007\/10704054_14"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB38","doi-asserted-by":"crossref","unstructured":"B. Smolinski, S. Kohn, N. Elliott, N. Dykman, Language interoperability for high-performance parallel scientific components, in: Matsuoka et al. [41], pp. 61\u201371","DOI":"10.1007\/10704054_7"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB39","volume":"vol. 1800 of LNCS","year":"2000"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB40","volume":"vol. 1759 of LNAI","year":"1999"},{"key":"10.1016\/S0167-8191(02)00095-9_BIB41","volume":"vol. 1732 of LNCS","year":"1999"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000959?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819102000959?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:25:24Z","timestamp":1580876724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819102000959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0167819102000959"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(02)00095-9","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}