Prediction of Graph Node Task
(Redirected from Linking Task)
Jump to navigation
Jump to search
A Prediction of Graph Node Task is a multiclass classification task whose class set is a graph node set.
- Context:
- It can be solved by a Graph Node Prediction System (that implements a graph node prediction algorithm).
- It can range from being a Graph Node Intra-Linking Task (like friendship recommendation) to being a Graph Node-based Inter-Linking Task (like taxonomy node-based classification).
- It can range from being a Heuristic Graph Node-based Prediction Task to being a Data-Driven Graph Node-based Prediction Task.
- It can range from being a Heuristic Graph Node-based Classification Task to being a Data-Driven Graph Node-based Classification Task.
- It can range from being a Heuristic Graph Node Linking Task to being a Data-Driven Graph Node Linking Task (such as a Supervised Graph Node Linking Task).
- It can range from being a Single Graph Node-based Prediction Task to being a Multi Graph Node-based Prediction Task.
- It can (often) support a Graph Matching Task/Graph Databases Matching Task.
- Example(s):
- Counter-Example(s):
- See: Taxonomy Node-based Linking Task, Graph Database Matching Task, Graph Database.
References
2013
- (Wang, Zhang et al., 2013) ⇒ Guoshun Wang, Xuan Zhang, Guanbo Jia, and Xiaoping Ren. “Application of Algorithm used in Community Detection of Complex Network." International Journal of Future Generation Communication & Networking 6, no. 4 (2013).
- QUOTE: … For example, i xj = means node I in the graph belongs to a community whose … According to the definition of community structure, the total amount of edges intra-linking the nodes inside a community should be greater than that of edges inter-linking nodes across …