Mailing-List: contact user-help@giraph.apache.org; run by ezmlm
Precedence: bulk
Reply-To: user@giraph.apache.org
Received-SPF: pass (nike.apache.org: domain of claudio.martella@gmail.com
 designates 209.85.212.44 as permitted sender)
MIME-Version: 1.0
In-Reply-To: <CE980A11.5C9E%pascal@pascaljaeger.de>
References: 
 <CA+ULb+s7sxKbVdfDAvhLjXd8mM-4AZMGXp2J=5fwOgi2cPD6ig@mail.gmail.com>
 <CE980A11.5C9E%pascal@pascaljaeger.de>
From: Claudio Martella <claudio.martella@gmail.com>
Date: Thu, 31 Oct 2013 13:55:33 +0100
Message-ID: 
 <CAFJOoJf1QCjTU57Xk8xP0X+K=m+zBQ_X4zo0EOUeG7PH9Byjcg@mail.gmail.com>
Subject: Re: Link Prediction with Giraph
To: "user@giraph.apache.org" <user@giraph.apache.org>
Content-Type: multipart/alternative; boundary=089e0141a4404e30ad04ea08f8b6

--089e0141a4404e30ad04ea08f8b6
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

I would assume that it depends on your data. A graph is a very general
structure, and it is difficult to attack this problem in general. The most
obvious one is transitive closure (if A is connected to B and B to C then A
could be conntected to C). The triangle counting example in our codebase
(although the name is misleading) is based on these kinds of assumptions.


On Thu, Oct 31, 2013 at 1:26 PM, Pascal J=E4ger <pascal@pascaljaeger.de>wro=
te:

> Hi,
>
> Does anyone happen to know a paper about link prediction using a pregel
> like framework like Giraph?
> Or has someone an idea about how link prediction could be accomplished
> with Giraph?
>
> Any input is highly appreciated :)
>
> Thanks
>
> Pascal
>
>


--=20
   Claudio Martella
   claudio.martella@gmail.com

--089e0141a4404e30ad04ea08f8b6
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">I would assume that it depends on your data. A graph is a =
very general structure, and it is difficult to attack this problem in gener=
al. The most obvious one is transitive closure (if A is connected to B and =
B to C then A could be conntected to C). The triangle counting example in o=
ur codebase (although the name is misleading) is based on these kinds of as=
sumptions.</div>

<div class=3D"gmail_extra"><br><br><div class=3D"gmail_quote">On Thu, Oct 3=
1, 2013 at 1:26 PM, Pascal J=E4ger <span dir=3D"ltr">&lt;<a href=3D"mailto:=
pascal@pascaljaeger.de" target=3D"_blank">pascal@pascaljaeger.de</a>&gt;</s=
pan> wrote:<br>

<blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;border-left:1p=
x #ccc solid;padding-left:1ex">Hi,<br>
<br>
Does anyone happen to know a paper about link prediction using a pregel<br>
like framework like Giraph?<br>
Or has someone an idea about how link prediction could be accomplished<br>
with Giraph?<br>
<br>
Any input is highly appreciated :)<br>
<br>
Thanks<br>
<span class=3D"HOEnZb"><font color=3D"#888888"><br>
Pascal<br>
<br>
</font></span></blockquote></div><br><br clear=3D"all"><div><br></div>-- <b=
r> =A0 =A0Claudio Martella<br> =A0 =A0<a href=3D"mailto:claudio.martella@gm=
ail.com" target=3D"_blank">claudio.martella@gmail.com</a>=A0 =A0
</div>

--089e0141a4404e30ad04ea08f8b6--