Newer and newer parallel architectures being developed raise a strong demand for high-level and programmer-friendly parallel tools. We show some results regarding mining of association rules, a well-known Data Mining algorithm, which we ported from sequential to parallel within the PQE2000/SkIE environment. The main goals achieved are the low effort spent in parallelizing the code, the machine independence of the application produced, source code portability and performance portability. Here we report test results for the same parallel program on three different architectures. © Springer-Verlag Berlin Heidelberg 1999.
CITATION STYLE
Becuzzi, P., Coppola, M., & Vanneschi, M. (1999). Mining of association rules in very large databases: A structured parallel approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 1441–1450). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_204
Mendeley helps you to discover research relevant for your work.