the collection of linked paths, these hidden variables can reveal the underlying semantics between these two entities.
the link classification problem can be decomposed into two modules -acquire underlying paths (Path Finder) and infer relation from la-tent representation (Path Reasoner).