Supervised Machine Learning applied to Link Prediction in Bipartite Social Networks

This work copes with the problem of link prediction in large-scale two-mode social networks. Two variations of the link prediction tasks are studied: predicting links in a bipartite graph and predicting links in a unimodal graph obtained by the projection of a bipartite graph over one of its node sets. For both tasks, we show in an empirical way, that taking into account the bipartite nature of the graph can enhance substantially the performances of prediction models we learn. This is achieved by introducing new variations of topological atttributes to measure the likelihood of two nodes to be connected. Our approach, for both tasks, consists in expressing the link prediction problem as a two class discrimination problem. Classical supervised machine learning approaches can then be applied in order to learn prediction models. Experimental validation of the proposed approach is carried out on two real data sets: a co-authoring network extracted from the DBLP bibliographical database and bipartite graph 8-years history of transactions on an on-line music e-commerce site.