Mining of Association Rules in Very Large Databases: A Structured Parallel Approach⋆

  • P. Becuzzi
  • M. Coppola
  • M. Vanneschi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1685)


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.


Completion Time Association Rule Minimum Support Frequent Itemset Parallel Architecture 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [1]
    R. Agrawal and J.C. Shafer. Parallel mining of association rules: Design, implementation and experience. IEEE Transactions on Knowledge and Data Engineering, 8(6), December 1996. IBM Research Report RJ 10004, January 1996.Google Scholar
  2. [2]
    P. Becuzzi, M. Coppola, D. Laforenza, S. Ruggieri, D. Talia, and M. Vanneschi. Data analysis and data mining with parallel architectures: Techniques and experiments. Technical report, project “Parallel Intelligent Systems for Tax Fraud Detection”, December 1998.Google Scholar
  3. [3]
    U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. AAAI press / MIT press, 1996.Google Scholar
  4. [4]
    D. Gunopulos, H. Mannila, R. Khardon, and H. Toivonen. Data mining, hypergraph transversals, and machine learning (ext. abstract). In PODS’ 97. Proc. of the 16th ACM Symposium on Principles of Database Systems, May 1997, Tucson, Arizona, pages 209–216, New York, 1997. ACM Press.Google Scholar
  5. [5]
    E.H. Han, G. Karypis, and V. Kumar. Scalable parallel data mining for association rules. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, volume 26,2 of SIGMOD Record, pages 277–288, New York, May13-15 1997. ACM Press.Google Scholar
  6. [6]
    Andreas Mueller. Fast sequential and parallel algorithms for association rule mining: A comparison. Technical Report CS-TR-3515, Dept. of Computer Science, Univ. of Maryland, College Park, MD, August 1995.Google Scholar
  7. [7]
    A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In U. Dayal, P.M.D. Gray, and S. Nishio, editors, VLDB’ 95: Proc. of the 21st Int. Conf. on Very Large Data Bases, Zurich, Switzerland, pages 432–444, Los Altos, CA, 1995. Morgan Kaufmann Publishers.Google Scholar
  8. [8]
    T. Shintani and M. Kitsuregawa. Hash based parallel algorithms for mining association rules. In PDIS’ 96: 4th Int. Conf. on Parallel and Distributed Information Systems, pages 19–30, Los Alamitos, Ca., USA, December 1996. IEEE Computer Society Press.Google Scholar
  9. [9]
    M. Vanneschi. Heterogeneous HPC Environments. In David Pritchard and Jeff Reeve, editors, Euro-Par’ 98 Parallel Processing, volume 1470 of LNCS, pages 21–34, Southampton, UK, September 1998. ACM / IFIR, Springer-Verlag.Google Scholar
  10. [10]
    M. Vanneschi. PQE2000: HPC tools for industrial applications. IEEE Concurrency: Parallel, Distributed & Mobile Computing, 6(4):68–73, Oct-Dec 1998.Google Scholar
  11. [11]
    M.J. Zaki. Scalable Data Mining for Rules. PhD thesis, University of Rochester, Rochester, New York, 1998.Google Scholar
  12. [12]
    M.J. Zaki, S. Parthasarathy, and M. Ogihara. Parallel algorithms for discovery of association rules. In Data Mining and Knowledge Discovery, volume 1. Kluwer Academic Publishers, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • P. Becuzzi
    • 1
  • M. Coppola
    • 1
  • M. Vanneschi
    • 1
  1. 1.Dipartimento di InformaticaUniversità degli Studi di PisaItaly

Personalised recommendations