Skip to main content

Post Mining of Diversified Multiple Decision Trees for Actionable Knowledge Discovery

  • Conference paper
Book cover Advanced Computing, Networking and Security (ADCONS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7135))

  • 2850 Accesses

Abstract

Most data mining algorithms and tools when applied to industrial problems such as Customer Relationship Management, insurance and banking they stop search at producing actual applicable knowledge. Unlike these models, actionable knowledge discovery techniques are useful in pointing out customers who are likely attritors and loyal. However, actionable knowledge discovery techniques require human experts to postprocess the discovered knowledge manually. Postprocessing is one of the actionable knowledge discovery techniques which are effective in decision making and overcomes considerable inefficiency which leads to human errors that are inherent in the traditional data mining systems. Hence, decision trees are postprocessed which suggest cost effective actions in order to maximize the profit based objective function. In the proposed approach, an effective actionable knowledge discovery based classification algorithm namely Actionable Multiple Decision Trees (AMDT) is developed to improve the robustness and classification accuracy and tests are conducted on UCI German benchmark data.

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. Yang, Q., Yin, J., Ling, C.X., Chen, T.: Postprocessing Decision Trees to Extract Actionable Knowledge. In: Proc. IEEE Conf. Data Mining (ICDM 2003), pp. 685–688 (2003)

    Google Scholar 

  2. Yang, Q., Yin, J., Ling, C.X., Pan, R.: Extracting Actionable Knowledge Decision Trees. IEEE Transactions on Knowledge and Data Engineering 18(12), 43–56 (2007)

    Article  Google Scholar 

  3. Hu, H., Li, J., Wang, H., Daggard, G., Shi, M.: A maximally diversified multiple decision tree algorithm for microarray data classification. In: WISB 2006 Proceedings of the Workshop on Intelligent Systems for Bioinformatics, vol. 73 (2006)

    Google Scholar 

  4. Ling, C.X., Chen, T., Yang, Q., Cheng, J.: Mining Optimal Actions for Intelligent CRM. In: Proc. IEEE Int’l Conf. Data Mining, ICDM (2002)

    Google Scholar 

  5. Li, J., Liu, H.: Ensembles of Cascading Trees. In: Proc. IEEE Int’l Conf. Data Mining (ICDM 2003), pp. 585–588 (2003)

    Google Scholar 

  6. 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 (LNAI), vol. 1910, pp. 587–592. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Lakshmi, B.N., Raghunandhan, G.H.: A Conceptual Overview of Data Mining. In: Proceedings of the National Conference on Innovations in Emerging Technology, pp. 27–32 (2011)

    Google Scholar 

  8. Chen, M.S., Han, J., Yu, P.S.: Data Mining: An Overview from a Database Perspective. IEEE Trans. Knowledge and Data Eng. 8, 866–883 (1996)

    Article  Google Scholar 

  9. Quinlan, J.R.: C4.5 Programs for Machine Learning. Morgan Kaufmann (1993)

    Google Scholar 

  10. Rygielski, C., Wang, J.C., Yen, D.C.: Data mining techniques for customer relationship Management. Technology in Society 24, 483–502 (2002)

    Article  Google Scholar 

  11. Breiman, L.: Bagging predictors. Machine Learning, 123–140 (1996)

    Google Scholar 

  12. Breiman, L.: Random forests–random features. Technical Report 567, University of California, Berkley (1999)

    Google Scholar 

  13. Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: International Conference on Machine Learning, pp. 148–156 (1996)

    Google Scholar 

  14. He, Z., Xu, X.: Datamining for actionable knowledge: A survey. In: CoRR (2005)

    Google Scholar 

  15. Hand, D., Mannila, H., Smith, P.: Principles of Data Mining. MIT Press, Cambridge (2001)

    Google Scholar 

  16. UCI Machine Learning Repository, http://archive.ics.uci.edu/ml/datasets/Statlog+German+Credit+Data

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Subramani, S., Balasubramaniam, S. (2012). Post Mining of Diversified Multiple Decision Trees for Actionable Knowledge Discovery. In: Thilagam, P.S., Pais, A.R., Chandrasekaran, K., Balakrishnan, N. (eds) Advanced Computing, Networking and Security. ADCONS 2011. Lecture Notes in Computer Science, vol 7135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29280-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29280-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29279-8

  • Online ISBN: 978-3-642-29280-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics