Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 214

The DOI matches its Crossref record.

Optimizing SVMs for complex call classification

Haffner, P., Tur, G., Wright, J.H.·2003·2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).

Abstract

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 %.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icassp.2003.1198860

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 14

  1. platt, 1999, Probabilistic outputs for support vector machines and comparison to regularized likelihood methods, NIPS
  2. tur, 2002, Improving spoken language understanding using word confusion networks, Proc of ICSLP
  3. 10.1109/MC.2002.993771 · DOI
  4. schapire, 2002, Incorporating prior knowledge in boosting, Proc of ICML
  5. wright, 1997, Automatic acquisition of salient grammar fragments for call-type classification, Proc of Eurospeech, 1419, 10.21437/Eurospeech.1997-413 · doi:10.21437/eurospeech.1997-413
  6. 10.1006/csla.2000.0152 · DOI · Paper page
  7. vapnik, 1998, Statistical Learning Theory
  8. 10.1016/S0167-6393(97)00040-X · DOI · Paper page
  9. larson, 2002, Exploring sub-word features and linear support vector machines for german spoken document classification, Proc of ICSLP
  10. joachims, 1998, Text categorization with support vector machines: learning with many relevant features, Proc of ECML-98
  11. guermeur, 2000, A new multiclass SVM based on a uniform convergence result, Proc of IJCNN
  12. allwein, 2000, Reducing multiclass to binary: A unifying approach for margin classifiers, Proc of ICML
  13. 10.1023/A:1007649029923 · DOI · Paper page
  14. joachims, 1999, Making large-scale svm learning practical, Advances in Kernel Methods Support Vector Learning

Cited by

See all 214

Metadata

Authors
Haffner, P., Tur, G., & Wright, J. H.
Venue
2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03).
Publisher
IEEE
Published
2003-11-21
Volume
1
Pages
I-632-I-635
ISSN
1520-6149 (ISSN-L)
OpenAlex
W1550863320
Cited by
214
References
0
FWCI
7.61
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Optimizing SVMs for complex call classification. https://app.cochat.ai/papers/10.1109/icassp.2003.1198860
The paper
Haffner, P., Tur, G., & Wright, J. H. (2003). Optimizing SVMs for complex call classification. 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). https://doi.org/10.1109/icassp.2003.1198860

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.