Mailing-List: contact user-help@mahout.apache.org; run by ezmlm
Precedence: bulk
Reply-To: user@mahout.apache.org
Received-SPF: pass (nike.apache.org: domain of iamzhanghc@gmail.com designates
 209.85.160.42 as permitted sender)
Content-Type: text/plain; charset=utf-8
Mime-Version: 1.0 (Apple Message framework v1251.1)
Subject: Re: About Random walk with restart
From: Huanchen Zhang <iamzhanghc@gmail.com>
In-Reply-To: 
 <CADHDM+YcJOg_4M6qFsfSkb6ykLTK=TKLBp+R5KYVn2hzoQiaaw@mail.gmail.com>
Date: Sat, 19 May 2012 00:40:40 -0700
Content-Transfer-Encoding: quoted-printable
Message-Id: <2F31442A-00A7-4BE2-BD52-BFD3850FE487@gmail.com>
References: <201205171032575136225@gmail.com> <4FB4D70B.9020801@apache.org>
 <201205172157251644845@gmail.com>
 <CADHDM+YcJOg_4M6qFsfSkb6ykLTK=TKLBp+R5KYVn2hzoQiaaw@mail.gmail.com>
To: user@mahout.apache.org

Hi,

Thank you. I will look into it.=20

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.
>=20
> Implementing RWR in Giraph is really simple, I can help you with that.
> Am 17.05.2012 15:57 schrieb "huanchen" <iamzhanghc@gmail.com>:
>=20
>> Hi,
>>=20
>> Is the RWR implementation in mahout 0.6 usable ?
>>=20
>> Or what problem it has?
>>=20
>> If this implementation is usable, I will avoid reimplement it...
>>=20
>> Thank you !
>>=20
>> Best,
>> Huanchen
>>=20
>>=20
>> 2012-05-17
>>=20
>>=20
>>=20
>> huanchen
>>=20
>>=20
>>=20
>> =E5=8F=91=E4=BB=B6=E4=BA=BA=EF=BC=9A Sebastian Schelter
>> =E5=8F=91=E9=80=81=E6=97=B6=E9=97=B4=EF=BC=9A 2012-05-17 18:47:13
>> =E6=94=B6=E4=BB=B6=E4=BA=BA=EF=BC=9A user
>> =E6=8A=84=E9=80=81=EF=BC=9A
>> =E4=B8=BB=E9=A2=98=EF=BC=9A Re: About Random walk with restart
>>=20
>> 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,
>>>=20
>>> I did not find any documentation about random walk with restart =
which is
>> implemented in mahout 0.6.
>>>=20
>>> Any one has any experience with RWR ?
>>>=20
>>> Specifically, how to set the weight of edges in the graph?
>>>=20
>>> Any information would be helpful.
>>> no random
>>> Thank you !
>>>=20
>>> Best,
>>> Huanchen
>>>=20
>>> 2012-05-17
>>>=20
>>>=20
>>>=20
>>> huanchen
>>>=20
>>=20