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 <pas...@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 > > -- Claudio Martella claudio.marte...@gmail.com
