A Comparison of some Different Techniques for Vector Based Call-Routing

Cox, S. J. and Shahshahani, B (2001) A Comparison of some Different Techniques for Vector Based Call-Routing. In: Proceedings of the 7th European Conference on Speech Communication and Technology (EUROSPEECH-2001), 2001-09-03 - 2001-09-07.

Full text not available from this repository. (Request a copy)

Abstract

Two approaches to vector-based call-routing are described, one based on matching queries to routes and the other on matching queries directly to stored queries. We argue that there are some problems with the former approach, both when used directly and when latent semantic analysis (LSA) is used to reduce the dimensionality of the vectors. However, the second approach imposes a higher computational load than the first and we have experimented with reducing the number of reference vectors (using the multi-edit and condense algorithm) and the dimensionality of the vectors (using linear discriminant analysis (LDA)). Results are presented for the task of routing queries on banking and financial services to one of thirty-two destinations. Best results (5.1% routing error) were obtained by first using LSA to smooth the query vectors followed by LDA to increase discrimination and reduce vector dimensionality.

Item Type: Conference or Workshop Item (Paper)
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 28 Jul 2011 16:20
Last Modified: 18 Mar 2020 08:26
URI: https://ueaeprints.uea.ac.uk/id/eprint/21954
DOI:

Actions (login required)

View Item View Item