Node Similarity with q-Grams for Real-World Labeled Networks thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Node Similarity with q-Grams for Real-World Labeled Networks

Published on Nov 23, 2018371 Views

We study node similarity in labeled networks, using the label sequences found in paths of bounded length q leading to the nodes. (This recalls the q-grams employed in document resemblance, based on

Related categories