Composition of Mining Contexts for Efficient Extraction of Association Rules

  • Cheikh Talibouya Diop
  • Arnaud Giacometti
  • Dominique Laurent
  • Nicolas Spyratos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2287)

Abstract

Association rule mining often requires the repeated execution of some extraction algorithm for different values of the support and confidence thresholds, as well as for different source datasets. This is an expensive process, even if we use the best existing algorithms. Hence the need for incremental mining, whereby mining results already obtained can be used to accelerate subsequent steps in the mining process.

In this paper, we present an approach for the incremental mining of multidimensional association rules. In our approach, association rule mining takes place in a mining context which specifies the form of rules to be mined. Incremental mining is obtained by combining mining contexts using relational algebra operations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A.I. Verkamo (1996). Fast Discovery of Association Rules. In Advances in Knowledge Discovery and Data Mining, pp 309–328, AAAI-MIT Press.Google Scholar
  2. 2.
    E. Baralis and G. Psaila (1999). Incremental Refinement of Mining Queries. In Proc. of DAWAK’99, pp. 173–182, Florence.Google Scholar
  3. 3.
    S. Brin, R. Motwani, J.D. Ullman and S. Tsur (1997), Dynamic Itemset Counting and Implication Rules for Market Basket Data. In Proc. of SIGMOD Conference, pp. 255–264.Google Scholar
  4. 4.
    A. K. Chandra and P. M. Merlin (1977). Optimal implementation of conjunctive queries in relational databases. In Proc. of the Ninth ACM Symposium on Theory of Computing, pp. 77–90.Google Scholar
  5. 5.
    D. Cheung, J. Han, V. Ng, and C.Y. Wong (1996) Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In Proc. of ICDE’96, pp. 106–114, New Orleans, USA.Google Scholar
  6. 6.
    L. Dehaspe and H. Toivonen (1999). Discovery of Frequent Datalog Patterns. Data Mining and Knowledge Discovery, 3, pp. 7–36, Kluwer Academic Publishers.CrossRefGoogle Scholar
  7. 7.
    C.T. Diop, A. Giacometti, D. Laurent and N. Spyratos (2000). Extraction de régles d’association entre vues: vers une approche incrémentale (French). In Proc. of BDA’2000, pp. 323–344, Blois, France. English version available as Tech. Rep. LI/E3I No. 241, University of Tours, France.Google Scholar
  8. 8.
    C.T. Diop, A. Giacometti, D. Laurent and N. Spyratos (2001). Combining Mining Tasks through Relational Algebra. Techn. Rep. LI/E3I, Tours, France (full paper, to appear).Google Scholar
  9. 9.
    J. Han, Y. Fu, K. Kopersky and O. Zaiane (1996). DMQL: A Data Mining Query Language for Relational Databases. In Proc. of DMKD’96 (SIGMOD’96 Workshop on KDD), Montreal, Canada.Google Scholar
  10. 10.
    T. Imielinski and A. Virmani (1999). MSQL: A Query Language for Database Mining. Data Mining and Knowledge Discovery, Vol. 3, No. 4, pp. 373–408, Kluwer Academic Publishers.CrossRefGoogle Scholar
  11. 11.
    M. Kamber, J. Han, J. Chiang (1997). Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes. In Proc. of KDD’97, pp. 207–210, Newport Beach, USA.Google Scholar
  12. 12.
    H. Mannila, H. Toivonen (1997). Levelwise Search and Borders of Theories in Knowledge Discovery. Techn. Rep. C-1997-8, University of Helsinki.Google Scholar
  13. 13.
    T. Morzy, M. Wojciechowski and M. Zakrzewicz (2000). Materialized Data Mining Views. In Proc. of PKDD’2000, Springer Verlag, pp. 65–74, France.Google Scholar
  14. 14.
    B. Nag, P. Deshpande and D.J. DeWitt (1999). Using a Knowledge Cache for Interactive Discovery of Association Rules. In Proc. of KDD’99, pp. 244–253, San Diego, USA.Google Scholar
  15. 15.
    B. Nag, P. Deshpande and D.J. DeWitt (2001). Caching for Multi-dimensional Data Mining Queries. In Proc. of SCI’2001, Orlando, Florida.Google Scholar
  16. 16.
    J.S. Park, M. Chen, P.S. Yu (1995). An Effiective Hash Based Algorithm for Mining Association Rules. SIGMOD Conference, pp. 175–186.Google Scholar
  17. 17.
    A. Savasere, E. Omiecinski and S.B. Navathe (1995). An Efficient Algorithm for Mining Association Rules in Large Databases. VLDB Conference, pp. 432–444.Google Scholar
  18. 18.
    S. Thomas, S. Bodagala, K. Alsabti and Sanjay Ranka (1997). An Efficient Algorithm for the Incremental Updation of Association Rules in Large Databases. In Proc. of KDD’97, pp. 263–266, Newport Beach, USA.Google Scholar
  19. 19.
    S. Tsur and al. (1998), Query Flocks: A Generalization of Association-Rule Mining. SIGMOD Conference, pp. 1–12.Google Scholar
  20. 20.
    J.D. Ullman (1989). Principles of Databases and Knowledge-Base Systems. Vol. 1–2, Computer Science Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Cheikh Talibouya Diop
    • 1
    • 3
  • Arnaud Giacometti
    • 1
  • Dominique Laurent
    • 1
  • Nicolas Spyratos
    • 2
  1. 1.LIUniversité de ToursBloisFrance
  2. 2.LRIUniversité Paris 11Orsay CedexFrance
  3. 3.Université Gaston BergerSaint-LouisSenegal

Personalised recommendations