| Multi-focal learning and its application to customer service support |
| Full text |
Mov
(21:58),
Pdf
(1.37 MB)
|
Source
|
International Conference on Knowledge Discovery and Data Mining
archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
table of contents
Paris, France
SESSION: Research track papers
table of contents
Pages 349-358
Year of Publication: 2009
ISBN:978-1-60558-495-9
|
|
Authors
|
|
Yong Ge
|
Rutgers, the State University of New Jersey, Newark, NJ, USA
|
|
Hui Xiong
|
Rutgers, the State University of New Jersey, Newark, NJ, USA
|
|
Wenjun Zhou
|
Rutgers, the State University of New Jersey, Newark, NJ, USA
|
|
Ramendra Sahoo
|
IBM T.J. Watson Research Center, New York, NY, USA
|
|
Xiaofeng Gao
|
University of Texas at Dallas, Richardson, TX, USA
|
|
Weili Wu
|
University of Texas at Dallas, Richardson, TX, USA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 27, Downloads (12 Months): 87, Citation Count: 0
|
|
|
ABSTRACT
In this study, we formalize a multi-focal learning problem, where training data are partitioned into several different focal groups and the prediction model will be learned within each focal group. The multi-focal learning problem is motivated by numerous real-world learning applications. For instance, for the same type of problems encountered in a customer service center, the problem descriptions from different customers can be quite different. The experienced customers usually give more precise and focused descriptions about the problem. In contrast, the inexperienced customers usually provide more diverse descriptions. In this case, the examples from the same class in the training data can be naturally in different focal groups. As a result, it is necessary to identify those natural focal groups and exploit them for learning at different focuses. The key developmental challenge is how to identify those focal groups in the training data. As a case study, we exploit multi-focal learning for profiling problems in customer service centers. The results show that multifocal learning can significantly boost the learning accuracies of existing learning algorithms, such as Support Vector Machines (SVMs), for classifying customer problems.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
C.-C. Chang and C.-J. Lin. Libsvm: http://www.csie.ntu.edu.tw/ cjlin/libsvm/.
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
V. Goel and W. Byrne. Minimum bayes risk methods automatic speech recognition. Computer Speech and Language, 14(2):115--135, 2000.
|
| |
8
|
P. Johansson and J. Olhager. Industrial service profiling: Matching service offerings and processes. International Journal of Production Economics, 2003.
|
 |
9
|
Junjie Wu , Hui Xiong , Peng Wu , Jian Chen, Local decomposition for rare class analysis, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, August 12-15, 2007, San Jose, California, USA
[doi> 10.1145/1281192.1281279]
|
| |
10
|
G. Karypis. Cluto: http://glaros.dtc.umn.edu/gkhome/views/cluto.
|
| |
11
|
L.Brown and et al. Statistical analysis of a telephone call center: a queueing science perspective. Technical report, The Wharton School, 2002.
|
| |
12
|
M.Cristani and R.Cuel. A survey on ontology creation methodologies. International Journal on Semantic Web and Information Systems, 2005.
|
| |
13
|
M. Porter. An algorithm for suffix stripping. Program, 1980.
|
| |
14
|
G. Riccardi , A. Gorin , A. Ljolje , M. Riley, A Spoken Language System for Automated Call Routing, Proceedings of the 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '97)-Volume 2, p.1143, April 21-24, 1997
|
| |
15
|
B. Scholkopf and A. J. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
|
| |
16
|
I. W. V. Server. www.ibm.com/software/pervasive/voice server.
|
| |
17
|
|
| |
18
|
W.Cohen. Fast effective rule induction. In ICML, 1995.
|
|