Link prediction using probabilistic group models of network structure

Modeling of complex networks is a crucial task such as in biology and social sciences. A large number of researches have been conducted for such a problem; however, most of them require explicit, specific prior knowledge on target networks. On the other hand, a few recent works on multinomial mixture models presented that those models do not require such explicit prior knowledge and turned out to be effective for the task of group detection of vertices such as in social networks. This paper focuses on another task, link prediction in such complex networks, using a Bayesian multinomial mixture model, which assumes unobservable prior distributions over multinomial mixtures based on network structure and are estimated using Bayesian inference via Gibbs sampling. We demonstrate that link prediction performance was significantly improved using this method, compared to five conventional methods, through experiments using a metabolic network and a co-authorship network.

[1]  Yoshihiro Yamanishi,et al.  Supervised enzyme network inference from the integration of genomic data and chemical information , 2005, ISMB.

[2]  Mark Steyvers,et al.  Finding scientific topics , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[4]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[6]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

[7]  Thomas Hofmann,et al.  Probabilistic latent semantic indexing , 1999, SIGIR '99.

[8]  E A Leicht,et al.  Mixture models and exploratory analysis in networks , 2006, Proceedings of the National Academy of Sciences.