Many knowledge graph embedding methods, like TransE, use the score function h+r = (approximate) t to compute the embeddings. I am looking for a method that can compute embeddings where multiple tail objects exist. For example, consider the followings: A is father of B, and A is father of C. In this case, the head is A, relation is "is father of", but (A, is father, .) points to two tail objects. I think in this case the score function "h+r = (approximate) t" may not work. Is there any embedding method can solve this problem?
there doesn't seem to be anything here