Abstract

This chapter presents the problem of link prediction in complex networks. It provides general description, formal definition of the problem and applications. It gives a state-of-art of various existing link prediction approaches concentrating more on topological approaches. It presents the main challenges of link prediction task in real networks. There is description of our new link prediction approach based on supervised rank aggregation and our attempts to deal with two of the challenges to improve the prediction results. One approach is to extend the set of attributes describing an example (pair of nodes) calculated in a multiplex network that includes the target network. Multiplex networks have a layered structure, each layer having different kinds of links between same sets of nodes. The second way is to use community information for sampling of examples to deal with the problem of class imbalance. All experiments have been conducted on real networks extracted from well-known DBLP bibliographic database.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call