Skip to main content
SpringerLink
Log in
Book cover

International Conference on Discovery Science

DS 1998: Discovey Science pp 232–243Cite as

Query-Initiated Discovery of Interesting Association Rules

  • Conference paper
  • First Online:

  • 570 Accesses

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

Abstract

The approach presented in this paper is to discover association rules based on a user’s query. Of the many issues in rule discovery, relevancy, interestingness, and supportiveness of association rules are considered in this paper. For a given user query, a database can be partitioned into three views: a positively-related-query view, a negatively-related-query view, and an unrelated-query view

We present a methodology for data mining and rule discovery that incorporates pattern extraction from the three types of query views with pattern spanning to enlarge the scope of a pattern and its derived association rule. The rule discovery process involves several interrelated steps: 1) pattern extraction from both positively- and/or negatively-related query views, 2) pattern association across attributes to enhance the semantics of patterns, while performing 3) pattern spanning within an attribute domain to enhance the supportiveness of the resulting pattern

The contributions of the paper includes the specification and development of the data mining method and associated tool that combines the operations of association and spanning on query views to derive semantically interesting patterns. These patterns can then be used in decision making because the patterns were mined from the user’s original hypothesis as expressed by the query

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about 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 association rules between sets of items in large databases. In Sushil Jajodia, editor, Proc. ACM SIGMOD Intl. Conf. on Management of Data, pages 207–216, Washington D.C., 1993.

    Google Scholar 

  2. S. Brin, R Motwani, and C Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Peckman, editor, Proc. ACM SIGMOD Intl. Conf. on Management of Data, pages 265–276, Tucson, Arizona, 1997.

    Google Scholar 

  3. S. Brin, R Motwani, J. Ullman, and S. Tsur. Dynamic itemset counting and implication rules. In Peckman, editor, Proc. ACM SIGMOD Intl. Conf. on Management of Data, pages 255–264, Tucson, Arizona, 1997.

    Google Scholar 

  4. Y. Cai, N. Cercone, and J. Han. An attribute-oriented approach for learning classification rules from relational databases. In the Sixth Int’l Conf. of Data Engineering, pages 281–288, Los Angeles, Calif, 1990.

    Google Scholar 

  5. R. Fagin. Finite model theory-a personal perspective. In S. Abiteboul and P. Kanellakis, editors, Proc. Int’l Conf on Database Theory, 1990.

    Google Scholar 

  6. T. Fukuda, Y. Morimoto, and S. Morishita. Constructing efficient decision trees by using optimized numeric association rules. In Proc. Intl. Conf. on Very Large Data Bases, pages 146–155, Bombay, India, 1996.

    Google Scholar 

  7. C. Glymour, D. Madigan, D. Pregibon, and P. Smyth. Statistical themes and lessons for data mining. Data Mining and Knowledge Discovery, 1(1):11–28, 1997.

    Article  Google Scholar 

  8. J. Han. Towards on-line analytical mining in large databases. ACM Sigmod Record, 27(1):97–107, 1998.

    Article  Google Scholar 

  9. J. Han, Y. Cai, and N. Cercone. Data-driven discovery of quantitative rules in relational databases. IEEE Transactions on Knowledge and Data Engineering, 5(1):29–40, 1993.

    Article  Google Scholar 

  10. K. Kaufman, R. Michalski, and L. Kerschberg. Mining for knowledge in databases: Goals and general description of the INLEN system. Proc. IJCAI-89 Workshop on Knowledge Discovery in Databases, pages 158–172, 1989.

    Google Scholar 

  11. A. Silberschatz and A. Tuzhilin. What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering, 8(6):970–974, 1996.

    Article  Google Scholar 

  12. B. G. Silverman, M. R. Hieb, and T. M. Mezher. Unsupervised discovery in an operational control setting. In Gregory Piatetsky-Shapiro and William J. Frawley, editors, Knowledge Discovery in Databases, pages 432–448. MIT Press, 1991.

    Google Scholar 

  13. Jong P. Yoon and Larry Kerschberg. A framework for knowledge discovery and evolution in databases. IEEE Transactions on Knowledge and Data Engineering, 5(6):973–978, December1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Sookmyung W. University, Seoul, 140-742, Korea

    Jongpil Yoon

  2. Information and Software Systems Engineering Dept., George Mason University, Fairfax, VA, 22030-4444, USA

    Larry Kerschberg

Authors
  1. Jongpil Yoon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Larry Kerschberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Kyushu University, Fukuoka, 812-8581, USA

    Setsuo Arikawa

  2. Institute of Scientific and Industrial Research Devision of Intelligent Systems Science, Osaka University, 8-1 Mihogaoka, Ibaraki, Osaka, 567-0047, Japan

    Hiroshi Motoda

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoon, J., Kerschberg, L. (1998). Query-Initiated Discovery of Interesting Association Rules. In: Arikawa, S., Motoda, H. (eds) Discovey Science. DS 1998. Lecture Notes in Computer Science(), vol 1532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49292-5_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-49292-5_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation