Skip to main content

Discovering Action Rules That Are Highly Achievable from Massive Data

  • Conference paper
Advances in Knowledge Discovery and Data Mining (PAKDD 2009)

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

Included in the following conference series:

Abstract

In this paper, we propose a novel algorithm which discovers a set of action rules for converting negative examples into positive examples. Unlike conventional action rule discovery methods, our method AARUDIA (Achievable Action RUle DIscovery Algorithm) considers the effects of actions and the achievability of the class change for disk-resident data. In AARUDIA, effects of actions are specified using domain rules and the achievability is inferred with Naive Bayes classifiers. AARUDIA takes a new breadth-first search method which manages actionable literals and stable literals, and exploits the achievability to reduce the number of discovered rules. Experimental results with inflated real-world data sets are promising and demonstrate the practicality of AARUDIA.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. VLDB, pp. 487–499 (1994)

    Google Scholar 

  2. Blake, C., Merz, C.J., Keogh, E.: UCI Repository of Machine Learning Databases, http://www.ics.uci.edu/~mlearn/MLRepository.html

  3. Brijs, T., Goethals, B., Swinnen, G., Vanhoof, K., Wets, G.: A Data Mining Framework for Optimal Product Selection in Retail Supermarket Data: The Generalized PROFSET Model. In: Proc. KDD, pp. 20–23 (2000)

    Google Scholar 

  4. Domingos, P., Pazzani, M.: On the Optimality of the Simple Bayesian Classifier under Zero-One Loss. Machine Learning 29(2/3), 103–130 (1997)

    Article  MATH  Google Scholar 

  5. Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P.: From Data Mining to Knowledge Discovery: An Overview. In: Advances in Knowledge Discovery and Data Mining, pp. 1–34. AAAI/MIT Press, Menlo Park, Calif. (1996)

    Google Scholar 

  6. Jiang, Y., Wang, K., Tuzhilin, A., Fu, A.W.-C.: Mining Patterns that Respond to Actions. In: Proc. ICDM, pp. 669–672 (2005)

    Google Scholar 

  7. Piatetsky-Shapiro, G., Matheus, C.J.: The Interestingness of Deviations. In: AAAI 1994 Workshop on Knowledge Discovery in Databases, pp. 25–36 (1994)

    Google Scholar 

  8. Quinlan, J.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  9. Rás, Z.W., Gupta, S.: Global Action Rules in Distributed Knowledge Systems. Fundamenta Informaticae 51(1-2), 175–184 (2002)

    MathSciNet  MATH  Google Scholar 

  10. Rás, Z.W., Tsay, L.-S.: Discovering Extended Action-Rules (System DEAR). In: Proc. International IIS, pp. 293–300 (2003)

    Google Scholar 

  11. Rás, Z.W., Tzacheva, A.A., Tsay, L.-S., Gürdal, O.: Mining for Interesting Action Rules. In: Proc. IAT, pp. 187–193 (2005)

    Google Scholar 

  12. Raś, Z.W., Wieczorkowska, A.: Action-Rules: How to Increase Profit of a Company. In: Zighed, D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS, vol. 1910, pp. 587–592. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Rás, Z.W., Wieczorkowska, A.: Mining for Action-Rules in Large Decision Tables Classifying Customers. Intelligent Information Systems, 55–63 (2000)

    Google Scholar 

  14. Russell, S., Norvig, P.: Artificial Intelligence. Prentice-Hall, Englewood Cliffs (1995)

    MATH  Google Scholar 

  15. Tsay, L.-S., Rás, Z.W., Wieczorkowska, A.: Tree-based Algorithm for Discovering Extended Action-Rules (System DEAR2). Intelligent Information Systems, 459–464 (2004)

    Google Scholar 

  16. Tzacheva, A.A., Rás, Z.W.: Action Rules Mining. International Journal of Intelligent Systems 20(6), 719–736 (2005)

    Article  MATH  Google Scholar 

  17. Yang, Q., Cheng, H.: Mining Case Bases for Action Recommendation. In: Proc. ICDM, pp. 522–529 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suzuki, E. (2009). Discovering Action Rules That Are Highly Achievable from Massive Data. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, TB. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2009. Lecture Notes in Computer Science(), vol 5476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01307-2_72

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01307-2_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01306-5

  • Online ISBN: 978-3-642-01307-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics