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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aas, K., Eikvil, L.: Text categorisation: A survey (1999)
Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proc. ICDE (1995)
Atkeson, C.G., Moore, A.W., Schaal, S.: Locally weighted learning (1996)
Balog, K., Azzopardi, L., de Rijke, M.: Formal models for expert finding in enterprise corpora. In: SIGIR, pp. 43–50 (2006)
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)
Bishop, C.M.: Pattern Recognition and Machine Learning (Information Science and Statistics). Springer, Heidelberg (October 2007)
Cook, J., Wolf, A.: Discovering models of software processes from event-based data. ACM Trans. Software Eng. and Methodology 7(3), 215–249 (1998)
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)
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)
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)
Garcia, E.: Description, advantages and limitations of the classic vector space model (2006)
Hearst, M.: What is text mining? (2003), http://people.ischool.berkeley.edu/hearst/text-mining.html
Hechenbichler, K., Schliep, K.: Weighted k-nearest-neighbor techniques and ordinal classification. Technical report, Ludwig-Maximilians University (2007)
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)
Lin, D.: Extracting collocations from text corpora. In First Workshop on Computational Terminology (1998)
New York Times. Text mining, http://blogs.zdnet.com/emergingtech/?p=304
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)
Salton, G., McGill, M.J.: Introduction to Modern Information Retrieval. McGraw-Hill, Inc., New York (1986)
Sen, P., Namata, G.M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. Technical report (2008)
Serdyukov, P., Rode, H., Hiemstra, D.: Modeling multi-step relevance propagation for expert finding. In: CIKM, pp. 1133–1142 (2008)
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)
Shao, Q., Chen, Y., Tao, S., Yan, X., Anerousis, N.: Efficient ticket routing by resolution sequence mining. In: KDD 2008, pp. 605–613 (2008)
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)
Yang, Y., Liu, X.: A re-examination of text categorization methods. In: SIGIR (1999)
Zaki, M.: SPADE: An efficient algorithm for mining frequent sequences. Machine Learning 40, 31–60 (2001)
Zhai, C., Velivelli, A., Yu, B.: A cross-collection mixture model for comparative text mining. In: KDD 2004 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, P., Tao, S., Yan, X., Anerousis, N., Chen, Y. (2010). Content-Aware Resolution Sequence Mining for Ticket Routing. In: Hull, R., Mendling, J., Tai, S. (eds) Business Process Management. BPM 2010. Lecture Notes in Computer Science, vol 6336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15618-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-15618-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15617-5
Online ISBN: 978-3-642-15618-2
eBook Packages: Computer ScienceComputer Science (R0)