Michal,
Can you say why it is difficult?
Is it because you have to run many map-reduce iterations?
If you allow many iterations, it seems like a fairly simple map reduce
program for each iteration:
map: {emit current state keyed by current node, emit activations to
neighbors}
combine: {pass current state unchanged, accumulate activations}
reduce: {accumulate activations}
Clearly, I don't understand something about what you are doing since this
seems pretty simple.
Is it just the number of times this has to run that is the problem?
On Thu, Jul 2, 2009 at 4:21 AM, Michal Laclavik <[email protected]>wrote:
> We would like to implement spread activation algorithm over MR but it
> is quite dificult.
>
> Anyone tried something with spread activation on Hadoop?
>
