Optimizing SVMs for complex call classification
Patrick Haffner, Gökhan Tür, J. H. Wright · IEEE International Conference on Acoustics Speech and Signal Processing · 2003
Large margin classifiers such as support vector machines (SVM) or Adaboost are obvious choices for natural language document or call routing. However, how to combine several binary classifiers to optimize the whole routing process and how this process scales when it involves many different decisions (or classes) is a complex problem that has only received partial answers. We propose a global optimization process based on an optimal channel communication model that allows a combination of possibly heterogeneous binary classifiers. As in Markov modeling, computational feasibility is achieved through simplifications and independence assumptions that are easy to interpret. Using this approach, we have managed to decrease the call-type classification error rate for AT&T's How May I Help You (HMIHY/sup (sm)/) natural dialog system by 50 %.
Cited by 214 works. doi:10.1109/icassp.2003.1198860
Authors
References
- Statistical Learning Theory
- Text categorization with Support Vector Machines: Learning with many relevant features
- Making Large-Scale SVM Learning Practical
- Probabilistic Outputs for Support vector Machines and Comparisons to Regularized Likelihood Methods
- BoosTexter: A Boosting-based System for Text Categorization
- Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers
- Finding consensus in speech recognition: word error minimization and other applications of confusion networks
- How may I help you?
- A new multi-class SVM based on a uniform convergence result
- Automatic acquisition of salient grammar fragments for call-type classification