Difference between revisions of "Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs"
From Cohen Courses
Jump to navigationJump to search| Line 14: | Line 14: | ||
== Summary == | == 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 ( [[ | + | 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]]) in which this |
"Link Propagation" is introduced as one solution to that problem. | "Link Propagation" is introduced as one solution to that problem. | ||
Revision as of 23:54, 4 November 2012
Citation
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) in which this "Link Propagation" is introduced as one solution to that problem.
