giraph-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Pascal Jäger <pas...@pascaljaeger.de>
Subject Re: Link Prediction with Giraph
Date Tue, 05 Nov 2013 19:26:06 GMT
Hi Sebastian,

Thanks for your input.
Appreciate it!

Cheers 

Pascal 

Am 31.10.13 21:21 schrieb "Sebastian Schelter" unter
<ssc.open@googlemail.com>:

>Hi Pascal,
>
>This paper has a very nice overview of several link predictions
>algorithms:
>
>http://www.cs.cornell.edu/home/kleinber/link-pred.pdf
>
>Best,
>Sebastian
>
>On 31.10.2013 13:55, Claudio Martella wrote:
>> 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äger
>><pascal@pascaljaeger.de>wrote:
>> 
>>> 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
>>>
>>>
>> 
>> 
>


Mime
View raw message