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 (Created page with '== Citation == @article{raymond2010fast, title={Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs}, author={Raymond, R. and Kashi…') |
|||
| Line 1: | Line 1: | ||
== Citation == | == Citation == | ||
| − | |||
title={Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs}, | title={Fast and scalable algorithms for semi-supervised link prediction on static and dynamic graphs}, | ||
author={Raymond, R. and Kashima, H.}, | author={Raymond, R. and Kashima, H.}, | ||
| Line 8: | Line 7: | ||
year={2010}, | year={2010}, | ||
publisher={Springer} | publisher={Springer} | ||
| − | + | ||
== Online version == | == Online version == | ||
| Line 15: | 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:52, 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.
