Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs
From Cohen Courses
Jump to navigationJump to search
Citation
@article{raymond2010fast,
title={Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs}, author={Raymond, R. and Kashima, H.}, journal={Machine Learning and Knowledge Discovery in Databases}, pages={131--147}, year={2010}, publisher={Springer}
}
Online version
Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs
Summary
This paper addresses the problem of [AddressesProblem::Link Prediction]], i.e. the completion of missing links between nodes in a Graph; essentially, this paper is a followup/extension of a previous work done by a subset the authors ( [[Link_propagation:_A_fast_semi-supervised_learning_algorithm_for_link_prediction Link_propagation:_A_fast_semi-supervised_learning_algorithm_for_link_prediction]) in which this "Link Propagation" is introduced as one solution to that problem.