|
i have a graph where each node has a numerical value as its feature let's say varying between -10 and 10. now the question is: if two nodes are related to each other or not, if they are then the value of this expression is 1: (node1,node2) = 1 and there will be an edge between the two in graph, otherwise (node1,node2) = 0 means that there will be no edge between node1 and node2. now having the data I want to predict the edges of a new node in a way that each time I am leaving one node out or leave-one-node-out. I am leaving the node and all its connections(edges) out and from the information I have about the other nodes in dataset I want to predict the edges of the node which i left out. my question is what is the best method/algorithm for doing this? i will appreciate if you give me ideas about this. thanks |
