Hi,
You may want to have a look at MR algorithms such as this one (which should
be easy to adapt):
http://theory.stanford.edu/~sergei/papers/www11-triangles.pdf
Cheers,
--
Gianmarco
On 6 May 2014 15:50, Claudio Martella wrote:
> It would indeed be interesting to evaluate. The naive CC algori
It would indeed be interesting to evaluate. The naive CC algorithm does
have a huge impact on memory, and i have the feeling that it's often a
choice of feasibility more than performance, meaning that often the naive
approach might not be a solution at all due to the huge memory footprint.
Given th
Hi guys,
One of the ways we've thought about improving the clustering implementation
in the Okapi library (although we haven't implemented it yet) is the
following. In the naive implementation EVERY vertex sends its friend list
to ALL its neighbours. But, because in a triangle it's enough for just
Hi,
It has been some time and I don't remember all my comments. I think you can
replace LongArrayListWritables with class that will sort numbers inside, make a
diff compression and write variable length numbers.
This might cut memory usage by 80~90% (depending on graph properties).
You could a
Hi
For Okapi ML library it is mentioned that some tuning should be done .Can
you clarify that what modification we have to do?
Regards
Arun
On Tue, Mar 18, 2014 at 2:30 PM, Lukas Nalezenec <
lukas.naleze...@firma.seznam.cz> wrote:
> Hi,
> Check Okapi ML library from Grafos:
> http://grafos.ml
sage);
>> }
>> }
>> vertex.setValue(new DoubleWritable(Value));
>> }
>>
>> vertex.voteToHalt();
>> }
>> }
>>
>>
>> On Mon, Mar 17, 2014 at 6:10 PM, Suijian Zhou wrote:
>>
>>> Hi, Paven and Kaushi
setValue(new DoubleWritable(Value));
> }
>
> vertex.voteToHalt();
> }
> }
>
>
> On Mon, Mar 17, 2014 at 6:10 PM, Suijian Zhou wrote:
>
>> Hi, Paven and Kaushik,
>> Great! Yes, this is what I need. In the meantime, could you share your
>> implementation with
ks a lot!
>
> Best Regards,
> Suijian
>
>
>
> 2014-03-17 14:38 GMT-05:00 Pavan Kumar A :
>
> If what you need is
>> http://en.wikipedia.org/wiki/Clustering_coefficient#Local_clustering_coefficient
>> then I implemented it in Giraph, will submit a patch soon
&g
Hi, Lukas,
Thanks a lot, I will check that.
Best Regards,
Suijian
2014-03-18 4:00 GMT-05:00 Lukas Nalezenec :
> Hi,
> Check Okapi ML library from Grafos:
> http://grafos.ml/okapi.html#collaborative-als
> It needs some tuning but it will work.
>
> Regards
> Lukas
>
>
>
> On 17.3.2014 20:
Hi,
Check Okapi ML library from Grafos:
http://grafos.ml/okapi.html#collaborative-als
It needs some tuning but it will work.
Regards
Lukas
On 17.3.2014 20:17, Suijian Zhou wrote:
Hi, Experts,
Does anybody know if there are examples of implementation in giraph
for clustering coefficient (cou
icient#Local_clustering_coefficient
> then I implemented it in Giraph, will submit a patch soon
>
> --
> Date: Mon, 17 Mar 2014 15:33:07 -0400
> Subject: Re: clustering coefficient (counting triangles) in giraph.
> From: kaushikpatn...@gmail.com
> To: user@giraph
If what you need is
http://en.wikipedia.org/wiki/Clustering_coefficient#Local_clustering_coefficientthen
I implemented it in Giraph, will submit a patch soon
Date: Mon, 17 Mar 2014 15:33:07 -0400
Subject: Re: clustering coefficient (counting triangles) in giraph.
From: kaushikpatn...@gmail.com
Check out this paper on implementing triangle counting in a BSP model by
Prof David Bader from Georgia Tech.
http://www.cc.gatech.edu/~bader/papers/GraphBSPonXMT-MTAAP2013.pdf
I implemented a similar version in Apache Giraph, and it worked pretty
well. You have to "switch on" the write to disk op
ha that sounds familiar I never did get around to writing that...
if you do it should update the comment chain in this thread
http://www.vertica.com/2011/09/21/counting-triangles/
On Mon, Mar 17, 2014 at 12:17 PM, Suijian Zhou wrote:
> Hi, Experts,
> Does anybody know if there are examples o
14 matches
Mail list logo
