Sparse matrix-variate t process blockmodels

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2011, Pages 543-548

  Xu, Zenglin ^a   Yan, Feng ^a   Qi, Yuan ^b  

^a Purdue University   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCKMODEL; COVARIANCE FUNCTION; DATA SETS; GROUP ASSIGNMENTS; INDIVIDUAL NETWORK; MODELING NETWORKS; NETWORK DATA; NETWORK INTERACTION; NETWORK NODE; PREDICTION ACCURACY; REAL-WORLD NETWORKS; RELATIONAL MODEL; SPARSE PRIOR; T DISTRIBUTION; T-MODEL; VARIATIONAL METHODS;

ARTIFICIAL INTELLIGENCE; ARTS COMPUTING; STOCHASTIC MODELS;

COVARIANCE MATRIX;

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

References (15)

1. Airoldi, E. M.; Blei, D. M.; Fienberg, S. E.; and Xing, E. P. 2008. Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9:1981-2014.
2. Archambeau, C., and Bach, F. 2009. Sparse probabilistic projections. In Advances in Neural Information Processing Systems 21.
3. Bishop, C., and Tipping, M. E. 2000. Variational relevance vector machines. In 16th UAI.
4. Bu, D.; Zhao, Y.; Cai, L.; Xue, H.; Zhu, X.; Lu, H.; Zhang, J.; Sun, S.; Ling, L.; Zhang, N.; Li, G.; and Chen, R. 2003. Topological structure analysis of the protein-protein interaction network in budding yeast. Nucl. Acids Res. 31(9):2443-2450. (Pubitemid 37442113)
5. Butland, G.; Peregrin-Alvarez, J. M.; Li, J.; Yang, W.; Yang, X.; Canadien, V.; Starostine, A.; Richards, D.; Beattie, B.; Krogan, N.; Davey, M.; Parkinson, J.; Greenblatt, J.; and Emili, A. 2005. Interaction network containing conserved and essential protein complexes in Escherichia coli. Nature 433(7025):531-537. (Pubitemid 40204311)
6. Gupta, A. K., and Nagar, D. K. 2000. Matrix variate distributions. CRC Press.
7. Hoff, P. D.; Raftery, A. E.; Handcock, M. S.; and H, M. S. 2001. Latent space approaches to social network analysis. Journal of the American Statistical Association 97:1090-1098.
8. Hoff, P. 2007. Modeling homophily and stochastic equivalence in symmetric relational data. In Advances in Neural Information Processing Systems 20.
9. Kemp, C.; Griffiths, T. L.; and Tenenbaum, J. B. 2004. Discovering latent classes in relational data. Technical Report AI Memo 2004-019, MIT.
10. Lee, D. D., and Seung, H. S. 1999. Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788-791.
11. Snijders, T. A., and Nowicki, K. 1997. Estimation and prediction for stochastic blockmodels for graphs with latent block structure. Journal of Classification 14(1):75-100.
12. Wang, Y. J., and Wong, G. Y. 1987. Stochastic blockmodels for directed graphs. Journal of the American Statistical Association 82:8-19.
13. Xu, Z.; Tresp, V.; Yu, K.; and Kriegel, H.-P. 2006. Infinite hidden relational models. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence (UAI 2006).
14. Yu, S.; Tresp, V.; and Yu, K. 2007. Robust multi-task learning with t-processes. In ICML'07: Proceedings of the Twenty-Fourth International Conference on Machine Learning, 1103-1110.
15. Zhu, S.; Yu, K.; and Gong, Y. 2008. Predictive matrix-variate t models. In Advances in Neural Information Processing Systems 20 (NIPS 2007), 1721-1728.