Skip to main content

Explanation-Oriented Association Mining Using a Combination of Unsupervised and Supervised Learning Algorithms

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2003)

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

Abstract

We propose a new framework of explanation-oriented data mining by adding an explanation construction and evaluation phase to the data mining process. While traditional approaches concentrate on mining algorithms, we focus on explaining mined results. The mining task can be viewed as unsupervised learning that searches for interesting patterns. The construction and evaluation of mined patterns can be formulated as supervised learning that builds explanations. The proposed framework is therefore a simple combination of unsupervised learning and supervised learning. The basic ideas are illustrated using association mining. The notion of conditional association is used to represent plausible explanations of an association. The condition in a conditional association explicitly expresses the plausible explanations of an association.

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. Agrawal, R. and Srikant, R., Fast algorithms for mining association rules in large databases, Proceedings of VLDB, 487–499, 1994.

    Google Scholar 

  2. Berry, M. J.A. and Lino., G. S., Mastering Data Mining: The Art and Science of Customer Relationship Management, John Wiley & Sons, New York, 2000.

    Google Scholar 

  3. Cendrowska, J., PRISM: An algorithm for inducing modular rules, International Journal of Man-Machine Studies, 27, 349–370, 1987.

    Article  MATH  Google Scholar 

  4. Chen, L., Discovery of Conditional Association Rules, Master thesis, Utah State University, 2001.

    Google Scholar 

  5. Dhaliwal, J. S. and Benbasat, I., The use and e.ects of knowledge-based system explanations: Theoretical foundations and a framework for empirical evaluation, Information Systems Research, 7, 342–362, 1996.

    Article  Google Scholar 

  6. Fayyad, U.M., Piatetsky-Shapiro, G. and Smyth, P., From data mining to knowledge discovery: An overview, Advances in Knowledge Discovery and Data Mining, Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P. and Uthurusamy, R. (Eds.), 1–34, AAAI/MIT Press, Menlo Park, California, 1996.

    Google Scholar 

  7. Han, J. and Kamber, M., Data Mining: Concept and Techniques, Morgan Kaufmann, Palo Alto, CA, 2000.

    Google Scholar 

  8. Hasling, D. W., Clancey, W. J. and Rennels, G., Strategic explanations for a diagnosticconsultation system, International Journal of Man-Machine Studies, 20, 3–19, 1984.

    Article  Google Scholar 

  9. Haynes, S. R., Explanation in Information Systems: A Design Rationale Approach, Ph.D. Dissertation, The London School of Economics, University of London, 2001.

    Google Scholar 

  10. Mannila, H., Methods and problems in data mining, Proceedings of International Conference on Database Theory, 41–55, 1997.

    Google Scholar 

  11. Pitt, J., Theory of Explanation, Oxford University Press, Oxford, 1988.

    Google Scholar 

  12. Quinlan, J.R., Learning efficient classification procedures, Machine Learning: An Artificial Intelligence Approach, Michalski, J. S., Carbonell, J. G., and Mirchell, T. M. (Eds.), Morgan Kaufmann, Palo Alto, CA, 463–482, 1983.

    Google Scholar 

  13. Quinlan, J. R., C4.5: Programs for Machine Learning, Morgan Kaufmann, Palo Alto, CA, 1993.

    Google Scholar 

  14. Rauch, J., Association rules and mechanizing hypotheses formation, Proceedings of ECML Workshop: Machine Learning as Experimental Philosophy of Science, 2001.

    Google Scholar 

  15. Schank, R. and Kass, A., Explanations, machine learning, and creativity, Machine Learning: An Artificial Intelligence Approach, Kodrato., Y. and Michalski, R. (Eds.), Morgan Kaufmann, Palo Alto, CA, 31–48, 1990.

    Google Scholar 

  16. Simoudis, E., Reality check for data mining. IEEE Expert, 11, 1996.

    Google Scholar 

  17. Turban, E. and Aronson, J. E., Decision Support Systems and Intelligent System, Prentice Hall, New Jersey, 2001.

    Google Scholar 

  18. Wang, K. and He, Y., User-defined association mining, Proceedings of PAKDD, 387–399, 2001.

    Google Scholar 

  19. Wick, M.R. and Slagle, J.R., An explanation facility for today’s expert systems, IEEE Expert, 4, 1989, 26–36.

    Article  Google Scholar 

  20. Wu, X., Zhang, C. and Zhang, S., Mining both positive and negative association rules, Proceedings of ICML, 1997.

    Google Scholar 

  21. Yao, Y.Y., A step toward foundations of data mining, manuscript, 2003.

    Google Scholar 

  22. Yao, Y.Y., Zhao, Y. and Maguire, R. B., Explanation oriented association mining using rough set theory, Proceedings of International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, to appear, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yao, Y.Y., Zhao, Y., Maguire, R.B. (2003). Explanation-Oriented Association Mining Using a Combination of Unsupervised and Supervised Learning Algorithms. In: Xiang, Y., Chaib-draa, B. (eds) Advances in Artificial Intelligence. Canadian AI 2003. Lecture Notes in Computer Science, vol 2671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44886-1_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-44886-1_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44886-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics