IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v55y2011i12p3381-3385.html
   My bibliography  Save this article

A note on the binomial model with simplex constraints

Author

Listed:
  • Tian, Guo-Liang
  • Ng, Kai Wang
  • Yu, Philip L.H.

Abstract

Liu (2000) considered maximum likelihood estimation and Bayesian estimation in a binomial model with simplex constraints using the expectation-maximization (EM) and data augmentation (DA) algorithms. By introducing latent variables {Zij} and {Yij} (to be defined later), he formulated the constrained parameter problem into a missing data problem. However, the derived DA algorithm does not work because he actually assumed that the {Yij} are known. Furthermore, although the final results from the derived EM algorithm are correct, his findings are based on the assumption that the {Yij} are observable. This note provides a correct DA algorithm. In addition, we obtained the same E-step and M-step under the assumption that the {Yij} are unobservable. A real example is used for illustration.

Suggested Citation

  • Tian, Guo-Liang & Ng, Kai Wang & Yu, Philip L.H., 2011. "A note on the binomial model with simplex constraints," Computational Statistics & Data Analysis, Elsevier, vol. 55(12), pages 3381-3385, December.
  • Handle: RePEc:eee:csdana:v:55:y:2011:i:12:p:3381-3385
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947311002064
    Download Restriction: Full text for ScienceDirect subscribers only.
    ---><---

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

    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:eee:csdana:v:55:y:2011:i:12:p:3381-3385. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.