کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
415200 681188 2009 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
L2EL2E estimation of mixture complexity for count data
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
L2EL2E estimation of mixture complexity for count data
چکیده انگلیسی

For count data, robust estimation of the number of mixture components in finite mixtures is revisited using L2L2 distance. An information criterion based on L2L2 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 (MHDMHD) 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 L2EL2E approach an attractive alternative to other procedures in the literature.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computational Statistics & Data Analysis - Volume 53, Issue 12, 1 October 2009, Pages 4243–4254
نویسندگان
, ,