Advertisement

Content-Aware Resolution Sequence Mining for Ticket Routing

  • Peng Sun
  • Shu Tao
  • Xifeng Yan
  • Nikos Anerousis
  • Yi Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6336)

Abstract

Ticket routing is key to the efficiency of IT problem management. Due to the complexity of many reported problems, problem tickets typically need to be routed among various expert groups, to search for the right resolver. In this paper, we study the problem of using historical ticket data to make smarter routing recommendations for new tickets, so as to improve the efficiency of ticket routing, in terms of the Mean number of Steps To Resolve (MSTR) a ticket.

Previous studies on this problem have been focusing on mining ticket resolution sequences to generate more informed routing recommendations. In this work, we enhance the existing sequence-only approach by further mining the text content of tickets. Through extensive studies on real-world problem tickets, we find that neither resolution sequence nor ticket content alone is sufficient to deliver the most reduction in MSTR, while a hybrid approach that mines resolution sequences in a content-aware manner proves to be the most effective. We therefore propose such an approach that first analyzes the content of a new ticket and identifies a set of semantically relevant tickets, and then creates a weighted Markov model from the resolution sequences of these tickets to generate routing recommendations. Our experiments show that the proposed approach achieves significantly better results than both sequence-only and content-only solutions.

Keywords

Expert Group Vector Space Model Keyword Query Naive Approach Resolution Rate 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Aas, K., Eikvil, L.: Text categorisation: A survey (1999)Google Scholar
  3. 3.
    Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proc. ICDE (1995)Google Scholar
  4. 4.
    Atkeson, C.G., Moore, A.W., Schaal, S.: Locally weighted learning (1996)Google Scholar
  5. 5.
    Balog, K., Azzopardi, L., de Rijke, M.: Formal models for expert finding in enterprise corpora. In: SIGIR, pp. 43–50 (2006)Google Scholar
  6. 6.
    Belkin, M., Niyogi, P., Sindhwani, V., Bartlett, P.: Manifold regularization: A geometric framework for learning from examples. Technical report, Journal of Machine Learning Research (2004)Google Scholar
  7. 7.
    Bishop, C.M.: Pattern Recognition and Machine Learning (Information Science and Statistics). Springer, Heidelberg (October 2007)Google Scholar
  8. 8.
    Cook, J., Wolf, A.: Discovering models of software processes from event-based data. ACM Trans. Software Eng. and Methodology 7(3), 215–249 (1998)CrossRefGoogle Scholar
  9. 9.
    Deng, H., King, I., Lyu, M.R.: Formal models for expert finding on dblp bibliography data. In: ICDM 2008: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, pp. 163–172 (2008)Google Scholar
  10. 10.
    Fang, H., Zhai, C.: Probabilistic models for expert finding. In: Amati, G., Carpineto, C., Romano, G. (eds.) ECIR 2007. LNCS, vol. 4425, pp. 418–430. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Gaaloul, W., Bhiri, S., Godart, C.: Discovering workflow transactional behavior from event-based log. In: Meersman, R., et al (eds.) OTM 2004. LNCS, vol. 3290, pp. 3–18. Springer, Heidelberg (2004)Google Scholar
  12. 12.
    Garcia, E.: Description, advantages and limitations of the classic vector space model (2006)Google Scholar
  13. 13.
    Hearst, M.: What is text mining? (2003), http://people.ischool.berkeley.edu/hearst/text-mining.html
  14. 14.
    Hechenbichler, K., Schliep, K.: Weighted k-nearest-neighbor techniques and ordinal classification. Technical report, Ludwig-Maximilians University (2007)Google Scholar
  15. 15.
    Joachims, T.: Text categorization with support vector machines: Learning with many relevant features. In: Nédellec, C., Rouveirol, C. (eds.) ECML 1998. LNCS, vol. 1398, pp. 137–142. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  16. 16.
    Lin, D.: Extracting collocations from text corpora. In First Workshop on Computational Terminology (1998)Google Scholar
  17. 17.
    New York Times. Text mining, http://blogs.zdnet.com/emergingtech/?p=304
  18. 18.
    Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.-C.: PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: Int. Conf. Data Engineering (2001)Google Scholar
  19. 19.
    Salton, G., McGill, M.J.: Introduction to Modern Information Retrieval. McGraw-Hill, Inc., New York (1986)Google Scholar
  20. 20.
    Sen, P., Namata, G.M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. Technical report (2008)Google Scholar
  21. 21.
    Serdyukov, P., Rode, H., Hiemstra, D.: Modeling multi-step relevance propagation for expert finding. In: CIKM, pp. 1133–1142 (2008)Google Scholar
  22. 22.
    Shao, Q., Chen, Y., Tao, S., Yan, X., Anerousis, N.: Easyticket: A ticket routing recommendation engine for enterprise problem resolution. In: 34th Int’l Conf. VLDB, Auckland, New Zealand (2008)Google Scholar
  23. 23.
    Shao, Q., Chen, Y., Tao, S., Yan, X., Anerousis, N.: Efficient ticket routing by resolution sequence mining. In: KDD 2008, pp. 605–613 (2008)Google Scholar
  24. 24.
    Silva, R., Zhang, J., Shanahan, J.G.: Probablistic workflow mining. In: Proc. 1998 Int’l Conf. Knowledge Discovery and Data Mining, pp. 469–483 (1998)Google Scholar
  25. 25.
    Yang, Y., Liu, X.: A re-examination of text categorization methods. In: SIGIR (1999)Google Scholar
  26. 26.
    Zaki, M.: SPADE: An efficient algorithm for mining frequent sequences. Machine Learning 40, 31–60 (2001)CrossRefGoogle Scholar
  27. 27.
    Zhai, C., Velivelli, A., Yu, B.: A cross-collection mixture model for comparative text mining. In: KDD 2004 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Peng Sun
    • 1
  • Shu Tao
    • 2
  • Xifeng Yan
    • 3
  • Nikos Anerousis
    • 2
  • Yi Chen
    • 1
  1. 1.Computer Science and EngineeringArizona State University 
  2. 2.IBM T. J. Watson Research Center 
  3. 3.Computer Science DepartmentUniversity of California at Santa Barbara 

Personalised recommendations