From: SourceForge.net <no...@so...> - 2008-06-27 18:55:18
|
Read and respond to this message at: https://sourceforge.net/forum/message.php?msg_id=5058543 By: amethyst805 My intention is to calculate randomwalk ranking for each vertext in a undirected graph. When I first us RW on my original graph, it ends with error "graph is a singular matrix", so I use WeakComponentGraphClusterer in algorithms.cluster package to first extract the subgraph sets. Then I calculate the rankingscores for all the vertexs in every subgraph, and it does work. But my concern is that whether this clustering activity will effect the original RW rankingScorce for those vertexs in the original network. Thanks in advance. ______________________________________________________________________ You are receiving this email because you elected to monitor this forum. To stop monitoring this forum, login to SourceForge.net and visit: https://sourceforge.net/forum/unmonitor.php?forum_id=252062 |