The Mondrian process

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

Volumn , Issue , 2009, Pages 1377-1384

  Roy, Daniel M ^a   Teh, Yee Whye ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; TREES (MATHEMATICS);

CLASS OF DISTRIBUTIONS; DIRICHLET PROCESS; MONDRIAN; MULTIDIMENSIONAL GENERALIZATION; NONPARAMETRICS; ONE DIMENSION; POISSON PROCESS; PRIOR DISTRIBUTION; PROBABILITY: DISTRIBUTIONS; TREE DATA STRUCTURES;

PROBABILITY DISTRIBUTIONS;

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

References (19)

1. D. J. Aldous. Representations for Partially Exchangeable Arrays of Random Variables. Journal of Multivariate Analysis, 11:581-598, 1981.
2. J. M. Bernardo and A. F. M. Smith. Bayesian theory. John Wiley & Sons, 1994.
3. B. de Finetti. Funzione caratteristica di un fenomeno aleatorio. Atti della R. Academia Nazionale dei Lincei, Serie 6. Memorie, Classe di Scienze Fisiche, Mathematice e Naturale, 4:251299, 1931.
4. P. Diaconis and S. Janson. Graph limits and exchangeable random graphs. arXiv:0712.2749v1, 2007.
5. P. W. Holland, K. B. Laskey, and S. Leinhardt. Stochastic blockmodels: First steps. Social Networks, 5(2):109-137, 1983.
6. D. Hoover. Relations on probability spaces and arrays of random variables. Technical report, Preprint, Institute for Advanced Study, Princeton, NJ, 1979.
7. O. Kallenberg. Probabilistic Symmetries and Invariance Principles. Springer, 2005.
8. C. Kemp, J. Tenenbaum, T. Griffiths, T. Yamada, and N. Ueda. Learning systems of concepts with an infinite relational model. In Proceedings of the 21st National Conference on Artificial Intelligence, 2006.
9. J. F. C. Kingman. On the genealogy of large populations. Journal of Applied Probability, 19:27-43, 1982a.
10. J. F. C. Kingman. The coalescent. Stochastic Processes and their Applications, 13:235-248, 1982b.
11. L. Lovász and B. Szegedy. Limits of dense graph sequences. J. Comb. Theory B, 96:933957, 2006.
12. K. Nowicki and T. A. B. Snijders. Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96:1077-1087(11), 2001.
13. D. M. Roy, C. Kemp, V. Mansinghka, and J. B. Tenenbaum. Learning annotated hierarchies from relational data. In Advances in Neural Information Processing Systems 19, 2007.
14. C. Ryll-Nardzewski. On stationary sequences of random variables and the de Finetti's equivalence. Colloq. Math., 4:149-156, 1957.
15. J. Sethuraman. A Constructive definition of Dirichlet priors. Statistica Sinica, 4:639-650, 1994.
16. Y. W. Teh, D. Görür, and Z. Ghahramani. Stick-breaking construction for the Indian buffet process. In Proceedings of the International Conference on Artificial Intelligence and Statistics, volume 11, 2007.
17. S. Wasserman and C. Anderson. Stochastic a posteriori blockmodels: Construction and assessment. Social Networks, 9(1):1-36, 1987.
18. S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications, pages 64-65. Cambridge University Press, 1994.
19. Z. Xu, V. Tresp, K. Yu, and H.-P. Kriegel. Infinite Hidden Relational Models. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, 2006.