Structural Link Prediction Task

A temporal link prediction task a link prediction task that is given a partially observed graph.

• Context:
  • It can be solved by a Temporal Link Prediction System (that can implement a temporal link prediction algorithm).
• Example(s):
  • a Protein Interaction Prediction Task.
  • a Text Graph to Ontology Link Prediction Task.
  • …
• Counter-Example(s):
  • a Temporal Link Prediction Task, such as social network link prediction.
• See: Link-based Object Classification Task.

---

---

References

2011

• (Menon & Elkan, 2011) ⇒ Aditya Krishna Menon, and Charles Elkan. (2011). “Link Prediction via Matrix Factorization.” In: Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II. ISBN:978-3-642-23782-9
  • QUOTE: Link prediction is the problem of predicting the presence or absence of edges between nodes of a graph. There are two types of link prediction: (i) structural, where the input is a partially observed graph, and we wish to predict the status of edges for unobserved pairs of nodes, and (ii) temporal, where we have a sequence of fully observed graphs at various time steps as input, and our goal is to predict the graph state at the next time step. Both problems have important practical applications, such as predicting interactions between pairs of proteins and [[recommending friends in social networks]] respectively.

---