Advertisement

Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets

  • Adriano Veloso
  • Matthew Eric Otey
  • Srinivasan Parthasarathy
  • Wagner MeiraJr.
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2913)

Abstract

Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/O resources when the data is dynamic, and they impose excessive communication overhead when the data is distributed. As a result, the knowledge discovery process is harmed by slow response times. Efficient implementation of incremental data mining ideas in distributed computing environments is thus becoming crucial for ensuring scalability and facilitating knowledge discovery when data is dynamic and distributed. In this paper we address this issue in the context of frequent itemset mining, an important data mining task. Frequent itemsets are most often used to generate correlations and association rules, but more recently they have been used in such far-reaching domains as bio-informatics and e-commerce applications. We first present an efficient algorithm which dynamically maintains the required information in the presence of data updates without examining the entire dataset. We then show how to parallelize the incremental algorithm, so that it can asynchronously mine frequent itemsets. We also propose a distributed algorithm, which imposes low communication overhead for mining distributed datasets. Several experiments confirm that our algorithm results in excellent execution time improvements.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agrawal, R., Shafer, J.: Parallel mining of association rules. IEEE Trans. on Knowledge and Data Engg. 8, 962–969 (1996)CrossRefGoogle Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of the 20th Int’l Conf. on Very Large Databases, SanTiago, Chile (June 1994)Google Scholar
  3. 3.
    Cheung, D., Han, J., Ng, V., Fu, A., Fu, Y.: A fast distributed algorithm for mining association rules. In: 4th Int’l. Conf. Parallel and Distributed Info. Systems (1996)Google Scholar
  4. 4.
    Cheung, D., Lee, S., Kao, B.: A general incremental technique for maintaining discovered association rules. In: Proc. of the 5th Int’l. Conf. on Database Systems for Advanced Applications, April 1997, pp. 1–4 (1997)Google Scholar
  5. 5.
    Cheung, D., Ng, V., Fu, A., Fu, Y.: Efficient mining of association rules in distributed databases. IEEE Trans. on Knowledge and Data Engg. 8, 911–922 (1996)CrossRefGoogle Scholar
  6. 6.
    Ganti, V., Gehrke, J., Ramakrishnan, R.: Demon: Mining and monitoring evolving data. In: Proc. of the 16th Int’l Conf. on Data Engineering, San Diego, USA, pp. 439–448 (2000)Google Scholar
  7. 7.
    Gouda, K., Zaki, M.: Efficiently mining maximal frequent itemsets. In: Proc. of the 1st IEEE Int’l Conf. on Data Mining, San Jose, USA (November 2001)Google Scholar
  8. 8.
    Han, E.-H., Karypis, G., Kumar, V.: Scalable parallel data mining for association rules. In: ACM SIGMOD Conf. Management of Data (1997)Google Scholar
  9. 9.
    Lee, S., Cheung, D.: Maintenance of discovered association rules: When to update? Research Issues on Data Mining and Knowledge Discovery (1997)Google Scholar
  10. 10.
    Park, B.-H., Kargupta, H.: Distributed data mining: Algorithms, systems, and applications. In: Ye, N. (ed.) Data Mining Handbook (2002)Google Scholar
  11. 11.
    Park, J.S., Chen, M., Yu, P.S.: CACTUS - clustering categorical data using summaries. In: ACM Int’l. Conf. on Information and Knowledge Management (1995)Google Scholar
  12. 12.
    Parthasarathy, S., Ramakrishnan, A.: Parallel incremental 2d discretization. In: Proc. IEEE Int’l Conf. on Parallel and Distributed Processing (2002)Google Scholar
  13. 13.
    Schuster, A., Wolff, R.: Communication efficient distributed mining of association rules. In: ACM SIGMOD Int’l. Conf. on Management of Data (2001)Google Scholar
  14. 14.
    Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An efficient algorithm for the incremental updation of association rules. In: Proc. of the 3rd ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining (August 1997)Google Scholar
  15. 15.
    Veloso, A., Meira Jr., W., Bunte, M., Parthasarathy, S., Zaki, M.: Mining frequent itemsets in evolving databases. In: Proc. of the 2nd SIAM Int’l Conf. on Data Mining, USA (2002)Google Scholar
  16. 16.
    Zaki, M., Parthasarathy, S., Ogihara, M., Li, W.: New parallel algorithms for fast discovery of association rules. Data Mining and Knowledge Discovery: An International Journal 4(1), 343–373 (1997)CrossRefGoogle Scholar
  17. 17.
    Zaki, M.J.: Parallel and distributed association mining:A survey. IEEE Concurrency 7(4), 14–25 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Adriano Veloso
    • 1
    • 2
  • Matthew Eric Otey
    • 2
  • Srinivasan Parthasarathy
    • 2
  • Wagner MeiraJr.
    • 1
  1. 1.Computer Science DepartmentUniversidade Federal de Minas GeraisBrazil
  2. 2.Department of Computer and Information ScienceThe Ohio State UniversityUSA

Personalised recommendations