Skip to main content

Association rules... and what’s next? — Towards second generation data mining systems

  • Invited Papers
  • Conference paper
  • First Online:
Advances in Databases and Information Systems (ADBIS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1475))

Abstract

In the process of rule generation from databases, the volume of generated rules often greatly exceeds the size of the underlying database. Typically only a small fraction of that large volume of rules is of any interest to the user. We believe that the main challenge facing database mining is what to do with the rules after having generated them. Rule post-processing involves selecting rules which are relevant or interesting, building applications which use the rules and finally, combining rules together to form a larger and more meaningful statements. In this paper we propose an application programming interface which enables faster development of applications which rely on rules. We also provide a rule query language which allows both selective rule generation as well as retrieval of selected categories of rules from the pre-generated rule collections.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining associations rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD’93), pages 207–216, Washington D.C., May 1993.

    Google Scholar 

  2. Rakesh Agrawal and R. Srikant. Fast algorithms for mining association rules. In vldb94, pages 487–499, Santiago, Chile, 1994.

    Google Scholar 

  3. Dirk Bartels, Mark Berler, Jeff Eastmane, Sophie Gamerman, David Jordan, Adam Springer, Henry Strickland, and Drew Wade. The Object Database Standard: ODMG 2.0. Morgan Kaufmann, San Francisco, CA, 1997.

    Google Scholar 

  4. Sergey Brin, Rajeev Motwani, Jeffrey Ullman, and Shalom Tsur. Dynamic itemset counting and implication rules for market basket data. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD’97), pages 255–264, Tuscon, Arizona, May 1997.

    Google Scholar 

  5. J. Han and Y. Fu. Discovery of multiple level association rules from large databases. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB’95), pages 420–431, Zurich, Switzerland, Sept 1995.

    Google Scholar 

  6. J. Han, Y. Fu, K. Koperski, W. Wang, and O. Zaiane. DMQL: A data mining query language for relational databases. In DMKD-96 (SIGMOD-96 Workshop on KDD), Montreal, Canada, June 1996.

    Google Scholar 

  7. T. Imielinski, A. Virmani, and A. Abdulghani. Datamine: Application programming interface and query language for database mining. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD’96), Portland, Oregon, August 1996.

    Google Scholar 

  8. Tomasz Imielinski and Heikki Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58–64, november 1996.

    Article  Google Scholar 

  9. Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Discovering frequent episodes in sequences. In Usama M. Fayyad and Ramasamy Uthurusamy, editors, Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD’95), pages 210–215, Montreal, Canada, August 1995. AAAI Press.

    Google Scholar 

  10. Rosa Meo, Giuseppe Psaila, and Stefano Ceri. A new sql-like operator for mining association rules. In Proceedings of the 22nd International Conference on Very Large Data Bases (VLDB’96), pages 122–133, Bombay, India, Sept 1996.

    Google Scholar 

  11. Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, and Alex Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD’98), Seattle, Washington, June 1998.

    Google Scholar 

  12. Jong Soo Park, Ming-Syan Chen, and Philip S. Yu. An effective hash based algorithm for mining association rules. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD’95), pages 175–186, San Jose, California, may 1995.

    Google Scholar 

  13. Sunita Sarawagi, Shiby Thomas, and Rakesh Agrawal. Integrating association rule mining with relational database systems: Alternatives and implications. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD’98), Seattle, Washington, June 1998.

    Google Scholar 

  14. Ashok Savasere, Edward Omiecinski, and Shamkant Navathe. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB’95), pages 432–444, Zurich, Switzerland, Sept 1995.

    Google Scholar 

  15. Ramakrishnan Srikant and Rakesh Agrawal. Mining generalized association rules. In Proceedings of the 21st International Conference on Very Large Data Bases (VLDB’95), pages 407–419, Zurich, Switzerland, Sept 1995.

    Google Scholar 

  16. Aashu Virmani. Second generation data mining: Concepts and implementation. PhD Thesis, Rutgers University, April 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Witold Litwin Tadeusz Morzy Gottfried Vossen

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Imieliński, T., Virmani, A. (1998). Association rules... and what’s next? — Towards second generation data mining systems. In: Litwin, W., Morzy, T., Vossen, G. (eds) Advances in Databases and Information Systems. ADBIS 1998. Lecture Notes in Computer Science, vol 1475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057713

Download citation

  • DOI: https://doi.org/10.1007/BFb0057713

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64924-3

  • Online ISBN: 978-3-540-68309-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics