1994
DOI: 10.1109/89.294362
|View full text |Cite
|
Sign up to set email alerts
|

Maximum likelihood clustering of Gaussians for speech recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
28
0
1

Year Published

1994
1994
2014
2014

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 48 publications
(30 citation statements)
references
References 14 publications
1
28
0
1
Order By: Relevance
“…Oftentimes, some sort of hybrid algorithm is developed for a particular application. Real-world applications of hierarchical clustering can be found in the following references: speech recognition [14], web mining [15], lung cancer research [16], and document mining [17]. A wide variety of techniques are presented in these papers.…”
Section: Figurementioning
confidence: 99%
“…Oftentimes, some sort of hybrid algorithm is developed for a particular application. Real-world applications of hierarchical clustering can be found in the following references: speech recognition [14], web mining [15], lung cancer research [16], and document mining [17]. A wide variety of techniques are presented in these papers.…”
Section: Figurementioning
confidence: 99%
“…Top-down decision tree clustering [6] is a sequential algorithm that is often used for context-dependent acoustic modeling on LVCSR tasks. The algorithm uses a tree structure to represent the current status of clustering, and each node in the tree represents a set of acoustic contexts and their corresponding training data.…”
Section: Model Hierarchy Constructionmentioning
confidence: 99%
“…• Identifying the most likely subset of mixture components of the boot system for each cluster of HMM states Si and using these subsets Q (Si) c Q (S) as seed codebooks for the next phase • Copying the original eodebook multiple times (one for each cluster of states) and performing one iteration of the BaumWelch algorithm over the training data with the new tying scheme; the number of component densities in each codebook can then be reduced using clustering [10] 2,3, Reestimation…”
Section: Splitting and Pruningmentioning
confidence: 99%