首页 | 本学科首页   官方微博 | 高级检索  
     


estimation of mixture complexity for count data
Authors:T. Umashanger  T.N. Sriram  
Affiliation:aDepartment of Statistics, University of Georgia, Athens, GA 30602-1952, United States
Abstract:For count data, robust estimation of the number of mixture components in finite mixtures is revisited using L2 distance. An information criterion based on L2 distance is shown to yield an estimator, which is also shown to be strongly consistent. Monte Carlo simulations show that our estimator is competitive with other procedures in correctly determining the number of components when the data comes from Poisson mixtures. When the data comes from a negative binomial mixture but the postulated model is a Poisson mixture, simulations show that our estimator is highly competitive with the minimum Hellinger distance (MHD) estimator in terms of robustness against model misspecification. Furthermore, we illustrate the performance of our estimator for a real dataset with overdispersion and zero-inflation. Computational simplicity combined with robustness property makes the L2E approach an attractive alternative to other procedures in the literature.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号