An infinite latent attribute model for network data

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 2, Issue , 2012, Pages 1607-1614

  Palla, Konstantina ^a   Knowles, David A ^a   Ghahramani, Zoubin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ASSIGNMENT; EXPERIMENTAL COMPARISON; FEATURE VECTORS; HIERARCHICAL BAYESIAN MODELS; LATENT VARIABLE MODELS; LINK PREDICTION; NETWORK DATA; PREDICTIVE PERFORMANCE; REAL NETWORKS; RELATIONAL STRUCTURES; SECOND LAYER; SINGLE LAYER; SUB-CLUSTERS;

BAYESIAN NETWORKS;

LEARNING SYSTEMS;

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

References (18)

1. Airoldi, E. M., Blei, D. M., Xing, E. P., and Fienberg, S. E. (2009). Mixed membership stochastic block models. In NIPS.
2. Girvan, M. and Newman, M. E. J. (2002). Community structure in social and biological networks. PNAS.
3. Globerson, A., Chechik, G., Pereira, F., and Tishby, N. (2007). Euclidean embedding of co-occurrence data. JMLR.
4. Griffiths, T. L. and Ghahramani, Z. (2005). Infinite latent feature models and the Indian buffet process. In NIPS.
5. Hoff, P. D., Raftery, A. E., Handcock, M. S., and H, M. S. (2001). Latent space approaches to social network analysis. JASA.
6. Jain, S. and Neal, R. (2000). A split-merge Markov chain Monte Carlo procedure for the Dirichlet process mixture model. JCGS.
7. Jonikas, M. C., Collins, S. R., Denic, V., Oh, E., Quan, E. M., Schmid, V., Weibezahn, J., Schwappach, B., Walter, P., Weissman, J. S., and Schuldiner, M. (2009). Comprehensive characterization of genes required for protein folding in the endoplasmic reticulum. Science.
8. Kemp, C. and Tenenbaum, J. B. (2006). Learning systems of concepts with an infinite relational model. In 21st National Conference on Artificial Intelligence.
9. Kim, M. and Leskovec, J. (2011). Modeling social networks with node attributes using the multiplicative attribute graph model. In UAI.
10. Meeds, E., Ghahramani, Z., Neal, R. M., and Roweis, S. T. (2006). Modeling dyadic data with binary latent factors. In NIPS.
11. Miller, K., Griffiths, T., and Jordan, M. (2009). Nonparametric latent feature models for link prediction. In NIPS.
12. Morup, M., Schmidt, M., and Hansen, L. (2011). Infinite multiple membership relational modeling for complex networks. In MLSP.
13. Neal, R. M. (2000). Markov chain sampling methods for Dirichlet process mixture models. JCGS.
14. Neal, R. M. (2003). Slice Sampling. The Annals of Statistics.
15. Nowicki, K. and Snijders, T. A. B. (2001). Estimation and prediction for stochastic blockstructures. JASA.
16. Pitman, J. (2002). Combinatorial stochastic processes. Technical report, Department of Statistics, University of California at Berkeley.
17. Roy, D. M., Kemp, C., Mansinghka, V., and Tenenbaum, J. B. (2007). Learning annotated hierarchies from relational data. In NIPS.
18. Xu, Z., Tresp, V., Yu, K., and Kriegel, H. P. (2006). Infinite hidden relational models. In UAI.