Skip to main content

Leveraging Call Center Logs for Customer Behavior Prediction

  • Conference paper
Advances in Intelligent Data Analysis VIII (IDA 2009)

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

Included in the following conference series:

Abstract

Most major businesses use business process outsourcing for performing a process or a part of a process including financial services like mortgage processing, loan origination, finance and accounting and transaction processing. Call centers are used for the purpose of receiving and transmitting a large volume of requests through outbound and inbound calls to customers on behalf of a business. In this paper we deal specifically with the call centers notes from banks. Banks as financial institutions provide loans to non-financial businesses and individuals. Their call centers act as the nuclei of their client service operations and log the transactions between the customer and the bank. This crucial conversation or information can be exploited for predicting a customer’s behavior which will in turn help these businesses to decide on the next action to be taken. Thus the banks save considerable time and effort in tracking delinquent customers to ensure minimum subsequent defaulters. Majority of the time the call center notes are very concise and brief and often the notes are misspelled and use many domain specific acronyms. In this paper we introduce a novel domain specific spelling correction algorithm which corrects the misspelled words in the call center logs to meaningful ones. We also discuss a procedure that builds the behavioral history sequences for the customers by categorizing the logs into one of the predefined behavioral states. We then describe a pattern based predictive algorithm that uses temporal behavioral patterns mined from these sequences to predict the customer’s next behavioral state.

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. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10, 707–710 (1966)

    MathSciNet  MATH  Google Scholar 

  2. Damerau, F.J.: A technique for computer detection and correction of spelling errors. Communications of the ACM 7(3), 171–176 (1964)

    Article  Google Scholar 

  3. Knuth, D.E.: The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley Publishing Company, Reading (1998)

    Google Scholar 

  4. Philips, L.: The double metaphone search algorithm. C/C++ Users J. (June 2000)

    Google Scholar 

  5. Angell, R., Freund, G., Willet, P.: Automatic spelling correction using a trigram similarity measure. Information Processing and Management 19(4), 305–316 (1983)

    Article  Google Scholar 

  6. Pollock, J.J., Zamora, A.: Automatic spelling correction in scientific and scholarly text. Communications of the ACM 27(4), 358–368 (1984)

    Article  Google Scholar 

  7. Peterson, J.L.: Computer programs for detecting and correcting spelling errors. Communications of the ACM 23(12), 676–687 (1980)

    Article  Google Scholar 

  8. Vilalta, R., Ma, S.: Predicting rare events in temporal domains. In: Proc. of the 2002 IEEE International Conference on Data Mining, ICDM 2002, pp. 474–481 (2002)

    Google Scholar 

  9. Weiss, G.M., Hirsh, H.: Learning to predict rare events in event sequences. In: Proc. of KDD 1998, pp. 359–363 (1998)

    Google Scholar 

  10. Dietterich, T.G., Michalski, R.S.: Discovering patterns in sequences of events. Artificial Intelligence 25(2), 187–232 (1985)

    Article  Google Scholar 

  11. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 1(3), 259–289 (1997)

    Article  Google Scholar 

  12. Laxman, S., Unnikrishnan, K.P., Sastry, P.S.: Discovering frequent episodes and learning hidden markov models: A formal connection. IEEE Trans. on Knowl. and Data Eng. 17(11), 1505–1517 (2005)

    Article  Google Scholar 

  13. Laxman, S., Tankasali, V., White, R.W.: Stream prediction using a generative model based on frequent episodes in event sequences. In: Proc. of the 14th ACM SIGKDD Int’l. Conf. on Knowledge discovery and data mining, pp. 453–461 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parvathy, A.G., Vasudevan, B.G., Kumar, A., Balakrishnan, R. (2009). Leveraging Call Center Logs for Customer Behavior Prediction. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, JF. (eds) Advances in Intelligent Data Analysis VIII. IDA 2009. Lecture Notes in Computer Science, vol 5772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03915-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03915-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03914-0

  • Online ISBN: 978-3-642-03915-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics