Link prediction in a bipartite network using Wikipedia revision information

We consider the problem of link prediction in the bipartite network of Wikipedia. Bipartite stands for an important class in social networks, and many unipartite networks can be reinterpreted as bipartite networks when edges are modeled as vertices, such as co-authorship networks. While bipartite is the special case of general graphs, common link prediction function cannot predict the edge occurrence in bipartite graph without any specialization. In this paper, we formulate an undirected bipartite graph using the history revision information in Wikipedia. We adapt the topological features to the bipartite of Wikipedia, and apply a supervised learning approach to our link prediction formulation of the problem. We also compare the performance of link prediction model with different features.