You are viewing a plain text version of this content. The canonical link for it is here.

Posted to dev@mahout.apache.org by "Sebastian Schelter (JIRA)" <ji...@apache.org> on 2011/09/14 11:22:08 UTC

[jira] [Commented] (MAHOUT-773) Implement Random Walk with Restarts

    [ https://issues.apache.org/jira/browse/MAHOUT-773?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13104373#comment-13104373 ] 

Sebastian Schelter commented on MAHOUT-773:
-------------------------------------------

Committed a standard implementation that computes probabilities for a single source node only. Included a lot of refactoring as we're on the way of maturing the graph package. We have an extra job to create and stochastify the adjacency matrix for a graph now for example.

> Implement Random Walk with Restarts
> -----------------------------------
>
>                 Key: MAHOUT-773
>                 URL: https://issues.apache.org/jira/browse/MAHOUT-773
>             Project: Mahout
>          Issue Type: New Feature
>          Components: Graph
>    Affects Versions: 0.5
>            Reporter: Sebastian Schelter
>            Assignee: Sebastian Schelter
>             Fix For: 0.6
>
>
> I'll create an implementation of Random Walk with Restarts as described in Kang, Tsourakakis, Faloutsos, "PEGASUS: A Peta-Scale Graph Mining System - Implementation and Observations" http://www.cs.cmu.edu/~christos/PUBLICATIONS/icdm09-pegasus.pdf
> The algorithm is a random walk similar to PageRank with the difference that you start at and teleport to a certain node. The probabilities it computes can be seen as a measure of proximity between the start node and a reached node. To my knowledge RWR can be e.g used for link predicition in social networks.
> I will try to create an implementation that is able to do several walks in parallel and I will assume that a steadystate probability vector fits in memory.
> I don't plan to use the implementation details from the paper but I'll model the algorithm as an iterative multiplication between the adjacency matrix of the graph and the matrix created from the steadystate probability vectors for the vertices we compute the random walks for.

--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira