Overlapping community detection by collective friendship group inference

[d-michail]

We recently added basic support for communities detection with two algorithms: k-spanning tree and label propagation. We should also add support for basic algorithms which detect overlapping communities. One of the most basic works in this area is the following:

• Rees, Bradley S., and Keith B. Gallagher. "Overlapping community detection by collective friendship group inference." 2010 International Conference on Advances in Social Networks Analysis and Mining. IEEE, 2010.

It should not be that difficult to implement. Is anyone interested to pick this up?

[Toptachamann]

I can pick this. Also, I can't guarantee how long it's going to take me to implement it and submit a PR. You can ping me to send a status update if you think it's taking too long. Also, I've seen an entry on community detection in out open tasks page. If you have some more interesting algorithms in mind, it would be really helpful to list them in the wiki page.

[d-michail]

I started writing something in a branch called cfgi in my repo. It is not complete (missing docs, etc) and might not be very efficient. I wrote it a little bit differently from the paper description which says something about a modified mergesort.

I am sure you can find some improvements, so feel free to commit on that branch if you feel it will be helpful.

Regarding community detection, I will update the wiki page as you suggest. We are missing some very important ones.

[d-michail]

Here is the link to the current unfinished implementation: CollectiveFriendshipGroupInference.java