Efficient ticket routing by resolution sequence mining
Qihong Shao, Yi Chen, Shu Tao et al. · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · 2008
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.
Cited by 74 works. doi:10.1145/1401890.1401964
Authors
References
- Mining sequential patterns
- Discovery of Frequent Episodes in Event Sequences
- Web usage mining
- PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth
- Workflow mining: discovering process models from event logs
- SPADE: An Efficient Algorithm for Mining Frequent Sequences
- Discovering models of software processes from event-based data
- Mining process models from workflow logs
- Data mining for path traversal patterns in a web environment
- Sequential PAttern mining using a bitmap representation