Random Walks
Considering a graph, there will be many links within a
cluster, and fewer links between clusters.
This means if you were to start at a node, and then
randomly travel to a connected node, you’re more
likely to stay within a cluster than travel between.
This is what MCL (and several other clustering
algorithms) is based on.
– Other ways to consider graph clustering may include, for
example, looking for cliques. This tends to be sensitive to
changes in node degree, however.
- 1
- 2
- 3
前往页