Hi, Thank you. I will look into it.
Here I am a little confused: isn't Giraph also based on Hadoop? If so, how Giraph solved the 'Hadoop lacks efficient execution of iterative algorithms' problem ? I'm new to Hadoop .. Thank you ! Best, Huanchen On May 17, 2012, at 7:11 AM, Sebastian Schelter wrote: > It is usable but it is unfortunately very slow because Hadoop lacks > efficient execution of iterative algorithms. > > Implementing RWR in Giraph is really simple, I can help you with that. > Am 17.05.2012 15:57 schrieb "huanchen" <[email protected]>: > >> Hi, >> >> Is the RWR implementation in mahout 0.6 usable ? >> >> Or what problem it has? >> >> If this implementation is usable, I will avoid reimplement it... >> >> Thank you ! >> >> Best, >> Huanchen >> >> >> 2012-05-17 >> >> >> >> huanchen >> >> >> >> 发件人： Sebastian Schelter >> 发送时间： 2012-05-17 18:47:13 >> 收件人： user >> 抄送： >> 主题： Re: About Random walk with restart >> >> Hi, >> Unfortunately we chose to remove the graph algorithms from Mahout for >> the next version. You might want to have a look at Apache Giraph which >> offers an easy way to implement graph algorithms. >> RandomWalkWithRestart is essentialy the same as PageRank with the >> difference that the teleportation will only hit the source vertex of the >> walk not a random vertex in the graph. >> http://www.cs.cmu.edu/~ukang/papers/PegasusKAIS.pdf contains a short >> description. >> Best, >> Sebastian >> On 17.05.2012 04:33, huanchen wrote: >>> Hi, >>> >>> I did not find any documentation about random walk with restart which is >> implemented in mahout 0.6. >>> >>> Any one has any experience with RWR ? >>> >>> Specifically, how to set the weight of edges in the graph? >>> >>> Any information would be helpful. >>> no random >>> Thank you ! >>> >>> Best, >>> Huanchen >>> >>> 2012-05-17 >>> >>> >>> >>> huanchen >>> >>
