Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/12810
Nаziv: | A novel split-and-merge algorithm for hierarchical clustering of Gaussian mixture models | Аutоri: | Popović B. Janev M. Pekar, Darko Jakovljević, Nikša Gnjatović, Milan Sečujski, Milan Delić, Vlado |
Dаtum izdаvаnjа: | 1-јан-2012 | Čаsоpis: | Applied Intelligence | Sažetak: | The paper presents a novel split-and-merge algorithm for hierarchical clustering of Gaussian mixture models, which tends to improve on the local optimal solution determined by the initial constellation. It is initialized by local optimal parameters obtained by using a baseline approach similar to k-means, and it tends to approach more closely to the global optimum of the target clustering function, by iteratively splitting and merging the clusters of Gaussian components obtained as the output of the baseline algorithm. The algorithm is further improved by introducing model selection in order to obtain the best possible trade-off between recognition accuracy and computational load in a Gaussian selection task applied within an actual recognition system. The proposed method is tested both on artificial data and in the framework of Gaussian selection performed within a real continuous speech recognition system, and in both cases an improvement over the baseline method has been observed.. © 2011 Springer Science+Business Media, LLC. | URI: | https://open.uns.ac.rs/handle/123456789/12810 | ISSN: | 0924669X | DOI: | 10.1007/s10489-011-0333-9 |
Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
9
prоvеrеnо 20.11.2023.
Prеglеd/i stаnicа
44
Prоtеklа nеdеljа
5
5
Prоtеkli mеsеc
6
6
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.