Content-Aware Resolution Sequence Mining for Ticket Routing

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.

[1]  Lise Getoor,et al.  Collective Classification in Network Data , 2008, AI Mag..

[2]  Peter Ingwersen,et al.  Developing a Test Collection for the Evaluation of Integrated Search , 2010, ECIR.

[3]  Céline Rouveirol,et al.  Machine Learning: ECML-98 , 1998, Lecture Notes in Computer Science.

[4]  Christopher M. Bishop,et al.  Pattern Recognition and Machine Learning (Information Science and Statistics) , 2006 .

[5]  Thorsten Joachims,et al.  Text Categorization with Support Vector Machines: Learning with Many Relevant Features , 1998, ECML.

[6]  Mikhail Belkin,et al.  Manifold Regularization : A Geometric Framework for Learning from Examples , 2004 .

[7]  Mohammed J. Zaki,et al.  SPADE: An Efficient Algorithm for Mining Frequent Sequences , 2004, Machine Learning.

[8]  Kjersti Aas,et al.  Text Categorisation: A Survey , 1999 .

[9]  Mikhail Belkin,et al.  Manifold Regularization: A Geometric Framework for Learning from Labeled and Unlabeled Examples , 2006, J. Mach. Learn. Res..

[10]  Yi Chen,et al.  EasyTicket: a ticket routing recommendation engine for enterprise problem resolution , 2008, Proc. VLDB Endow..

[11]  L. Dekang,et al.  Extracting collocations from text corpora , 1998 .

[12]  Ricardo Bezerra de Andrade e Silva,et al.  Probabilistic workflow mining , 2005, KDD '05.

[13]  M. de Rijke,et al.  Formal models for expert finding in enterprise corpora , 2006, SIGIR.

[14]  Djoerd Hiemstra,et al.  Modeling multi-step relevance propagation for expert finding , 2008, CIKM '08.

[15]  Alexander L. Wolf,et al.  Discovering models of software processes from event-based data , 1998, TSEM.

[16]  Andrew W. Moore,et al.  Locally Weighted Learning , 1997, Artificial Intelligence Review.

[17]  Qiming Chen,et al.  PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.

[18]  ChengXiang Zhai,et al.  Probabilistic Models for Expert Finding , 2007, ECIR.

[19]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[20]  Bei Yu,et al.  A cross-collection mixture model for comparative text mining , 2004, KDD.

[21]  Hongbo Deng,et al.  Formal Models for Expert Finding on DBLP Bibliography Data , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[22]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[23]  Yi Chen,et al.  Efficient ticket routing by resolution sequence mining , 2008, KDD.

[24]  Umeshwar Dayal,et al.  PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.

[25]  Nasser M. Nasrabadi,et al.  Pattern Recognition and Machine Learning , 2006, Technometrics.

[26]  Walid Gaaloul,et al.  Discovering Workflow Transactional Behavior from Event-Based Log , 2004, CoopIS/DOA/ODBASE.

[27]  Klaus Hechenbichler,et al.  Weighted k-Nearest-Neighbor Techniques and Ordinal Classification , 2004 .

[28]  Robert Meersman,et al.  On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE , 2004, Lecture Notes in Computer Science.

[29]  Hajo Hippner,et al.  Text Mining , 2006, Informatik-Spektrum.

[30]  Yiming Yang,et al.  A re-examination of text categorization methods , 1999, SIGIR '99.

[31]  Weiss,et al.  Text Mining , 2010 .