Re: clustering coefficient (counting triangles) in giraph.

[Lukas Nalezenec]

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 also reduce a number of memory allocations and use primitive 
collections.

Regards
Lukas


On 6.5.2014 09:08, Arun Kumar wrote:

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 <mailto:lukas.naleze...@firma.seznam.cz>> wrote:

    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 (counting triangles)? Thanks!

      Best Regards,
      Suijian