skip to main content
research-article

Multifocal learning for customer problem analysis

Published:06 May 2011Publication History
Skip Abstract Section

Abstract

In this study, we formalize a multifocal learning problem, where training data are partitioned into several different focal groups and the prediction model will be learned within each focal group. The multifocal learning problem is motivated by numerous real-world learning applications. For instance, for the same type of problems encountered in a customer service center, the problem descriptions from different customers can be quite different. Experienced customers usually give more precise and focused descriptions about the problem. In contrast, inexperienced customers usually provide diverse descriptions. In this case, the examples from the same class in the training data can be naturally in different focal groups. Therefore, it is necessary to identify those natural focal groups and exploit them for learning at different focuses. Along this line, the key development challenge is how to identify those focal groups in the training data. As a case study, we exploit multifocal learning for profiling customer problems. Also, we provide an empirical study about how the performance of multifocal learning is affected by the quality of focal groups. The results on real-world customer problem logs show that multifocal learning can significantly boost the performance of many existing classification algorithms, such as Support Vector Machines (SVMs), for classifying customer problems and there is strong correlation between the quality of focal groups and the learning performance.

References

  1. Bloehdorn, S. 2004. Text classification by boosting weak learners based on terms and concepts. In Proceedings of the 4th IEEE International Conference on Data Mining. 331--334. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Brown, L., Gans, N., Mandelbaum, A., Sakov, A., Shen, H., Zeltyn, S., and Zhao, L. 2005. Statistical analysis of a telephone call center: A queueing science perspective. J. Amer. Statist. Assoc. 100.Google ScholarGoogle ScholarCross RefCross Ref
  3. Busemann, S., Schmeier, S., and Arens, R. G. 2000. Message classification in the call center. In Proceedings of the 6thConference on Applied Natural Language Processing. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chang, C.-C. and Lin, C.-J. Libsvm. http://www.csie.ntu.edu.tw/cjlin/libsvm/.Google ScholarGoogle Scholar
  5. Chu-Carroll, J. and Carpenter, B. 1999. Vector-Based natural language call routing. Comput. Ling. 25, 3, 361--388. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Cohen, W. W. 1995. Fast effective rule induction. In Proceedings of the 12thInternational Conference on Machine Learning. 115--123.Google ScholarGoogle ScholarCross RefCross Ref
  7. Cristani, M. and Cuel, R. 2005. A survey on ontology creation methodologies. Int. J. Sem. Web Inf. Syst. 1, 2, 49--69.Google ScholarGoogle ScholarCross RefCross Ref
  8. Ertoz, L., Steinbach, M., and Kumar, V. 2003. Finding clusters of different sizes, shapes, and densities in noisy, high dimensional data. In Proceedings of the 2ndSIAM International Conference on Data Mining. 349--358.Google ScholarGoogle Scholar
  9. Gamon, M. 2004. Sentiment classification on customer feedback data: Noisy data, large feature vectors, and the role of linguistic analysis. In Proceedings of the 20th International Conference on Computational Linguistics. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Gamon, M., Aue, A., Corston-Oliver, S., and Ringger, E. 2005. Pulse: Mining customer opinions from free text. Adv. Intell. Data Anal. 3646, 121--132. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Gans, N., Koole, G., and Mandelbaum, A. 2003. Telephone call centers: Tutorial, review, and research prospects. Manufact. Serv. Oper. Manag. 5, 79--141. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ge, Y., Xiong, H., Zhou, W., Sahoo, R., Gao, X., and Wu, W. 2009. Multifocal learning and its application to customer service support. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 349--358. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Godbole, S. and Roy, S. 2008. An integrated system for automatic customer satisfaction analysis in the services industry. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1076--1073. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Goel, V. and Byrne, W. 2000. Minimum bayes risk methods automatic speech recognition. Comput. Speech Lang. 14, 115--135.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Hui, S. C. and Jha, G. 2001. Application of data mining techniques for improving customer services. Int. J. Comput. Appl. Technol. 14, 64--77.Google ScholarGoogle ScholarCross RefCross Ref
  16. IBM. 2011. Ibm websphere voice server. www.ibm.com/software/pervasive/voice.Google ScholarGoogle Scholar
  17. Jarvis, R. A. and Patrick, E. A. 1973. Clustering using a similarity measure based on shared nearest neighbors. IEEE Trans. Comput. C-22, 11, 1025--1034. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Johansson, P. and Olhager, J. 2003. Industrial service profiling: Matching service offerings and processes. Int. J. Product. Econ. 3, 3.Google ScholarGoogle Scholar
  19. Karypis, G. 2011. Cluto. http://glaros.dtc.umn.edu/gkhome/views/cluto.Google ScholarGoogle Scholar
  20. Karypis, G., Han, E.-H. S., and Kumar, V. 1999. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Comput. 32, 8, 68--75. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Paprzychi, M., Abraham, A., Guo, R., and Mukkamala, S. 2004. Data mining approach for analyzing call center performance. In Proceedings of the 17th International Conference on Innovations In Applied Artificial Intelligence. 1092--1101. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Porter, M. 1980. An algorithm for suffix stripping. Program 14, 3, 130--137.Google ScholarGoogle ScholarCross RefCross Ref
  23. Riccardi, G., Gorin, A., Ljolje, A., and Riley, M. 1997. A spoken language system for automated call routing. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'97). Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Scholkopf, B. and Smola, A. J. 2002. Learning with Kernels. MIT Press, Cambridge, MA.Google ScholarGoogle Scholar
  25. Tan, P.-N., Steinbach, M., and Kumar, V. 2005. Introduction to Data Mining. Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Wu, J., Xiong, H., Wu, P., and Chen, J. 2007. Local decomposition for rare class analysis. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 814--823. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Wu, J., Xiong, H., and Chen, J. 2009. Adapting the right measures for k-means clustering. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 877--886. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Multifocal learning for customer problem analysis

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Intelligent Systems and Technology
        ACM Transactions on Intelligent Systems and Technology  Volume 2, Issue 3
        April 2011
        259 pages
        ISSN:2157-6904
        EISSN:2157-6912
        DOI:10.1145/1961189
        Issue’s Table of Contents

        Copyright © 2011 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 6 May 2011
        • Accepted: 1 September 2010
        • Revised: 1 July 2010
        • Received: 1 March 2010
        Published in tist Volume 2, Issue 3

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader