Skip to main content
Log in

Designing Templates for Mining Association Rules

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

Current approaches to data mining usually address specific userrequests, while no general design criteria for the extraction of associationrules are available for the end-user. In this paper, we propose aclassification of association rule types, which provides a general frameworkfor the design of association rule mining applications. Based on theidentified association rule types, we introduce predefined templates as ameans to capture the user specification of mining applications. Furthermore,we propose a general language to design templates for the extraction ofarbitrary association rule types.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc.ACM SIGMOD Conference on Management of Data, pages 207–216, Washington, D.C., May 1993. British Columbia.

  • R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In P. S. Usama M. Fayyad, G. Piatetsky-Shapiro and R. U. (Eds), editors, Knowledge Discovery in Databases, volume 2. AAAI/MIT Press, Santiago, Chile, September 1995.

    Google Scholar 

  • R. Agrawal, G. Psaila, E. L. Wimmers, and M. Zait. Querying shapes of histories. In Proceedings of the 21st VLDB Conference, Zurich, Switzerland, September 1995.

  • R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20st VLDB Conference, Santiago, Chile, September 1994.

  • R. Agrawal and R. Srikant. Mining sequential patterns. In International Conference on Data Engineering, Taipei, Taiwan, March 1995.

  • A Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st VLDB Conference, Zurich, Swizerland, 1995.

  • U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. AAAI Press / The MIT Press, 1996.

  • J. Han and Fu. Discovery of multiple-level association rules from large databases. In Proceedings of the 21st VLDB Conference, Zurich, Switzerland, September 1995.

  • H. Toivonen. Sampling large databases for association rules. In Proceedings of the 22nd VLDB Conference, Bombay (Mumbai), India, 1996.

  • T. Imielinski. From file mining to database mining. In Proceedings of SIGMOD-96Workshop on Research Issues on Data Mining and knowledge Discovery, pages 35–39, May 1996.

  • R. Meo, G. Psaila, and S. Ceri. A new sql-like operator for mining association rules. In Proceedings of the 22st VLDB Conference, Bombay, India, September 1996.

  • J. S. Park, M. Shen, and P. S. Yu. An effective hash based algorithm for mining association rules. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, San Jose, California, May 1995.

  • R. Srikant and R. Agrawal. Mining generalized association rules. In Proceedings of the 21st VLDB Conference, Zurich, Switzerland, September 1995.

  • R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proceedings of the ACM-SIGMOD International Conference on the Management of Data, San Jose, California, May 1996.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baralis, E., Psaila, G. Designing Templates for Mining Association Rules. Journal of Intelligent Information Systems 9, 7–32 (1997). https://doi.org/10.1023/A:1008637019359

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008637019359

Navigation