Skip to main content

An Analysis of Quantitative Measures Associated with Rules

  • Conference paper
  • First Online:
Methodologies for Knowledge Discovery and Data Mining (PAKDD 1999)

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

Included in the following conference series:

Abstract

In this paper, we analyze quantitative measures associated with if-then type rules. Basic quantities are identified and many existing measures are examined using the basic quantities. The main objective is to provide a synthesis of existing results in a simple and unified framework. The quantitative measure is viewed as a multi-facet concept, representing the confidence, uncertainty, applicability, quality, accuracy, and interestingness of rules. Roughly, they may be classified as representing one-way and two-way supports.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Imielinski, T., and Swami, A. Mining association rules between sets of items in large databases, Proceedings of the ACM SIGMOD International Conference on the Management of Data, 207–216, 1993.

    Google Scholar 

  2. Ali, K., Manganaris, S., and Srikant, R. Partial classification using association rules, Proceedings of KDD-97, 115–118, 1997.

    Google Scholar 

  3. BüNuchter, O. and Wirth R. Discovery of association rules over ordinal data:a new and faster algorithm and its application to basket analysis, in [30], 36–47, 1998.

    Google Scholar 

  4. Chen, M., Han, J. and Yu, P.S. Data mining, an overview from a databases perspective, IEEE Transactions on Knowledge and Data Engineering, 8, 866–883, 1996.

    Article  Google Scholar 

  5. Choubey, S.K., Deogun, J.S., Raghavan, V.V., and Sever, H. Comparison of classification methods, Proceedings of 1997 Joint Conference in Information Sciences, 371–374, 1997.

    Google Scholar 

  6. Duda, R.O., Gasching, J., and Hart, P.E. Model design in the Prospector consultant system for mineral exploration, in: Webber, B.L. and Nilsson, N.J. (Eds.), Readings in Artificial Intelligence, Tioga, Palo Atlto, CA, 334–348, 1981.

    Google Scholar 

  7. Fayyad, U.M, Piatetsky-Shapiro, G., Smyth, P., and Uthurusamy, R. (Eds.), Advances in Knowledge Discovery and Data Mining, AAAI Press /MIT Press, California, 1996.

    Google Scholar 

  8. Fhar, V. and Tuzhilin, A. Abstract-driven pattern discovery in databases, IEEE Transactions on Knowledge and Data Engineering, 5, 926–938, 1993.

    Article  Google Scholar 

  9. Gaines, B.R. The trade-off between knowledge and data in knowledge acquisition, in: Piatetsky-Shapiro, G. and Frawley, W.J. (Eds.), Knowledge Discovery in Databases, AAAI/MIT Press, 491–505, 1991.

    Google Scholar 

  10. Gray, B. and Orlowska, M.E. CCAIIA:clustering categorical attributes into interesting association rules, in [30], 132–143, 1998.

    Google Scholar 

  11. Ho, K.M. and Scott, P.D. Zeta: a global method for discretization of continuous variables, Proceedings of KDD-97, 191–194, 1997.

    Google Scholar 

  12. Kullback, S. and Leibler, R.A. On information and sufficiency, Annals of Mathematical Statistics, 22, 79–86, 1951.

    Article  MathSciNet  MATH  Google Scholar 

  13. Iglesia, B. Debuse, J.C.W. and Rayward-Smith V.J. Discovering knowledge in commercial databases using modern heuristic techniques, Proceedings of KDD-96, 44–49, 1996.

    Google Scholar 

  14. Kamber, M. and Shinghal, R. Evaluating the interestingness of characteristic rules, Proceedings of KDD-96, 263–266, 1996.

    Google Scholar 

  15. Klöosgen, W. Explora: a multipattern and multistrategy discovery assistant, in [7], 249–271, 1996.

    Google Scholar 

  16. Liu, H., Lu, H., and Yao, J. Identifying relevant databases for multidatabase mining, in [30], 211–221, 1998.

    Google Scholar 

  17. Major, J. and Mangano, J. Selecting among rules induced from a hurricane database, The Journal of Intelligent Information Systems, 4, 1995.

    Google Scholar 

  18. Mannila, H. and Toivonen, H. Multiple uses of frequent sets and condensed representations, Proceedings of KDD-96, 189–194, 1996.

    Google Scholar 

  19. Marczewski, E. and Steinhaus, H. On a certain distance of sets and the corresponding distance of functions, Colloquium Mathemmaticum, 6, 319–327, 1958.

    MATH  MathSciNet  Google Scholar 

  20. McLeish, M., Yao, P., Garg, M., and Stirtzinger, T. Discovery of medical diagnostic information: an overview of methods and results, in: Piatetsky-Shapiro, G. and Frawley, W.J. (Eds.), Knowledge Discovery in Databases, AAAI/MIT Press, 477–490, 1991.

    Google Scholar 

  21. Michalski, R.S., Carbonell, J.G., and Mitchell, T.M. (Eds.), Machine Learning, Tioga, 1983.

    Google Scholar 

  22. Pawlak, Z. Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Boston, 1991.

    MATH  Google Scholar 

  23. Quinlan, J.R. Induction of decision trees, Machine Learning, 1, 81–106, 1986.

    Google Scholar 

  24. Schlimmer, J.C. and Granger, Jr.R.H. Incremental learning from noisy data, Machine Learning, 1, 317–354, 1986.

    Google Scholar 

  25. Piatetsky-Shapiro, G. Discovery, analysis, and presentation of strong rules, in: Piatetsky-Shapiro, G. and Frawley, W.J. (Eds.), Knowledge Discovery in Databases, AAAI/MIT Press, 229–238, 1991.

    Google Scholar 

  26. Shen, W. and Leng, B. Metapattern generation for integrated data mining, Proceedings of KDD-96, 152–157, 1996.

    Google Scholar 

  27. Silverstein, C., Brin, S., and Motwani, R. Beyond market baskets: generalizing association rules to dependence rules, Data Mining and Knowledge Discovery, 2, 39–68, 1998.

    Article  Google Scholar 

  28. Smyth, P. and Goodman, R.M. Rule induction using information theory, in: Piatetsky-Shapiro, G. and Frawley, W.J. (Eds.), Knowledge Discovery in Databases, AAAI/MIT Press, 159–176, 1991.

    Google Scholar 

  29. Tsumoto, S. and Tanaka, H. Automated discovery of functional components of proteins from amino-acid sequences based on rough sets and change of representation, Proceedings of KDD-95, 318–324, 1995.

    Google Scholar 

  30. Wu, X., Kotagiri, R,. and Bork, K.B. (Eds.), Research and Development in Knowledge Discovery and Data Mining, Springer, Berlin, 1998.

    Google Scholar 

  31. Yao, J. and Liu, H. Searching multiple databases for interesting complexes, in: Lu, H., Motoda, H., and Liu, H. (Eds.), KDD: Techniques and Applications, World Scientific, Singapore, 1997.

    Google Scholar 

  32. Yao, Y.Y. Measuring retrieval performance based on user preference of documents, Journal of the American Society for Information Science, 46, 133–145, 1995.

    Article  Google Scholar 

  33. Zembowicz, R. and Żytkow, J.M. From contingency tables to various forms of knowledge in database, in [7], 39–81, 1996.

    Google Scholar 

  34. Zhong, N., Dong, J., Fujitsu, S., and Ohsuga, S. Soft techniques for rule discovery in data, Transactions of Information Processing Society of Japan, 39, 2581–2592, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yao, Y.Y., Zhong, N. (1999). An Analysis of Quantitative Measures Associated with Rules. In: Zhong, N., Zhou, L. (eds) Methodologies for Knowledge Discovery and Data Mining. PAKDD 1999. Lecture Notes in Computer Science(), vol 1574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48912-6_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-48912-6_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48912-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics