Loading…
Speaker identification by combining multiple classifiers using Dempster–Shafer theory of evidence
This paper presents a multiple classifier approach as an alternative solution to the closed-set text-independent speaker identification problem. The proposed algorithm which is based on Dempster–Shafer theory of evidence computes the first and Rth level ranking statistics. Rth level confusion matric...
Saved in:
Published in: | Speech communication 2003-11, Vol.41 (4), p.531-547 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper presents a multiple classifier approach as an alternative solution to the closed-set text-independent speaker identification problem. The proposed algorithm which is based on Dempster–Shafer theory of evidence computes the first and
Rth level ranking statistics.
Rth level confusion matrices extracted from these ranking statistics are used to cluster the speakers into model sets where they share set specific properties. Some of these model sets are used to reflect the strengths and weaknesses of the classifiers while some others carry speaker dependent ranking statistics of the corresponding classifier. These information sets from multiple classifiers are combined to arrive at a joint decision. For the combination task, a rule-based algorithm is developed where Dempster’s rule of combination is applied in the final step. Experimental results have shown that the proposed method performed much better compared to some other rank-based combination methods. |
---|---|
ISSN: | 0167-6393 1872-7182 |
DOI: | 10.1016/S0167-6393(03)00032-3 |