Advertisement

Computing

, Volume 91, Issue 2, pp 135–168 | Cite as

Using negotiable features for prescription problems

  • Antonio BellaEmail author
  • Cèsar Ferri
  • José Hernández-Orallo
  • María José Ramírez-Quintana
Article

Abstract

Data mining is usually concerned on the construction of accurate models from data, which are usually applied to well-defined problems that can be clearly isolated and formulated independently from other problems. Although much computational effort is devoted for their training and statistical evaluation, model deployment can also represent a scientific problem, when several data mining models have to be used together, constraints appear on their application, or they have to be included in decision processes based on different rules, equations and constraints. In this paper we address the problem of combining several data mining models for objects and individuals in a common scenario, where not only we can affect decisions as the result of a change in one or more data mining models, but we have to solve several optimisation problems, such as choosing one or more inputs to get the best overall result, or readjusting probabilities after a failure. We illustrate the point in the area of customer relationship management (CRM), where we deal with the general problem of prescription between products and customers. We introduce the concept of negotiable feature, which leads to an extended taxonomy of CRM problems of greater complexity, since each new negotiable feature implies a new degree of freedom. In this context, we introduce several new problems and techniques, such as data mining model inversion (by ranging on the inputs or by changing classification problems into regression problems by function inversion), expected profit estimation and curves, global optimisation through a Monte Carlo method, and several negotiation strategies in order to solve this maximisation problem.

Keywords

Data mining Profit maximisation Function inversion problem Global optimisation Negotiation CRM Ranking Probability estimation Negotiable features Monte Carlo method 

Mathematics Subject Classification (2000)

68T20 62-07 90B50 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adomavicius G, Tuzhilin A (2005) Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng 17(6): 734–749CrossRefGoogle Scholar
  2. 2.
    Bella A, Ferri C, Hernández-Orallo J, Ramírez-Quintana MJ (2007) Joint cutoff probabilistic estimation using simulation: a mailing campaign application. In: IDEAL, volume 4881 of LNCS. Springer, New York, pp 609–619Google Scholar
  3. 3.
    Berry MJA, Linoff GS (1999) Mastering data mining: the art and science of customer relationship management. Wiley, New YorkGoogle Scholar
  4. 4.
    Berson A, Smith S, Thearling K (2000) Building data mining applications for CRM. McGraw HillGoogle Scholar
  5. 5.
    Bertsekas DP (2005) Dynamic programming and optimal control, 3rd edn. Massachusetts Institute of TechnologyGoogle Scholar
  6. 6.
    Better M, Glover F, Laguna M (2007) Advances in analytics: integrating dynamic data mining with simulation optimization. IBM J Res Dev 51(3): 477–487CrossRefGoogle Scholar
  7. 7.
    Bradley N (2007) Marketing research. Tools and techniques. Oxford University PressGoogle Scholar
  8. 8.
    Carbo J, Ledezma A (2003) A machine learning based evaluation of a negotiation between agents involving fuzzy counter-offers. In: AWIC, pp 268–277Google Scholar
  9. 9.
    Devroye L, Györfi L, Lugosi G (1997) A probabilistic theory of pattern recognition. In: Stochastic modelling and applied probability. Springer, New YorkGoogle Scholar
  10. 10.
    Ferri C, Flach PA, Hernández-Orallo J (2003) Improving the AUC of probabilistic estimation trees. In: 14th European conference on machine learning, proceedings. Springer, New York, pp 121–132Google Scholar
  11. 11.
    Ferri C, Hernández-Orallo J, Modroiu R (2009) An experimental comparison of performance measures for classification. Pattern Recogn Lett 30(1): 27–38CrossRefGoogle Scholar
  12. 12.
    Fudenberg D, Tirole J (1991) Game theory. MIT Press, CambridgeGoogle Scholar
  13. 13.
    Gustafsson A, Herrmann A, Huber F (2000) Conjoint analysis as an instrument of market research practice. In: Conjoint measurement. Springer, Berlin, pp 3–30Google Scholar
  14. 14.
    Han J, Kamber M (2006) Data mining: concepts and techniques. Morgan Kaufmann, San MateoGoogle Scholar
  15. 15.
    Heckman JJ (1979) Sample selection bias as a specification error. Econometrica 47: 153–161zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Jennings NR, Faratin P, Lomuscio AR, Parsons S, Wooldridge MJ, Sierra C (2001) Automated negotiation: prospects, methods and challenges. Group Decis Negot 10(2): 199–215CrossRefGoogle Scholar
  17. 17.
    Kilian C (2005) Modern control technology. Thompson Delmar LearningGoogle Scholar
  18. 18.
    Li S, Sun B, Wilcox RT (2005) Cross-selling sequentially ordered products: an application to consumer banking services. J Mark Res 42: 233–239CrossRefGoogle Scholar
  19. 19.
    Metropolis N, Ulam S (1949) The Monte Carlo method. J Am Stat Assoc 44: 335–341zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Padmanabhan B, Tuzhilin A (2003) On the use of optimization for data mining: theoretical interactions and ecrm opportunities. Manage Sci 49(10, Special Issue on E-Business and Management Science):1327–1343Google Scholar
  21. 21.
    Peterson M (2009) An introduction to decision theory. Cambridge University Press, CambridgezbMATHGoogle Scholar
  22. 22.
    Prinzie A, Van den Poel D (2005) Constrained optimization of data-mining problems to improve model performance: a direct-marketing application. Expert Syst Appl 29(3): 630–640CrossRefGoogle Scholar
  23. 23.
    Prinzie A, Van den Poel D (2006) Exploiting randomness for feature selection in multinomial logit: a crm cross-sell application. In: Advances in data mining. Lecture notes in computer science, vol 4065. Springer, Berlin, pp 310–323Google Scholar
  24. 24.
    Puterman ML (1994) Markov decision processes. Wiley, New YorkzbMATHCrossRefGoogle Scholar
  25. 25.
    Quinlan JR (1992) Learning with continuous classes. In: 5th Australian joint conference on artificial intelligence. World Scientific, Singapore, pp 343–348Google Scholar
  26. 26.
    Quinlan JR (1993) C4.5: programs for machine learning. Morgan Kaufmann, San MateoGoogle Scholar
  27. 27.
    Russell SJ, Norvig P (2003) Artificial intelligence: a modern approach. Pearson Education, Upper Saddle RiverGoogle Scholar
  28. 28.
    Sutton RS, Barto AG (1998) Reinforcement learning: an introduction. MIT Press, CambridgeGoogle Scholar
  29. 29.
    Vetsikas I, Jennings N (2010) Bidding strategies for realistic multi-unit sealed-bid auctions. J Auton Agents Multi-Agent Syst 21(2): 265–291CrossRefGoogle Scholar
  30. 30.
    Weisstein EW (2003) CRC concise encyclopedia of mathematics. CRC Press, Boca RatonGoogle Scholar
  31. 31.
    Witten IH, Frank E (2005) Data mining: practical machine learning tools and techniques with Java implementations. Elsevier, AmsterdamGoogle Scholar
  32. 32.
    Wooldridge M (2002) An introduction to multiagent systems. Wiley, New YorkGoogle Scholar
  33. 33.
    Zhang S, Ye S, Makedon F, Ford J (2004) A hybrid negotiation strategy mechanism in an automated negotiation system. In: ACM conference on electronic commerce. ACM, pp 256–257Google Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  • Antonio Bella
    • 1
    Email author
  • Cèsar Ferri
    • 1
  • José Hernández-Orallo
    • 1
  • María José Ramírez-Quintana
    • 1
  1. 1.DSIC-ELP, Universidad Politécnica de ValenciaValenciaSpain

Personalised recommendations