A MCMC approach to hierarchical mixture modelling

Advances in Neural Information Processing Systems

Volumn , Issue , 2000, Pages 680-686

  Williams, Christopher K I ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; FORESTRY; TREES (MATHEMATICS);

HIERARCHICAL CLUSTERING ALGORITHMS; HIERARCHICAL MIXTURES; MARKOV CHAIN MONTE CARLO METHOD; MCMC APPROACH; POSTERIOR DISTRIBUTIONS; PROBABILISTIC MIXTURE MODELS; TREE-STRUCTURED; VARIABLE NUMBER;

MIXTURES;

EID: 0000492925     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. N. J. Adams, A. Storkey, Z. Ghahramani, and C. K. I. Williams. MFDTs: Mean Field Dynamic Trees. Submitted to ICPR 2000, 1999.
2. J. Ambros-Ingerson, R. Granger, and G. Lynch. Simulation of Paleocortex Performs Hierarchical Clustering. Science, 247:1344-1348, 1990.
3. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis. Cambridge University Press, Cambridge, UK, 1998.
4. A. W. F. Edwards. Estimation of the Branch Points of a Branching Diffusion Process. Journal of the Royal Statistical Society B, 32(2): 155-174,1970.
5. P. J. Green. Reversible Jump Markov chain Monte Carlo computation and Bayesian model determination. Biometrika, 82(4):711-732, 1995.
6. R. Hanson, J. Stutz, and P. Cheeseman. Bayesian Classification with Correlation and Inheritance. In IJCAI-91: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 1991. Sydney, Australia.
7. T. Hofmann and J. M. Buhmann. Hierarchical Pairwise Data Clustering by Mean-Field Annealing. In F. Fogelman-Soulie and P. Gallinari, editors, Proc. ICANN 95. EC2 et Cie, 1995.
8. M. R. Luettgen and A. S. Willsky. Likelihood Calculation for a Class of Multiscale Stochastic Models, with Application to Texture Discrimination. IEEE Trans. Image Processing, 4(2): 194-207,1995.
9. D. Madigan and J. York. Bayesian Graphical Models for Discrete Data. International Statistical Review, 63:215-232,1995.
10. M. C. Mozer. Discovering Discrete Distributed Representations with Iterated Competitive Learning. In R. P. Lippmann, J. E. Moody, and D. S. Touretzky, editors, Advances in Neural Information Processing Systems 3. Morgan Kaufmann, 1991.
11. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA, 1988.
12. B.Ripley. Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge, UK, 1996.
13. N. Vasconcelos and A. Lippmann. Learning Mixture Hierarchies. In M. S. Kearns, S. A. Solla, and D. A. Cohn, editors, Advances in Neural Information Processing Systems 11, pages 606-612. MIT Press, 1999.
14. C. K. I. Williams and N. J. Adams. DTs: Dynamic Trees. In M. J. Kearns, S. A. Solla, and D. A. Cohn, editors, Advances in Neural Information Processing Systems 11. MIT Press, 1999.
15. L. Xu and J. Pearl. Structuring Causal Tree Models with Continuous Variables. In L. N. Kanal, T. S. Levitt, and J. F. Lemmer, editors, Uncertainty in Artificial Intelligence 3. Elsevier, 1989.