Synthesizing Statistical Knowledge from Incomplete Mixed-Mode Data

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn PAMI-9, Issue 6, 1987, Pages 796-805

  Wong, Andrew K C ^a   Chiu, David K ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF GUELPH   (Canada)

Author keywords

bility scheme; Cluster analysis; event covering; incomplete proba ; knowledge; mixed mode data; probabilistic inference; statistical

Indexed keywords

PROBABILITY; STATISTICAL METHODS;

CLUSTER ANALYSIS; EVENT COVERING; MULTIVARIATE DATA; PROBABILISTIC INFERENCE;

PATTERN RECOGNITION;

EID: 0023451088     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.1987.4767986     Document Type: Article

References (22)

1. A. K. C. Wong and H. C. Shen, “Data base partitioning for data analysis,” in 1979 Proc. Int. Conf. Cybernetics and Society, Denver. CO, pp. 514–518.
2. H. C. Shen, M. S. Kamel, and A. K. C. Wong, “Intelligent data base management systems,” in Proc. 1983 Int. Conf. Systems. Man, and Cybernetics.
3. R. J. Thierauf, Decision Support Systems for Effective Planning and Control. Englewood Cliffs, NJ: Prentice-Hall, 1982.
4. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis. New York, Wiley, 1973.
5. A. K. C. Wong and D. K. Chiu, “An event-covering method for effective probabilistic inference.” Pattern Recognition, vol. 20, no. 2. pp. 245–255. 1987.
6. D. K. Chiu and A. K. C. Wong, “Synthesizing knowledge: A cluster analysis approach using event-covering,” IEEE Trans. Syst., Man, and Cybern. vol. SMC-16, pp. 251–259. Mar./Apr. 1986.
7. A. K. C. Wong and T. S. Liu, “Typicality, diversity, and feature pattern of an ensemble.” IEEE Trains. Comput., vol. C-24. pp. 158– 181. 181. Feb. 1975.
8. S. S. Wilks, Mathematical Statistics. New York: Wiley, 1962.
9. D. J. Hand, “Statistical pattern recognition of binary variables,” in Pattern Recognition Theory and Applications, J. Kittler, K. S. Fu, and L. F. Pau, Eds. Dordrect, The Netherlands: D. Reidel. 1982, 19–33.
10. H. Gallaire, J. Minker, and J. Nicolas, “Logic and databases: A deductive approach,” Comput. Surveys. vol. 16. no. 2. pp. 153–185. June 1984.
11. S. Navathe, S. Ceri, G. Wiederhold, and J. Dou, “Vertical partitioning algorithms for database design,” ACM Trans. Database Syst., vol. 9, no. 4, pp. 680–710, Dec. 1984.
12. F. M. Reza, An Introduction to Information Theory. New York: McGraw-Hill, 1961.
13. B. Forte, M. de Lascurain, A. K. C. Wong, “The best lower bound of the maximum entropy for discretized two dimensional probability distributions,” IEEE Trans. Inform. Theory, to be published.
14. R. S. Garfinkel and G. L. Nemhauser, Integer Programming. New York: Wiley, 1972.
15. J. C. Stoffel, “A classifier design technique for discrete variable pattern recognition problems,” IEEE Trans. Comput., vol. C-23, pp. 428–441, 1974.
16. C. T. Ng and A. K. C. Wong, “On nonuniqueness of discretization of two-dimensional probability distribution subject to maximization of Shannon's entropy,” IEEE Trans. Inform. Theory, to be published.
17. R. A. Tapia and J. R. Thompson. Nonparametric Probability Density Estimation. Baltimore. MD: The John Hopkins University Press, 1978.
18. S. Guiasu, Information Theory with Applications. New York: McGraw-Hill. 1977.
19. R. Christensen, “Entropy minimax, a non-Bayesian approach to probability estimation from empirical data,” in Proc. IEEE 1973 Int. Conf. Cybernetics and Society. pp. 321–325.
20. R. D. Smallwood, A Decision Structure for Testing Machine. Cambridge, MA: M.I.T. Press, 1962.
21. C. K. Chow and C. N. Liu, “Approximating discrete probability distributions with dependence trees,” IEEE Trans. Inform. Theory, vol. IT-14. pp. 462–467, 1968.
22. A. K. C. Wong, “Problem definition for the pattern analysis and display systems of hydrometric networks i n British Columbia,” Report to Environment Canada, Mar. 1982.