Stochastic Estimation of a Mixture of Normal Density Functions Using an Information Criterion

IEEE Transactions on Information Theory

Volumn IT-16, Issue 3, 1970, Pages 258-263

  Young, Tzay Y ^a   Coraluppi, Giorgio ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Compunetix Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; PROBABILITY; STOCHASTIC ESTIMATION;

EID: 0014779869     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1970.1054454     Document Type: Article

References (23)

1. S. Kullback, Information Theory and Statistics. New York: Dover, 1968.
2. D. B. Cooper and P. W. Cooper, “Nonsupervised adaptive signal detection and pattern recognition,” Inform. and Control, vol. 7, pp. 416–444, 1964.
3. D. Gregg and J. C. Hancock, “An optimum decision-directed scheme for Gaussian mixtures,” IEEE Trans. Information Theory, vol. IT-14, pp. 451–461, May 1968.
4. Y. T. Chien and K. S. Fu, “On Bayesian learning and stochastic approximation,” IEEE Trans. System Science and Cybernetics, vol. SSC-3, pp. 28–38, January 1967.
5. J. H. Wolfe, “NORMIX: Computational methods for estimating the parameters of multivariate normal mixtures of distributions,” U.S. Naval Personnel Research Activity, San Diego, Calif., Res. Memo. SRM68-6, August 1967.
6. E. A. Patrick and J. P. Costello, “On some approaches to unsupervised estimation,” Purdue University Rept. TR-EE68-7, August 1968.
7. —, “Unsupervised estimation and processing of unknown signals,” Purdue University Rept. TR-EE69-18, June 1969.
8. P. Medgyessy, Decomposition of Superpositions of Distribution, Functions. New York: Plenum, 1961.
9. H. Teicher, “Identifiability of finite mixtures,” Ann. Math. Stat., vol. 34, pp. 1265–1269, 1963.
10. S. J. Yakowitz and J. D. Spragins, “On the identifiability of finite mixtures,” Ann. Math. Stat., vol. 39, pp. 209–214, 1968.
11. E. Parzen, “On estimation of a probability density function and mode,” Ann. Math. Stat., vol. 33, pp. 1065–1076, 1962.
12. Ya. Z. Tsypkin, “Application of stochastic approximation method to the estimation of the unknown distribution by observation,” Autom. Remote Control, vol. 26, pp. 432–434, 1966.
13. R. L. Kashyap and C. C. Blaydon, “Estimation of probability density and distribution functions,” IEEE Trans. Information Theory, vol. IT-14, pp. 549–556, July 1968.
14. L. M. Deuser and D. G. Lainiotis, “Minimum mean square-error-approximation of unknown probability distribution functions.” Proc. 7th Symp. on Adaptive Processes, pp. 5d1–5d4, 1968.
15. C. K. Chow and C. N. Liu, “Approximating discrete probability distributions with dependence trees,” IEEE Trans. Information Theory, vol. IT-14, pp. 462–467, May 1968.
16. D. J. Sakrison, “Efficient recursive estimation; application to estimating the parameters of a covariance function,” Internatl. J. Engrg. Sci., vol. 3, pp. 461–483, 1965.
17. S. Kullback and R. A. Leibler, “On information and sufficiency,” Ann. Math. Stat., vol. 22, pp. 79–86, 1951.
18. T. Y. Young and G. Coraluppi, “On estimation of a mixture of normal density functions,” Proc. 8th Symp. on Adaptive Processes, pp. 601–603, November 1969.
19. H. Robbins and S. Monro, “A stochastic approximation method,” Ann. Math. Stat., vol. 22, pp. 400–407, 1951.
20. J. Kiefer and J. Wolfwitz, “Stochastic estimation of the maximum of a regression function,” Ann. Math. Stat., vol. 23, pp. 462–466, 1952.
21. J. R. Blum, “Multi-dimensional stochastic approximation method,” Ann. Math. Stat., vol. 25, pp. 737–744. 1954.
22. G. Coraluppi and T. Y. Young, “Stochastic signal representation,” IEEE Trans. Circuit Theory, vol. CT-16, pp. 155–161, May 1969.
23. J. T. Tou and R. P. Hedyorn, “Some approaches to optimum feature extraction,” in Computer and Information Sciences, vol. 2, J. T. Tou, Ed. New York: Academic Press, pp. 57–89, 1967.