Local-Based Semantic Navigation on a Networked Representation of Information
In this example, our semantic path (red) is comprised by jumps whereas shortest paths (green) involve steps (-fold degenerated). However, a slight efficiency loss can be compensated by a truly coherent path. Observe how the shortest path decreases its similarity to the target at some intermediate points. At these points, shortest paths navigate through hubs (like September_7 or 1999) which exhibit shallow similarities with source and target, but help to reach the target in a small number of steps. The remaining similarity pairs with the rest of nodes are depicted as a scatter plot.