skip to main content
10.1145/1401890.1401964acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Efficient ticket routing by resolution sequence mining

Authors Info & Claims
Published:24 August 2008Publication History

ABSTRACT

IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing---transferring problem ticket among various expert groups in search of the right resolver to the ticket. To achieve efficient ticket routing, wise decision needs to be made at each step of ticket transfer to determine which expert group is likely to be, or to lead to the resolver.

In this paper, we address the possibility of improving ticket routing efficiency by mining ticket resolution sequences alone, without accessing ticket content. To demonstrate this possibility, a Markov model is developed to statistically capture the right decisions that have been made toward problem resolution, where the order of the Markov model is carefully chosen according to the conditional entropy obtained from ticket data. We also design a search algorithm, called Variable-order Multiple active State search(VMS), that generates ticket transfer recommendations based on our model. The proposed framework is evaluated on a large set of real-world problem tickets. The results demonstrate that VMS significantly improves human decisions: Problem resolvers can often be identified with fewer ticket transfers.

References

  1. R. Agrawal, D. Gunopulos, and F. Leymann. Mining process models from workflow logs. In Proc. 6th Int'l Conf. Extending Database Technology, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. ICDE, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Ayres, J. Gehrke, T. Yiu, and J. Flannick. Sequential pattern mining using a bitmap representation. In Proc. 2002 ACM Int. Conf. Knowledge Discovery in Databases, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. C. Chatfield. Statistical inference regarding Markov chain models. Appl. Statist., 22:7--20, 1973.Google ScholarGoogle ScholarCross RefCross Ref
  5. M. Chen, J. Park, and P. Yu. Data mining for path traversal patterns in a web environment. In Proc. 16th Int. Conf. on Distributed Computing Systems, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Cook and A. Wolf. Discovering models of software processes from event--based data. ACM Trans. Software Eng. and Methodology, 7(3):215--249, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Cook and A. Wolf. Event-based detection of concurrency. In Proc. 6th Int'l Symp. the Funcations of Software Eng., pages 35--45, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Finesso, C.-C. Liu, and P. Narayan. The optimal error exponent for Markov order estimation. IEEE Trans. on Information Theory, 42(5):1488--1497, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. W. Gaaloul, S. Alaoui, K. Baïna, and C. Godart. Mining workflow patterns through event-data analysis. In Proc. SAINT Workshops, pages 226--229, 2005 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. W. Gaaloul, S. Bhiri, and C. Godart. Discovering workflow transactional behavior from event-based log. In Proc 12th Int'l Conf. CoopIS, pages 3--18, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  11. W. Gaaloul and C. Godart. Mining workflow recovery from event based logs. In Proc. 3rd Int'l Conf. Business Process Management, pages 169--185, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. Kohavi, L. Mason, and Z. Zheng. Lessons and challenges from mining retail e-commerce data. Machine Learning, 57:83--113, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. Mannila and D. Rusakov. Decomposition of event sequences into independent components. In Proc. 1st SIAM Conf. Data Mining, pages 1--17, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  14. H. Mannila, H. Toivonen, and A. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3):259--289, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Mobasher, N. Jain, E. Han, and J. Srivastava. Web mining: Pattern discovery from world wide web transactions. In TR 96-050, Univ. of Minnesota, Dept. of Computer Science, 1996.Google ScholarGoogle Scholar
  16. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Int. Conf. Data Engineering, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. A. Rozinat and W. van der Aalst. Decision mining in ProM. In LNCS, pages 420--425, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, and Nikos Anerousis. Easyticket: A ticket routing recommendation engine for enterprise problem resolution. 34th Int'l Conf. VLDB, 2008.Google ScholarGoogle Scholar
  19. R. Silva, J. Zhang, and J. G. Shanahan. Probablistic workflow mining. In Proc. 1998 Int'l Conf Knowledge Discovery and Data Mining, pages 469--483, 1998.Google ScholarGoogle Scholar
  20. J. Srivastava, R. Cooley, M. Deshpande, and P. Tan. Web usage mining: Discovery and applications of usage patterns from web data. SIGKDD Explorations, 1(3):12--23, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. W. van der Aalst, T. Weijters, and L. Maruster. Workflow mining: Discovering process models from event logs. IEEE Trans. Knowl. Data Eng., 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 40:31--60, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient ticket routing by resolution sequence mining

    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
    • Published in

      cover image ACM Conferences
      KDD '08: Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
      August 2008
      1116 pages
      ISBN:9781605581934
      DOI:10.1145/1401890
      • General Chair:
      • Ying Li,
      • Program Chairs:
      • Bing Liu,
      • Sunita Sarawagi

      Copyright © 2008 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: 24 August 2008

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      KDD '08 Paper Acceptance Rate118of593submissions,20%Overall Acceptance Rate1,133of8,635submissions,13%

      Upcoming Conference

      KDD '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader