2009
DOI: 10.1016/j.specom.2009.02.007
|View full text |Cite
|
Sign up to set email alerts
|

Probabilistic scoring using decision trees for fast and scalable speaker recognition

Abstract: To cite this version:Gilles Gonon, Frédéric Bimbot, Rémi Gribonval. Probabilistic scoring using decision trees for fast and scalable speaker recognition. Speech Communication, Elsevier : North-Holland, 2009, 51 (11) AbstractIn the context of fast and low cost speaker recognition, this article investigates several techniques based on decision trees. A new approach is introduced where the trees are used to estimate a score function rather than returning a decision among classes. This technique is developed to a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…A DT based face recognition using local binary patterns (LBP) is discussed in [4]. A fast and low cost speaker verification using DT is investigated in [5]. In this, DT is used to estimate a score function based on Gaussian Mixture Model (GMM) log-likelihood ratio.…”
Section: The Prior Work and Motivationmentioning
confidence: 99%
“…A DT based face recognition using local binary patterns (LBP) is discussed in [4]. A fast and low cost speaker verification using DT is investigated in [5]. In this, DT is used to estimate a score function based on Gaussian Mixture Model (GMM) log-likelihood ratio.…”
Section: The Prior Work and Motivationmentioning
confidence: 99%
“…BioID system, which was developed by Frischholz et al [9] associates different decision strategies for different biometric modalities but lacks from the automatic generation of adaptive strategies for desired performance. Some attempts in decision level fusion have also been made using k-NN (k-Nearest Neighbor) [10] [11], neural networks(NN) [12] [13], decisiontree(DT) [14] [15] [16] [17] , and support vector machine(SVM) [18] [19]. While considering the scaled independent contribution of input data to the output target vector, support vector machine (SVM), logistic regression and nearest neighbor methods produce satisfactory results.…”
Section: Introductionmentioning
confidence: 99%