Thank you for wonderful work!
I notice that the bipartite graph assembling procedure only restricts that there are no self-loops, but does not restrict the multiple relationships (predicates) to match the identical subject-object pair, which means that the result does not comply with the graph constraints.
I'm not sure whether my understanding is wrong.
Thank you for wonderful work! I notice that the bipartite graph assembling procedure only restricts that there are no self-loops, but does not restrict the multiple relationships (predicates) to match the identical subject-object pair, which means that the result does not comply with the graph constraints. I'm not sure whether my understanding is wrong.