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

Improving mixture tree construction using better EM algorithms

Author

Listed:
  • Chen, Shu-Chuan (Grace)
  • Lindsay, Bruce

Abstract

This paper is concerned with hierarchical clustering of long binary sequence data. We propose two alternative improvements of the EM algorithm used in Chen and Lindsay (2006). One is the FixEM. It is just the regular EM but we no longer update the weights πs used in the ancestral mixture models. The other is the ModalEM. In this we cluster data according to the modes of an estimated density function for the data. In order to compare these methods with each other and other popular hierarchical clustering methods, we use a data example from the international HapMap project. We compare the speed and the ability of these methods to separate out true clusters. In addition, simulation studies are performed to compare the efficiency and accuracy of these methods. Our conclusion is that the new EM methods are far superior to the original, and that both provide useful alternatives to other standard clustering methods.

Suggested Citation

  • Chen, Shu-Chuan (Grace) & Lindsay, Bruce, 2014. "Improving mixture tree construction using better EM algorithms," Computational Statistics & Data Analysis, Elsevier, vol. 74(C), pages 17-25.
    • Handle: RePEc:eee:csdana:v:74:y:2014:i:c:p:17-25
    DOI: 10.1016/j.csda.2013.11.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947313004489
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2013.11.010?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. Hunter D.R. & Lange K., 2004. "A Tutorial on MM Algorithms," The American Statistician, American Statistical Association, vol. 58, pages 30-37, February.
    2. Shu-Chuan Chen & Bruce G. Lindsay, 2006. "Building mixture trees from binary sequence data," Biometrika, Biometrika Trust, vol. 93(4), pages 843-860, December.
    3. Berlinet, A.F. & Roland, Ch., 2012. "Acceleration of the EM algorithm: P-EM versus epsilon algorithm," Computational Statistics & Data Analysis, Elsevier, vol. 56(12), pages 4122-4137.
    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. Baran, Sándor, 2014. "Probabilistic wind speed forecasting using Bayesian model averaging with truncated normal components," Computational Statistics & Data Analysis, Elsevier, vol. 75(C), pages 227-238.

    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. Rasmus Lentz & Jean Marc Robin & Suphanit Piyapromdee, 2018. "On Worker and Firm Heterogeneity in Wages and Employment Mobility: Evidence from Danish Register Data," 2018 Meeting Papers 469, Society for Economic Dynamics.
    2. Jurgen A. Doornik, 2018. "Accelerated Estimation of Switching Algorithms: The Cointegrated VAR Model and Other Applications," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 45(2), pages 283-300, June.
    3. Songfeng Zheng, 2021. "KLERC: kernel Lagrangian expectile regression calculator," Computational Statistics, Springer, vol. 36(1), pages 283-311, March.
    4. Sakyajit Bhattacharya & Paul McNicholas, 2014. "A LASSO-penalized BIC for mixture model selection," 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. 8(1), pages 45-61, March.
    5. Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin, 2020. "Solving k-center problems involving sets based on optimization techniques," Journal of Global Optimization, Springer, vol. 76(1), pages 189-209, January.
    6. Florian Schwendinger & Bettina Grün & Kurt Hornik, 2021. "A comparison of optimization solvers for log binomial regression including conic programming," Computational Statistics, Springer, vol. 36(3), pages 1721-1754, September.
    7. Utkarsh J. Dang & Michael P.B. Gallaugher & Ryan P. Browne & Paul D. McNicholas, 2023. "Model-Based Clustering and Classification Using Mixtures of Multivariate Skewed Power Exponential Distributions," Journal of Classification, Springer;The Classification Society, vol. 40(1), pages 145-167, April.
    8. Galimberti, Giuliano & Soffritti, Gabriele, 2014. "A multivariate linear regression analysis using finite mixtures of t distributions," Computational Statistics & Data Analysis, Elsevier, vol. 71(C), pages 138-150.
    9. V. Maume-Deschamps & D. Rullière & A. Usseglio-Carleve, 2018. "Spatial Expectile Predictions for Elliptical Random Fields," Methodology and Computing in Applied Probability, Springer, vol. 20(2), pages 643-671, June.
    10. Sanjeena Subedi & Drew Neish & Stephen Bak & Zeny Feng, 2020. "Cluster analysis of microbiome data by using mixtures of Dirichlet–multinomial regression models," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 69(5), pages 1163-1187, November.
    11. Lian, Heng & Meng, Jie & Fan, Zengyan, 2015. "Simultaneous estimation of linear conditional quantiles with penalized splines," Journal of Multivariate Analysis, Elsevier, vol. 141(C), pages 1-21.
    12. van den Burg, G.J.J. & Groenen, P.J.F., 2014. "GenSVM: A Generalized Multiclass Support Vector Machine," Econometric Institute Research Papers EI 2014-33, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    13. Lv, Xiao-Guang & Jiang, Le & Liu, Jun, 2016. "Deblurring Poisson noisy images by total variation with overlapping group sparsity," Applied Mathematics and Computation, Elsevier, vol. 289(C), pages 132-148.
    14. Rasmus Lentz & Suphanit Piyapromdee & Jean-Marc Robin, 2022. "The Anatomy of Sorting - Evidence from Danish Data," Working Papers hal-03869383, HAL.
    15. Tian, Guo-Liang & Tang, Man-Lai & Liu, Chunling, 2012. "Accelerating the quadratic lower-bound algorithm via optimizing the shrinkage parameter," Computational Statistics & Data Analysis, Elsevier, vol. 56(2), pages 255-265.
    16. Vu, Duy & Aitkin, Murray, 2015. "Variational algorithms for biclustering models," Computational Statistics & Data Analysis, Elsevier, vol. 89(C), pages 12-24.
    17. Gunter Maris & Han Maas, 2012. "Speed-Accuracy Response Models: Scoring Rules based on Response Time and Accuracy," Psychometrika, Springer;The Psychometric Society, vol. 77(4), pages 615-633, October.
    18. Groenen, P.J.F. & Kaymak, U. & van Rosmalen, J.M., 2006. "Fuzzy clustering with Minkowski distance," Econometric Institute Research Papers EI 2006-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    19. Inoue, Masaaki & Pham, Thong & Shimodaira, Hidetoshi, 2020. "Joint estimation of non-parametric transitivity and preferential attachment functions in scientific co-authorship networks," Journal of Informetrics, Elsevier, vol. 14(3).
    20. Yen, Tso-Jung & Yen, Yu-Min, 2016. "Structured variable selection via prior-induced hierarchical penalty functions," Computational Statistics & Data Analysis, Elsevier, vol. 96(C), pages 87-103.

    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:74:y:2014:i:c:p:17-25. 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: 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.