An optimal Bhattacharyya centroid algorithm for Gaussian clustering with applications in automatic speech recognition

The problem of clustering Gaussian distributions can be effectively solved by standard vector quantization algorithms where the metric is defined by the Bhattacharyya distance. This paper presents a novel algorithm for computing the optimal centroid for a cluster of Gaussian distributions according...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Rigazio, L., Tsakam, B., Junqua, J.-C.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Clustering algorithms Distributed computing Gaussian distribution Hidden Markov models Maximum likelihood decoding Runtime Speech analysis Speech recognition Upper bound Vector quantization
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!