Skip to main content
SpringerLink
Log in

Mining flexible multiple-level association rules in all concept hierarchies

Extended abstract

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1998)

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

Included in the following conference series:

Abstract

We introduce the problem of mining FML (flexible multiple-level) association rules in all concept hierarchies related to a set of user-interested database attributes, as interesting association rules among data items may occur at multiple levels of multiple relevant concept hierarchies. We present a complete classification of all FML rules and show that direct application of previous research can find only a small part of strong FML rules. We propose an efficient method to generate all strong FML rules in all concept hierarchies.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal R., Mannila H., Srikant R., Toivonen H., Verkamo A.: Fast Discovery of Association Rules. In: Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press (1996)

    Google Scholar 

  2. Agrawal R., Imielinski I., Swami A.: Mining Associations between Sets of Items in Massive Databases. In: Proc. of ACM SIGMOD Conf., Washington D.C. (1993)

    Google Scholar 

  3. Chen M., Han J., Yu P.S.: Data Mining: An Overview from Database Perspective. In: IEEE Transactions on Knowledge and Data Engineering, Vol.8, No.6 (1996)

    Google Scholar 

  4. Han J., Pu Y.: Discovery of Multiple-level Association Rules from Large Databases. In: Proc. of the 21st VLDB Conference, Zurich, Switzerland (1995)

    Google Scholar 

  5. Han J., Pu Y.: Dynamic Generation and Refinement of Concept Hierarchies for Knowledge Discovery in Databases. In: AAAI'94 Workshop on Knowledge Discovery in Databases (KDD'94), Seattle, WA (1994) 157–168

    Google Scholar 

  6. Park J. S., Chen M., Yu P. S.: An Effective Hash-Based Algorithm for Mining Association Rules. In: Proc. of ACM-SIGMOD Conf., San Jose, CA (1995)

    Google Scholar 

  7. Savasere A., Omiecinski E., Navathe S.: An Efficient Algorithm for Mining Association Rules in Large Databases. In: 21st VLDB Conf., Zurich, Switzerland (1995)

    Google Scholar 

  8. Srikant R., Agrawal R.: Mining Quantitative Association Rules in Large Relational Tables. In: Proc. of ACM SIGMOD Conf., Montreal, Canada (1996)

    Google Scholar 

  9. Srikant R., Agrawal R.: Mining Generalized Association Rules. In: Proc. of the 21st VLDB Conf., Zurich, Switzerland (1995)

    Google Scholar 

  10. Zaki M. J., Parthasarathy S., Li W.: A Localized Algorithm for Parallel Association Mining. In: 9th Annual ACM Symposium on Parallel Algorithms and Architectures, Newport, Rhode Island (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and Information Technology, Griffith University, QLD4111, Nathan, Australia

    Li Shen & Hong Shen

Authors
  1. Li Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerald Quirchmayr Erich Schweighofer Trevor J.M. Bench-Capon

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shen, L., Shen, H. (1998). Mining flexible multiple-level association rules in all concept hierarchies. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054534

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64950-2

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation