O'Reilly logo

Complex Network Analysis in Python by Dmitry Zinoviev

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Compute Generalized Similarity

This section uses generalized.

Traditionally, two bottom nodes are considered similar if they are adjacent to the same top node or to a set of same top nodes, even though the sameness may be too strict a requirement. Kovacs [Kov10] proposed to weaken the definition of similarity. The new measure, dubbed “generalized similarity,” treats two bottom nodes as similar if they are adjacent to similar top nodes. But who decides whether two top nodes are similar? It is the reflexive definition of generalized similarity itself: two top nodes are similar if they are adjacent to similar bottom nodes. In fact, the algorithm for calculating the generalized similarity does not care whether a node is top or bottom. It splits ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required