Nothing Special   »   [go: up one dir, main page]

Skip to main content

Direct Marketing with Fewer Mistakes

  • Conference paper
Advanced Data Mining and Applications (ADMA 2011)

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

Included in the following conference series:

Abstract

Direct marketing is one of the most common and crucial business intelligence tasks. In direct marketing, the goal of an agent is to mine the right customers to market certain products, with the goal of making fewest mistakes. This data-mining problem, though similar to active learning in terms of allowing the agent to select customers actively, is, in fact, opposite to active learning. As far as we know, no previous data mining algorithms can solve this problem well. In this paper, we propose a simple yet effective algorithm called Most-Certain Learning (MCL) to handle this type of problems. The experiments show that our data-mining algorithms can solve various direct marketing problems effectively.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Ling, C., Li, C.: Data mining for direct marketing: Problems and solutions. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pp. 73–79. Citeseer (1998)

    Google Scholar 

  2. Van Der Putten, P.: Data mining in direct marketing databases. In: Complexity and Management: A Collection of Essays. World Scientific, Singapore (1999)

    Google Scholar 

  3. Wong, K., Zhou, S., Yang, Q., Yeung, J.: Mining customer value: from association rules to direct marketing. Data Mining and Knowledge Discovery 11(1), 57–79 (2005)

    Article  MathSciNet  Google Scholar 

  4. Settles, B.: Active learning literature survey. Machine Learning 15(2), 201–221 (1994)

    Google Scholar 

  5. Cohn, D., Ghahramani, Z., Jordan, M.: Active learning with statistical models. Arxiv preprint cs/9603104 (1996)

    Google Scholar 

  6. Balcan, M., Beygelzimer, A., Langford, J.: Agnostic active learning. In: Proceedings of the 23rd International Conference on Machine Learning, 65–72. ACM (2006)

    Google Scholar 

  7. Dasgupta, S., Hsu, D., Monteleoni, C.: A general agnostic active learning algorithm. In: Advances in Neural Information Processing Systems, vol. 20, p. 2 (2007)

    Google Scholar 

  8. Ben-David, S., Kushilevitz, E., Mansour, Y.: Online Learning Versus Offline Learning. In: Vitányi, P.M.B. (ed.) EuroCOLT 1995. LNCS, vol. 904, pp. 38–52. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  9. Goldman, S.A., Rivest, R.L., Schapire, R.E.: Learning binary relations and total orders. SIAM J. Comput. 22(5), 1006–1034 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  10. Rivest, R.L., Yin, Y.L.: Being taught can be faster than asking questions. In: COLT 1995: Proceedings of the Eighth Annual Conference on Computational Learning Theory, pp. 144–151. ACM, New York (1995)

    Chapter  Google Scholar 

  11. Quinlan, J.: Bagging, boosting, and c4.5. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 725–730. AAAI Press (1996)

    Google Scholar 

  12. Bauer, E., Kohavi, R.: An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Mach. Learn. 36(1-2), 105–139 (1999)

    Article  Google Scholar 

  13. Shmueli, G., Patel, N., Bruce, P.: Data mining for business intelligence. John Wiley & Sons (2007)

    Google Scholar 

  14. Manning, C., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)

    Google Scholar 

  15. Singhal, A., Inc, G.: Modern information retrieval: a brief overview. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering 24 (2001)

    Google Scholar 

  16. Tong, S.: Active learning: theory and applications. PhD thesis, Citeseer (2001)

    Google Scholar 

  17. Asuncion, A., Newman, D.: UCI machine learning repository (2007), http://www.ics.uci.edu/~mlearn/mlrepository.html

  18. WEKA Machine Learning Project: Weka, http://www.cs.waikato.ac.nz/~ml/weka

  19. Ben-David, S., Eiron, N., Kushilevitz, E.: On self-directed learning. In: COLT 1995: Proceedings of the Eighth Annual Conference on Computational Learning Theory, pp. 136–143. ACM, New York (1995)

    Chapter  Google Scholar 

  20. Goldman, S.A., Sloan, R.H.: The power of self-directed learning. Mach. Learn. 14(3), 271–294 (1994)

    Google Scholar 

  21. Orange, F.T.C.: Kdd cup 2009 (2009), http://www.kddcup-orange.com/data.php

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ni, E.A., Ling, C.X. (2011). Direct Marketing with Fewer Mistakes. In: Tang, J., King, I., Chen, L., Wang, J. (eds) Advanced Data Mining and Applications. ADMA 2011. Lecture Notes in Computer Science(), vol 7120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25853-4_20

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25852-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics