Abstract
We describe an application of predicting sales opportunity using similarity-based methods. Sales representatives interface with customers based on their potential for product sales. Estimates of this potential are made under optimistic conditions and referred to as the opportunity: How much can be sold if a sale were to be made? Since this can never be verified exactly, the direct use of predictive models is difficult. In building systems for estimating sales opportunity, the key issues are: (a) predictions for targets that cannot be verified, (b) explanatory capabilities (c) capability to incorporate external knowledge (d) parallel computation of multiple targets and other efficiencies (e) capability to calibrate optimism in the predictions. (f) method stability and ease of maintenance for incorporating new examples. Empirical experiments demonstrate excellent predictive accuracy while also meeting these objectives. The methods have been embedded in a widely-used similarity-based system for IBM’s worldwide sales force.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
References
Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: ICML 2006: Proceedings of the 23rd International Conference on Machine Learning, pp. 97–104. ACM Press, New York (2006)
Hart, P.: The condensed nearest neighbor rule. IEEE Trans. Info. Theory IT-14, 515–516 (1968)
Li, P., Church, K., Hastie, T.: Conditional random sampling: A sketch-based sampling technique for sparse data. In: Schölkopf, B., Platt, J., Hoffman, T. (eds.) Advances in Neural Information Processing Systems 19. MIT Press, Cambridge (2007)
Herlocker, J.L., Konstan, J.A., Terveen, L.G., Riedl, J.T.: Evaluating collaborative filtering recommender systems. ACM Trans. Inf. Syst. 22(1), 5–53 (2004)
Adomavicius, G., Tuzhilin, A.: Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering 17(6), 734–749 (2005)
Tintarev, N., Masthoff, J.: A survey of explanations in recommender systems. In: Workshop on Recommender Systems and Intelligent User Interfaces associated with ICDE 2007 (2007)
Fukunaga, K., Hummels, D.M.: Bias of nearest neighbor estimates. IEEE Trans. Pattern Anal. Mach. Intell 9(1), 103–112 (1987)
Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is “nearest neighbor” meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217–235. Springer, Heidelberg (1998)
Aggarwal, C.C.: Towards systematic design of distance functions for data mining applications. In: KDD 2003: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 9–18. ACM Press, New York (2003)
Wu, G., Chang, E.Y., Panda, N.: Formulating distance functions via the kernel trick. In: KDD 2005: Proceeding of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 703–709. ACM Press, New York (2005)
Yao, Z., Ruzzo, W.L.: A regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data. BMC Bioinformatics 7 (2006)
Yang, S., Zhang, C.: Regression nearest neighbor in face recognition. In: Proceedings of the 18th International Conference on Pattern Recognition, pp. 515–518 (2006)
Kolodner, J.: Case-based Reasoning. Morgan Kaufmann, San Francisco (1993)
Zhou, Z., Li, M.: Semi-supervised regression with co-training. In: IJCAI 2005: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 908–913 (2005)
Merugu, S., Rosset, S., Perlich, C.: A new multi-view regression approach with an application to customer wallet estimation. In: KDD 2006: Proceeding of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 656–661. ACM Press, New York (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weiss, S.M., Indurkhya, N. (2008). Estimating Sales Opportunity Using Similarity-Based Methods. In: Daelemans, W., Goethals, B., Morik, K. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2008. Lecture Notes in Computer Science(), vol 5212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87481-2_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-87481-2_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87480-5
Online ISBN: 978-3-540-87481-2
eBook Packages: Computer ScienceComputer Science (R0)