Skip to main content

User-Defined Association Mining

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2035))

Included in the following conference series:

Abstract

Discovering interesting associations of events is an important data mining task. In many real applications, the notion of association, which defines how events are associated, often depends on the particular application and user requirements. This motivates the need for a general framework that allows the user to specify the notion of association of his/her own choices. In this paper we present such a framework, called the UDA mining (User-Defined Association Mining). The approach is to define a language for specifying a broad class of associations and yet efficient to be implemented. We show that (1) existing notions of association mining are instances of the UDA mining, and (2) many new ad-hoc association mining tasks can be defined in the UDA mining framework.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, T. Imielinski, and A. Swami: Mining Association Rules between Sets of Items in Large Datasets. SIGMOD 1993, 207–216

    Google Scholar 

  2. R. Agrawal and R. Srikant: Fast Algorithm for Mining Association Rules. VLDB 1994, 487–499

    Google Scholar 

  3. C.C. Aggarwal and P.S. Yu: A New Framework for Itemset Generation. PODS 1998, 18–24

    Google Scholar 

  4. S. Brin, R. Motwani, and C. Silverstein: Beyond Market Baskets: Generalizing Association Rules to Correlations. SIGMOD 1997, 265–276

    Google Scholar 

  5. G.F. Cooper: A Simple Constraint-based Algorithm for Efficiently Mining Observational Databases for Causal Relationships. Data Mining and Knowledge Discovery, No. 1, 203–224, 1997, Kluwer Academic Publishers

    Google Scholar 

  6. G. Dong, J. Li: Efficient Mining of Emerging Patterns: Discovering Trends and Differences. SIGKDD 1999, 43–52

    Google Scholar 

  7. D. Heckerman: Bayesian Networks for Data Mining. Data Mining and Knowledge Discovery, Vol. 1, 1997, 79–119

    Article  Google Scholar 

  8. J. Han, Y. Fu, W. Wang, K. Koperski, O. Zaiane: DMQL: A Data Mining Query Language for Relational Databases. SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, 1996, 27–34

    Google Scholar 

  9. T. Imielinski and H. Mannila: A Database Perspective on Knowledge Discovery. Communications of ACM, 39(11), 58–64, 1996

    Article  Google Scholar 

  10. T. Imielinski, A. Virmani, and A. Abdulghani: DataMine: Application Programming Interface and Query Language for Database Mining. KDD 1996, 256–261

    Google Scholar 

  11. H. Mannila: Methods and Problems in Data Mining. International Conference on Database Theory, 1997, 41–55, Springer-Verlag

    Google Scholar 

  12. R. Meo, G. Psaila, S. Ceri: A New SQL-like Operator for Mining Association Rules. VLDB 1996, 122–133

    Google Scholar 

  13. R.T. Ng, L.V.S. Lakshmanan, J. Han, A Pang: Exploratory Mining and Pruning Optimizations of Constrained Associations Rules. SIGMOD 1998, 13–24

    Google Scholar 

  14. C. Silverstein, S. Brin, R. Motwani, J. Ullman: Scalable Techniques for Mining Causal Structures. VLDB 1998, 594–605

    Google Scholar 

  15. P. Smyth, R.M. Goodman: An Information Theoretic Approach to Rule Induction from Databases. IEEE Transactions on Knowledge and Data Engineering, Vol. 4,No. 4, 301–316, August 1992.

    Article  Google Scholar 

  16. R. Srikant, Q. Vu, and R. Agrawal: Mining Association Rules with Item Constraints. KDD 1997, 67–73

    Google Scholar 

  17. D. Tsur, J. Ullman, S. Abiteboul, C. Clifton, R. Motwani, S. Nestorov, A. Rosenthal: Query Flocks: a Generalization of Association-Rule Mining. SIGMOD 1998, 1–12

    Google Scholar 

  18. T.D. Wickens: Multiway Contingency Tables Analysis for the Social Sciences. Lawrence Brlbaum Associates, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, K., He, Y. (2001). User-Defined Association Mining. In: Cheung, D., Williams, G.J., Li, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2001. Lecture Notes in Computer Science(), vol 2035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45357-1_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-45357-1_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41910-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics