Skip to Main content Skip to Navigation
Theses

Link Prediction in Large-scale Complex Networks (Application to bibliographical Networks)

Abstract : In this work, we are interested to tackle the problem of link prediction in complex networks. In particular, we explore topological dyadic approaches for link prediction. Different topological proximity measures have been studied in the scientific literature for finding the probability of appearance of new links in a complex network. Supervided learning methods have also been used to combine the predictions made or information provided by different topological measures. The create predictive models using various topological measures. The problem of supervised learning for link prediction is a difficult problem especially due to the presence of heavy class imbalance. In this thesis, we search different alternative approaches to improve the performance of different dyadic approaches for link prediction. We propose here, a new approach of link prediction based on supervised rank agregation that uses concepts from computational social choice theory. Our approach is founded on supervised techniques of aggregating sorted lists (or preference aggregation). We also explore different ways of improving supervised link prediction approaches. One approach is to extend the set of attributes describing an example (pair of nodes) by attributes 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 classe imabalance. Experiments conducted on real networks extracted from well known DBLP bibliographic database.
Document type :
Theses
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-01492938
Contributor : Abes Star :  Contact
Submitted on : Monday, March 20, 2017 - 4:38:34 PM
Last modification on : Saturday, February 15, 2020 - 2:04:43 AM

File

edgalilee_th_2015_pujari.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01492938, version 1

Collections

Citation

Manisha Pujari. Link Prediction in Large-scale Complex Networks (Application to bibliographical Networks). Computational Complexity [cs.CC]. Université Sorbonne Paris Cité, 2015. English. ⟨NNT : 2015USPCD010⟩. ⟨tel-01492938⟩

Share

Metrics

Record views

570

Files downloads

648