Choosing initial values for the EM algorithm for finite mixtures
By Dimitris Karlis, Evdokia Xekalaki. Computational Statistics & Data Analysis, 2003
307 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/5b2c8076f28f1b138f7d6b16fc31a9eaab3cfe71
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Bettina Grün
- Dankmar Böhning
- Wilfried Seidel
- Friedrich Leisch
- Achim Zeileis
- Christian Kleiber
- Jeffrey B. Lewis
- A. Glenz
In Statistics and Probability
- Bettina Grün
- Dankmar Böhning
- Wilfried Seidel
- Friedrich Leisch
- Achim Zeileis
- Christian Kleiber
- Jeffrey B. Lewis
- Drew A. Linzer
Citations in the corpus
- FlexMix Version 2: Finite Mixtures with Concomitant Variables and Varying and Constant Parameters (2008, methodology): “Different initialization strategies for the EM algorithm have been proposed, as its convergence to the optimal solution depends on the initialization (Biernacki, Celeux, and Govaert 2003; Karlis and Xekalaki 2003).”
- Editorial: recent developments in mixture models (2003, background): “See Karlis and Xekalaki, 2003(SI), Biernacki et al., 2003(SI), Seidel et al. (2000), or B ohning (2002).”
- A simple nonparametric approach to estimating the distribution of random coefficients in structural models (2016, unknown): “Therefore by weak convergence, for any F1, F2 ∈ F such that dLP (F1, F2)→ 0, we also have |Q(F1)−Q(F2)| → 0 by (27) and (29).”