IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v27y2012i4p701-714.html
   My bibliography  Save this article

Constrained EM algorithm with projection method

Author

Listed:
  • Keiji Takai

Abstract

This paper proposes a new step called the P-step to handle the linear or nonlinear equality constraint in addition to the conventional EM algorithm. This new step is easy to implement, first because only the first derivatives of the object function and the constraint function are necessary, and secondly, because the P-step is carried out after the conventional EM algorithm. The estimate sequence produced by our method enjoys a monotonic increase in the observed likelihood function. We apply the P-step in addition to the conventional EM algorithm to the two illustrative examples. The first example has a linear constraint function. The second has a nonlinear constraint function. We show finally that there exists a Kuhn–Tucker vector at the limit point produced by our method. Copyright Springer-Verlag 2012

Suggested Citation

  • Keiji Takai, 2012. "Constrained EM algorithm with projection method," Computational Statistics, Springer, vol. 27(4), pages 701-714, December.
    • Handle: RePEc:spr:compst:v:27:y:2012:i:4:p:701-714
    DOI: 10.1007/s00180-011-0285-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00180-011-0285-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00180-011-0285-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sik-Yum Lee & Sin-Yu Tsang, 1999. "Constrained maximum likelihood estimation of two-level covariance structure model via EM type algorithms," Psychometrika, Springer;The Psychometric Society, vol. 64(4), pages 435-450, December.
    2. Jamshidian, Mortaza, 2004. "On algorithms for restricted maximum likelihood estimation," Computational Statistics & Data Analysis, Elsevier, vol. 45(2), pages 137-157, March.
    3. Donald Rubin & Dorothy Thayer, 1982. "EM algorithms for ML factor analysis," Psychometrika, Springer;The Psychometric Society, vol. 47(1), pages 69-76, March.
    4. Celeux, Gilles & Govaert, Gerard, 1992. "A classification EM algorithm for clustering and two stochastic versions," Computational Statistics & Data Analysis, Elsevier, vol. 14(3), pages 315-332, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pertaia Giorgi & Uryasev Stan, 2019. "Fitting heavy-tailed mixture models with CVaR constraints," Dependence Modeling, De Gruyter, vol. 7(1), pages 365-374, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sik-Yum Lee & Hong-Tu Zhu, 2002. "Maximum likelihood estimation of nonlinear structural equation models," Psychometrika, Springer;The Psychometric Society, vol. 67(2), pages 189-210, June.
    2. Adrian O’Hagan & Arthur White, 2019. "Improved model-based clustering performance using Bayesian initialization averaging," Computational Statistics, Springer, vol. 34(1), pages 201-231, March.
    3. François Bavaud, 2009. "Aggregation invariance in general clustering approaches," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 3(3), pages 205-225, December.
    4. Faicel Chamroukhi, 2016. "Piecewise Regression Mixture for Simultaneous Functional Data Clustering and Optimal Segmentation," Journal of Classification, Springer;The Classification Society, vol. 33(3), pages 374-411, October.
    5. Aßmann, Christian & Boysen-Hogrefe, Jens & Pape, Markus, 2012. "The directional identification problem in Bayesian factor analysis: An ex-post approach," Kiel Working Papers 1799, Kiel Institute for the World Economy (IfW Kiel).
    6. Chen, Derek H. C. & Gawande, Kishore, 2007. "Underlying dimensions of knowledge assessment : factor analysis of the knowledge assessment methodology data," Policy Research Working Paper Series 4216, The World Bank.
    7. Mukhopadhyay, Subhadeep & Ghosh, Anil K., 2011. "Bayesian multiscale smoothing in supervised and semi-supervised kernel discriminant analysis," Computational Statistics & Data Analysis, Elsevier, vol. 55(7), pages 2344-2353, July.
    8. Ying Zhang & Lei Hua & Jian Huang, 2010. "A Spline‐Based Semiparametric Maximum Likelihood Estimation Method for the Cox Model with Interval‐Censored Data," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 37(2), pages 338-354, June.
    9. Hornik, Kurt & Grün, Bettina, 2014. "movMF: An R Package for Fitting Mixtures of von Mises-Fisher Distributions," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 58(i10).
    10. Jin, Shaobo & Moustaki, Irini & Yang-Wallentin, Fan, 2018. "Approximated penalized maximum likelihood for exploratory factor analysis: an orthogonal case," LSE Research Online Documents on Economics 88118, London School of Economics and Political Science, LSE Library.
    11. M. Vrac & L. Billard & E. Diday & A. Chédin, 2012. "Copula analysis of mixture models," Computational Statistics, Springer, vol. 27(3), pages 427-457, September.
    12. Matteo Barigozzi, 2023. "Asymptotic equivalence of Principal Components and Quasi Maximum Likelihood estimators in Large Approximate Factor Models," Papers 2307.09864, arXiv.org, revised Jun 2024.
    13. repec:jss:jstsof:28:i04 is not listed on IDEAS
    14. Gregory Camilli & Jean-Paul Fox, 2015. "An Aggregate IRT Procedure for Exploratory Factor Analysis," Journal of Educational and Behavioral Statistics, , vol. 40(4), pages 377-401, August.
    15. Sentana, Enrique, 2004. "Factor representing portfolios in large asset markets," Journal of Econometrics, Elsevier, vol. 119(2), pages 257-289, April.
    16. Fiorentini, Gabriele & Galesi, Alessandro & Sentana, Enrique, 2018. "A spectral EM algorithm for dynamic factor models," Journal of Econometrics, Elsevier, vol. 205(1), pages 249-279.
    17. Chehade, Abdallah & Savargaonkar, Mayuresh & Krivtsov, Vasiliy, 2022. "Conditional Gaussian mixture model for warranty claims forecasting," Reliability Engineering and System Safety, Elsevier, vol. 218(PB).
    18. Bai, Jushan, 2024. "Likelihood approach to dynamic panel models with interactive effects," Journal of Econometrics, Elsevier, vol. 240(1).
    19. García-Escudero, L.A. & Gordaliza, A. & Mayo-Iscar, A. & San Martín, R., 2010. "Robust clusterwise linear regression through trimming," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3057-3069, December.
    20. Yves Grandvalet & Yoshua Bengio, 2004. "Learning from Partial Labels with Minimum Entropy," CIRANO Working Papers 2004s-28, CIRANO.
    21. Jianhua Zhao & Changchun Shang & Shulan Li & Ling Xin & Philip L. H. Yu, 2025. "Choosing the number of factors in factor analysis with incomplete data via a novel hierarchical Bayesian information criterion," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 19(1), pages 209-235, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:compst:v:27:y:2012:i:4:p:701-714. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.