Efficient ticket routing by resolution sequence mining

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 605-613

  Shao, Qihong ^a   Chen, Yi ^a   Tao, Shu ^b   Yan, Xifeng ^b   Anerousis, Nikos ^b  

^a Arizona State University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Markov model; Sequence mining; Workflow mining and optimization

Indexed keywords

ACTIVE STATE; CONDITIONAL ENTROPIES; HUMAN DECISIONS; MARKOV MODEL; PROBLEM MANAGEMENTS; PROBLEM RESOLUTIONS; REAL-WORLD PROBLEMS; ROUTING EFFICIENCIES; SEARCH ALGORITHMS; SEQUENCE MINING; WORKFLOW MINING AND OPTIMIZATION;

INFORMATION MANAGEMENT; LEARNING ALGORITHMS; MARKOV PROCESSES; ROUTING ALGORITHMS;

MINING;

EID: 65449159442     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401964     Document Type: Conference Paper

References (22)

1. R. Agrawal, D. Gunopulos, and F. Leymann. Mining process models from workflow logs. In Proc. 6th Int'l Conf. Extending Database Technology, 1998.
2. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. ICDE, 1995.
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.
4. C. Chatfield. Statistical inference regarding Markov chain models. Appl. Statist, 22:7-20, 1973.
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.
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.
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.
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.
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.
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.
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.
12. R. Kohavi, L. Mason, and Z. Zheng. Lessons and challenges from mining retail e-commerce data. Machine Learning, 57:83-113, 2004.
13. H. Mannila and D. Rusakov. Decomposition of event sequences into independent components. In Proc. 1st SIAM Conf. Data Mining, pages 1-17, 2001.
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.
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.
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.
17. A. Rozinat and W. van der Aalst. Decision mining in ProM. In LNCS, pages 420-425, 2006.
18. Q. Shao, Y. Chen, S. Tao, X. Yan, and N. Anerousis. Easy ticket: A ticket routing recommendation engine for enterprise problem resolution. 34th Int'l Conf. VLDB, 2008.
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.
20. J. Srivastava, R. Cooley, M. Deshpande, and P. Tan. Web usage mining: Discovery and applications of usage patterns from web data. SIGKDD Explorations, l(3):12-23, 2001.
21. W. van der Aalst, T. Weijters, and L. Maruster. Workflow mining: Discovering process models from event logs. IEEE Trans. Knowl Data Eng., 2004.
22. M. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 40:31-60, 2001.