Skip to main content
Log in

ON the Robustness of Mixture Index of Fit

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

The aim of this paper is to investigate the mixture index of fit in hypothesis testing problems from the point of view of robustness. The concept of contamination plot is introduced and an algorithm is proposed to determine it. Our algorithm is a remarkable application of the widely used EM algorithm by involving a two-phase M-step procedure. In the parametric phase the parameters of the model in the null hypothesis are estimated using the maximum likelihood method, while in the nonparametric phase the contaminating distribution is determined by a filling technique. It is proved that the objective function decreases monotonically during the iterations. Finally, the algorithm is applied and discussed when the hypothesis of independence is tested for contingency tables.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. R. Bahadur, “Stochastic comparison of tests,” Ann. Math. Stat., 31, 276–295 (1960).

    Article  MATH  MathSciNet  Google Scholar 

  2. R. R. Bahadur, Some Limit Theorems in Statistics, SIAM, Philadelphia (1971).

    Google Scholar 

  3. I. Csisz’ar, M. Isp’any, Gy. Michaletzky, T. Rudas, G. Tusn’ady, and E. Verdes, “Divergence minimization under prior inequality constraints,” in: Proceedings of the IEEE International Symposium on Information Theory, Washington (2001), p. 21.

    Google Scholar 

  4. P. Diaconis and B. Efron, “Testing for independence in a two-way contingency table: new interpretations of the chi–square statistics,” Ann. Stat., 13, 845–874 (1985).

    Article  MATH  MathSciNet  Google Scholar 

  5. A.P. Dempster, N.M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” J. Roy. Stat. Soc. B, 39, 1–22 (1977).

    MATH  MathSciNet  Google Scholar 

  6. D. L. Donoho and R. C. Liu, “The ‘automatic’ robustness of minimum distance functionals,” Ann. Stat., 16, 552–586 (1988).

    Article  MATH  MathSciNet  Google Scholar 

  7. A. K. Formann, “Testing the Rasch model by means of the mixture fit index,” Br. J. Mat. Stat. Psychol., 59, 89–95 (2006).

    Article  MathSciNet  Google Scholar 

  8. S. Heritier and E. Ronchetti, “Robust bounded-influence tests in general parametric models,” J. Am. Stat. Assoc., 89, 897–904 (1994).

    Article  MATH  MathSciNet  Google Scholar 

  9. P. J. Huber, Robust Statistics, Wiley, New York (1981).

    Google Scholar 

  10. P. J. Huber and V. Strassen, “Minimax tests and the Neyman–Pearson lemma for capacities,” Ann. Stat., 1, 251–263 (1973).

    Article  MATH  MathSciNet  Google Scholar 

  11. T. Ibaraki and N. Katoh, Resource Allocation Problems. Algorithmic Approaches, MIT Press, Cambridge (1988).

    Google Scholar 

  12. J. Liu, and B.G. Lindsay, “Building and using semiparametric tolerance regions for parametric multinomial models,” Ann. Stat., 37, 3644–3659 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  13. M. Markatou, W.A. Stahel, and E. Ronchetti, “Robust M-type testing procedures for linear models,” in: Directions in Robust Statistics and Diagnostics I, W. Stahel and S. Weisberg (eds.), Springer, New York (1991), pp. 201–220.

    Google Scholar 

  14. G. J. McLachlan and T. Krishnan, The EM Algorithm and Extensions, Wiley, New York (1997).

    Google Scholar 

  15. T.R.C. Read and N.A.C. Cressie, Goodness-of-fit Statistics for Discrete Multivariate Analysis, Springer, New York (1988).

    Google Scholar 

  16. J. Revuelta, “Estimating the π∗ goodness of fit index for finite mixtures of item response models,” Br. J. Mat. Stat. Psychol., 61, 93–113 (2008).

    Article  MathSciNet  Google Scholar 

  17. T. Rudas, C.C. Clogg, and B.G. Lindsay, “A new index of fit based on mixture method for the analysis of contingency tables,” J. Roy. Stat. Soc. B, 56, 623–639 (1994).

    MATH  MathSciNet  Google Scholar 

  18. R. Snee, “Graphical display of two-way contingency table,” Am. Stat., 38, 9–12 (1987).

    Google Scholar 

  19. G. Tusn’ady, “On asymptotically optimal tests,” Ann. Stat., 5, 385–393 (1977).

    Article  MathSciNet  Google Scholar 

  20. P.H. Zipkin, “Simple ranking methods for allocation of one resource,” Manage. Sci., 26, 34–43 (1980).

    Article  MATH  MathSciNet  Google Scholar 

  21. E. Verdes, “Finding and characterization of local optima in the π∗ problem for two-way contingency tables,” Stud. Math. Hung., 36, 471–480 (2000).

    MATH  MathSciNet  Google Scholar 

  22. L. Xi, Measuring goodness-of-fit in the analysis of contingency tables with mixture based indices: Algorithms, asymptotics and inference, PhD Dissertation, Pennsylvania State Univ. (1996).

    Google Scholar 

  23. L. Xi and B.G. Lindsay, “A note on calculating the π∗ index of fit for the analysis of contingency tables,” Sociol. Methods Res., 25, 248–259 (1996).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Isp’any.

Additional information

Proceedings of the XXVI International Seminar on Stability Problems for Stochastic Models, Sovata-Bai, Romania, August 27 – September 2, 2006.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Isp’any, M., Verdes, E. ON the Robustness of Mixture Index of Fit. J Math Sci 200, 432–440 (2014). https://doi.org/10.1007/s10958-014-1925-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-014-1925-9

Keywords

Navigation