Link prediction is an important problem in online social and collaboration networks, for recommending friends and future collaborators. Most of the existing approaches for link prediction are focused on building unsupervised or supervised classification models based on the availability of accepts and rejects of the past recommendations. Several of these methods are feature-based and they construct a large number of network-level features to make the prediction more effective. A more flexible approach is to allow the model to learn the required features from the network for a specific task, rather than explicit feature engineering. In addition, most of the social and collaboration relationships do not happen instantly and rather build slowly over time through several low cost interactions, such as Email and chat. The existing approaches often ignore the availability of such auxiliary networks to make link prediction more robust and effective. The main focus of this work is to build a robust and effective classifier for link prediction using multiple auxiliary networks. We develop a supervised random walk model, that does not require any explicit feature construction, and can be personalized to each user based on the past accept and reject behavior. Our approach consistently outperforms several popular baselines in terms of precision and recall in multiple real-life data sets. Also, our approach is robust to noise and sparsity in auxiliary networks, while several popular baselines, specifically feature-based ones, are inconsistent in their performance under such conditions.
|Original language||English (US)|
|Title of host publication||SIAM International Conference on Data Mining 2015, SDM 2015|
|Editors||Suresh Venkatasubramanian, Jieping Ye|
|Publisher||Society for Industrial and Applied Mathematics Publications|
|Number of pages||9|
|State||Published - 2015|
|Event||SIAM International Conference on Data Mining 2015, SDM 2015 - Vancouver, Canada|
Duration: Apr 30 2015 → May 2 2015
|Name||SIAM International Conference on Data Mining 2015, SDM 2015|
|Other||SIAM International Conference on Data Mining 2015, SDM 2015|
|Period||4/30/15 → 5/2/15|
Bibliographical noteFunding Information:
Acknowledgements: The research was supported in part by NSF grants IIS-1447566, IIS-1422557, CCF-1451986, CNS-1314560, IIS-0953274, IIS-1029711, and by NASA grant NNX12AQ39A, DARPA grant W911NF-12-C-0028 and IBM Ph.D. fellowship award. Arindam Banerjee also acknowledges the generous support from IBM and Yahoo. The authors thank the anonymous reviewers for their valuable comments.
Copyright © SIAM.