Difference between revisions of "Link Prediction in Relational Data"
From Cohen Courses
Jump to navigationJump to search| Line 8: | Line 8: | ||
== Summary == | == Summary == | ||
| − | This [[Category::paper]] focuses on [[ | + | This [[Category::paper]] focuses on [[AddressesProblem::Link Prediction]] and develops a framework which supports multiple link types and both link features and node features. The key idea is to use [[UsesMethod::relational Markov network]] and to define the probabilistic patterns over subgraph structures for each application data sets to capture some type of feature. |
== Study Plan == | == Study Plan == | ||
Revision as of 03:40, 4 October 2012
Link Prediction in Relational Data
Contents
Citation
Ben Taskar and Ming-fai Wong and Pieter Abbeel and Daphne Koller, Link prediction in relational data, NIPS 2003
Online version
Summary
This paper focuses on Link Prediction and develops a framework which supports multiple link types and both link features and node features. The key idea is to use relational Markov network and to define the probabilistic patterns over subgraph structures for each application data sets to capture some type of feature.
