Efficient ticket routing by resolution sequence mining

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Qihong Shao Arizona State University, Tempe, AZ, USA
Yi Chen Arizona State University, Tempe, AZ, USA
Shu Tao IBM T. J. Watson Research Center, Hawthorne, NY, USA
Xifeng Yan IBM T. J. Watson Research Center, Hawthorne, NY, USA
Nikos Anerousis IBM T. J. Watson Research Center, Hawthorne, NY, USA
Efficient ticket routing by resolution sequence mining Published by ACM 2008 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 43
· Downloads (cumulative): 427
· Citation Count: 15

Published in:
Cover Image
 
· Proceeding
KDD '08 Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Pages 605-613
ACM New York, NY, USA ©2008
table of contents ISBN: 978-1-60558-193-4 doi>10.1145/1401890.1401964

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder