Content-aware resolution sequence mining for ticket routing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6336 LNCS, Issue , 2010, Pages 243-259

  Sun, Peng ^a   Tao, Shu ^b   Yan, Xifeng ^c   Anerousis, Nikos ^b   Chen, Yi ^a  

^a Arizona State University   (United States)

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

^c University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; ENTERPRISE RESOURCE MANAGEMENT; MARKOV PROCESSES;

CONTENT-AWARE; HYBRID APPROACH; IT PROBLEMS; REAL-WORLD PROBLEM; SEQUENCE MINING; TEXT CONTENT; WEIGHTED MARKOV;

ADMINISTRATIVE DATA PROCESSING;

EID: 78049243451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15618-2_18     Document Type: Conference Paper

References (27)

1. DBLP: http://www.informatik.uni-trier.de/~ley/db
2. Aas, K., Eikvil, L.: Text categorisation: A survey (1999)
3. Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proc. ICDE (1995)
4. Atkeson, C. G., Moore, A. W., Schaal, S.: Locally weighted learning (1996)
5. Balog, K., Azzopardi, L., De Rijke, M.: Formal models for expert finding in enterprise corpora. In: SIGIR, pp. 43-50 (2006) (Pubitemid 44626592)
6. 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) (Pubitemid 44708005)
7. Bishop, C. M.: Pattern Recognition and Machine Learning (Information Science and Statistics). Springer, Heidelberg (October 2007)
8. Cook, J., Wolf, A.: Discovering models of software processes from event-based data. ACM Trans. Software Eng. and Methodology 7(3), 215-249 (1998) (Pubitemid 128658170)
9. 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)
10. 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) (Pubitemid 350259569)
11. Gaaloul, W., Bhiri, S., Godart, C.: Discovering workflow transactional behavior from eventbased log. In: Meersman, R., et al (eds.) OTM 2004. LNCS, vol. 3290, pp. 3-18. Springer, Heidelberg (2004) (Pubitemid 39750424)
12. Garcia, E.: Description, advantages and limitations of the classic vector space model (2006)
13. Hearst, M.: What is text mining? (2003), http://people.ischool.berkeley. edu/hearst/text-mining.html
14. Hechenbichler, K., Schliep, K.: Weighted k-nearest-neighbor techniques and ordinal classification. Technical report, Ludwig-Maximilians University (2007)
15. 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) (Pubitemid 128067178)
16. Lin, D.: Extracting collocations from text corpora. In First Workshop on Computational Terminology (1998)
17. New York Times. Text mining, http://blogs.zdnet.com/emergingtech/?p=304
18. 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) (Pubitemid 32457120)
19. Salton, G., McGill, M. J.: Introduction to Modern Information Retrieval. McGraw-Hill, Inc., New York (1986)
20. Sen, P., Namata, G. M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. Technical report (2008)
21. Serdyukov, P., Rode, H., Hiemstra, D.: Modeling multi-step relevance propagation for expert finding. In: CIKM, pp. 1133-1142 (2008) (Pubitemid 351499078)
22. 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)
23. Shao, Q., Chen, Y., Tao, S., Yan, X., Anerousis, N.: Efficient ticket routing by resolution sequence mining. In: KDD 2008, pp. 605-613 (2008)
24. 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)
25. Yang, Y., Liu, X.: A re-examination of text categorization methods. In: SIGIR (1999)
26. Zaki, M.: SPADE: An efficient algorithm for mining frequent sequences. Machine Learning 40, 31-60 (2001) (Pubitemid 32872398)
27. Zhai, C., Velivelli, A., Yu, B.: A cross-collection mixture model for comparative text mining. In: KDD 2004(2004) (Pubitemid 40115001)