I'm looking for a way to find path / relationship similarity between path's.
In the simplest case, I would start with triplet: Node - relation - Node.
I can simply convert the various properties of the triplet into a vector and use all vectors generated by all triplets of graph - for calculating the similarity.
Do you have any other idea for implementing path similarity, as GDS doesn't support embedding on relationship? (using embedding of the 2 nodes of the triplet would give poor results b/c it doesn't take into account the relation's properties)