Hierarchical, Unsupervised Learning with Growing via Phase Transitions

Neural Computation

Volumn 8, Issue 2, 1996, Pages 425-450

  Miller, David ^a   Rose, Kenneth ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012292950     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/neco.1996.8.2.425     Document Type: Article

References (43)

1. Ball, G., and Hall, D. 1967. A clustering technique for summarizing multivariate data. Behav. Sci. 12, 153-155.
2. Bezdek, J. C. 1980. A convergence theorem for the fuzzy ISODATA clustering algorithms. IEEE Trans. Patt. Anal. Mach. Intell. PAMI-2, 1-8.
3. Breiman, L., Friedman, J. H., Olshen, R. A., and Stone, C. J. 1980. Classification and Regression Trees. The Wadsworth Statistics/Probability Series, Belmont, CA.
4. Buhmann, J., and Kuhnel, H. 1993. Complexity optimized data clustering by competitive neural networks. Neural Comp. 5, 75-88.
5. Buhmann, J., and Kuhnel, H. 1994. Vector quantization with complexity costs. IEEE Trans. Inform. Theory 39, 1133-1145.
6. Buzo, A., Gray, Jr., A. H., Gray, R. M., and Markel, J. D. 1980. Speech coding based on vector quantization. IEEE Trans. Acoust., Speech, Sig. Proc. 28, 562-574.
7. Chou, P., Lookabaugh, T., and Gray, R. M. 1989. Optimal pruning with applications to tree-structured source coding and modeling. IEEE Trans. Inform. Theory 35, 299-315.
8. Cover, T. M., and Thomas, J. A. 1991. Elements of Information Theory. John Wiley, New York.
9. Dempster, A., Laird, N., and Rubin, D. 1977. Maximum-likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc., Ser. B 39, 1-38.
10. Duda, R. O., and Hart, P. E. 1974. Pattern Classification and Scene Analysis. Wiley-Interscience, New York.
11. Dunn, J. C. 1974. A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. J. Cybern. 3, 32-57.
12. Durbin, R., and Willshaw, D. 1987. An analogue approach to the travelling salesman problem using an elastic net method. Nature (London) 326, 689-691.
13. Durbin, R., Szeliski, R., and Yuille, A. 1989. An analysis of the elastic net approach to the travelling salesman problem. Neural Comp. 1, 348-358.
14. Farrell, K. R., Mammone, R. J., and Assaleh, K. T. 1994. Speaker recognition using neural networks and conventional classifiers. IEEE Trans. Speech Audio Proc. 2, 194-205.
15. Geiger, D., and Girosi, F. 1991. Parallel and deterministic algorithms from MRFs: Surface reconstruction. IEEE Trans. Patt. Anal. Mach. Intell. 13, 401-412.
16. Geman, S., and Geman, D. 1984. Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images. IEEE Trans. Patt. Anal. Mach. Intell. PAMI-6, 721-741.
17. Gersho, A., and Gray, R. M. 1992. Vector Quantization and Signal Compression. Kluwer Academic Publishers, Boston, MA.
18. Hartigan, J. A. 1975. Clustering Algorithms. John Wiley, New York.
19. Jain, A. K., and Dubes, R. C. 1988. Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, NJ.
20. Jaynes, E. T. 1989. Information theory and statistical mechanics. In Papers on Probability, Statistics and Statistical Physics, R. D. Rosenkrantz ed. Kluwer Academic Publishers, Dordrecht, The Netherlands. (Reprint of the original 1957 papers in Phys. Rev.)
21. Jaynes, E. T. 1989. Information theory and statistical mechanics. In Papers on Probability, Statistics and Statistical Physics, R. D. Rosenkrantz ed. Kluwer Academic Publishers, Dordrecht, The Netherlands. (Reprint of the original 1957 papers in Phys. Rev.)
22. Jordan, M. I., and Jacobs, R. A. 1994. Hierarchical mixtures of experts and the EM algorithm. Neural Comp. 6, 181-214.
23. Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. 1983. Optimization by simulated annealing. Science 220, 671-680.
24. Kullback, S. 1969. Information Theory and Statistics. Dover, New York.
25. Linde, Y., Buzo, A., and Gray, R. M. 1980. An algorithm for vector quantizer design. IEEE Trans. Commun. COM-28, 84-95.
26. Lippmann, R. P. 1989. Pattern classification using neural networks. IEEE Commun. Mag. 47-64.
27. Lloyd, S. P. 1982. Least squares quantization in PCM. IEEE Trans. Inform. Theory IT-28, 129-137. (Reprint of the 1957 paper.)
28. MacQueen, J. 1967. Some methods for classification and analysis of multivariate observations. Proc. Fifth Berkeley Symp. Math. Stat. Prob. I, 281-297.
29. Miller, D., and Rose, K. 1994a. Combined source-channel vector quantization using deterministic annealing. IEEE Trans. Commun. 42, 347-356.
30. Miller, D., and Rose, K. 1994b. A non-greedy approach to tree-structured clustering. Patt. Rec. Lett. 15, 683-690.
31. Miller, D., Rose, K., and Chou, P. A. 1994. Deterministic annealing for trellis quantizer and HMM design using Baum-Welch re-estimation. IEEE Int. Conf. Acoust. Speech Sig. Proc., Adelaide, Australia.
32. Miller, D., Rao, A., Rose, K., and Gersho, A. 1995. An information-theoretic learning algorithm for neural-network classification. In D. S. Touretzky, M. C. Mozer, and M. E. Hasselmo, Advances in Neural Information Processing 8. MIT Press, Cambridge, Ma.
33. Oehler, K., and Gray, R. M. 1993. Combining image classification and image compression using vector quantization. Proc. IEEE Data Comp. Conf. 2-11.
34. Riskin, E. A., and Gray, R. M. 1991. A greedy growing algorithm for the design of variable rate vector quantizers. IEEE Trans. Sig. Proc. 39, 2500-2507.
35. Rose, K. 1994. A mapping approach to rate-distortion computation and analysis. IEEE Trans. Inform. Theory. 40, 1939-1952.
36. Rose, K., Gurewitz, E., and Fox, G. C. 1990. Statistical mechanics and phase transitions in clustering. Phys. Rev. Lett. 65, 945-948.
37. Rose, K., Gurewitz, E., and Fox, G. C. 1992. Vector quantization by deterministic annealing. IEEE Trans. Inform. Theory 38, 1249-1258.
38. Rose, K., Gurewitz, E., and Fox, G. C. 1993. Constrained clustering as an optimization method. IEEE Trans. Patt. Anal. Mach. Intell. 15, 785-794.
39. Shore, J. E., and Johnson, R. W. 1980. Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE Trans. Inform. Theory IT-26, 26-37.
40. Simic, P. D. 1990. Statistical mechanics as the underlying theory of elastic and neural optimization. Network 1, 89-103.
41. Sokal, R., and Sneath, P. 1963. Principles of Numerical Taxonomy. W. H. Freeman, San Francisco.
42. Yuille, A. L. 1990. Generalized deformable models, statistical physics, and matching problems. Neural Comp. 2, 1-24.
43. Yuille, A. L., Stolorz, P., and Utans, J. 1994. Statistical physics, mixtures of distributions, and the EM algorithm. Neural Comp. 6, 334-340.