ComSim: A Bipartite Community Detection Algorithm Using Cycle and Node’s Similarity

  • Raphael Tackx
  • Fabien TarissanEmail author
  • Jean-Loup Guillaume
Conference paper
Part of the Studies in Computational Intelligence book series (SCI, volume 689)


This study proposes ComSim, a new algorithm to detect communities in bipartite networks. This approach generates a partition of \(\top \) nodes by relying on similarity between the nodes in terms of links towards \(\bot \) nodes. In order to show the relevance of this approach, we implemented and tested the algorithm on 2 small datasets equipped with a ground-truth partition of the nodes. It turns out that, compared to 3 baseline algorithms used in the context of bipartite graph, ComSim proposes the best communities. In addition, we tested the algorithm on a large scale network. Results show that ComSim has good performances, close in time to Louvain. Besides, a qualitative investigation of the communities detected by ComSim reveals that it proposes more balanced communities.


Community detection Bipartite graph Social network 



This work is funded in part by the European Commission H2020 FETPROACT 2016–2017 program under grant 732942 (ODYCCEUS), by the ANR (French National Agency of Research) under grants ANR-15-CE38-0001 (AlgoDiv) and ANR-13-CORD-0017-01 (CODDDE), by the French program “PIA—Usages, services et contenus innovants” under grant O18062-44430 (REQUEST), and by the Ile-de-France program FUI21 under grant 16010629 (iTRAC).


  1. 1.
    Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Netw. 25(3), 211–230 (2003)CrossRefGoogle Scholar
  2. 2.
    Ahn, Y.Y., Ahnert, S.E., Bagrow, J.P., Barabási, A.L.: Flavor network and the principles of food pairing. Sci. Rep. 1 (2011)Google Scholar
  3. 3.
    Barber, M.J.: Modularity and community detection in bipartite networks. Phys. Rev. E 76(6), 066102 (2007). MathSciNetCrossRefGoogle Scholar
  4. 4.
    Battiston, S., Catanzaro, M.: Statistical properties of corporate board and director networks. Eur. Phys. J. B Condens. Matter Complex Syst. 38(2), 345–352 (2004)CrossRefGoogle Scholar
  5. 5.
    Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)Google Scholar
  6. 6.
    i Cancho, R.F., Solé, R.V.: The small world of human language. Proc. R. Soc. Lond. Ser. B Biol. Sci. 268(1482), 2261–2265 (2001)Google Scholar
  7. 7.
    Davis, A., Gardner, B.B., Gardner, M.R.: Deep South; A Social Anthropological Study of Caste and Class. The University of Chicago Press, Chicago (1941)Google Scholar
  8. 8.
    Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Freeman, L.C.: Finding social groups: A meta-analysis of the southern women data (2003)Google Scholar
  10. 10.
    Green, E.C.: Southern Strategies: Southern Women and the Woman Suffrage Question. University of North Carolina Press (1997)Google Scholar
  11. 11.
    Jaccard, P.: Le coefficient generique et le coefficient de communaute dans la flore marocaine. Impr. Commerciale (1926)Google Scholar
  12. 12.
    Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)Google Scholar
  13. 13.
    Lang, K.: Newsweeder: learning to filter netnews. In: Proceedings of the Twelfth International Conference on Machine Learning, pp. 331–339 (1995)Google Scholar
  14. 14.
    Larremore, D.B., Clauset, A., Jacobs, A.Z.: Efficiently inferring community structure in bipartite networks. Phys. Rev. E 90(1), 012805 (2014)Google Scholar
  15. 15.
    Le Fessant, F., Handurukande, S., Kermarrec, A.M., Massoulié, L.: Clustering in peer-to-peer file sharing workloads. In: Peer-to-Peer Systems III, pp. 217–226. Springer (2005)Google Scholar
  16. 16.
    Lehmann, S., Schwartz, M., Hansen, L.K.: Biclique communities. Phys. Rev. E 78(1), 016108 (2008)Google Scholar
  17. 17.
    Liu, X., Murata, T.: Community detection in large-scale bipartite networks. In: Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT ’09, vol. 1, pp. 50–57. IEEE Computer Society, Washington, DC, USA (2009).
  18. 18.
    Maas, A.L., Daly, R.E., Pham, P.T., Huang, D., Ng, A.Y., Potts, C.: Learning word vectors for sentiment analysis. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pp. 142–150. Association for Computational Linguistics, Portland, Oregon, USA. (2011)
  19. 19.
    Newman, M.E.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577–8582 (2006)CrossRefGoogle Scholar
  20. 20.
    Newman, M.E., Strogatz, S.H., Watts, D.J.: Random graphs with arbitrary degree distributions. Phys. Rev. E 64 (2001)Google Scholar
  21. 21.
    Newman, M.E., Watts, D.J., Strogatz, S.H.: Random graph models of social networks. Proc. Natl. Acad. Sci. U. S. A. 99(Suppl 1), 2566–2572 (2002)CrossRefzbMATHGoogle Scholar
  22. 22.
    Prat-Pérez, A., Dominguez-Sal, D., Larriba-Pey, J.L.: High quality, scalable and parallel community detection for large real graphs. In: Proceedings of the 23rd international conference on World wide web, pp. 225–236. ACM (2014)Google Scholar
  23. 23.
    Prieur, C., Cardon, D., Beuscart, J.S., Pissard, N., Pons, P.: The stength of weak cooperation: a case study on flickr (2008). arXiv preprint arXiv:0802.2317
  24. 24.
    Rosvall, M., Axelsson, D., Bergstrom, C.T.: The map equation. Eur. Phys. J. Spec. Top. 178(1), 13–23 (2009)CrossRefGoogle Scholar
  25. 25.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440–442 (1998)CrossRefzbMATHGoogle Scholar
  26. 26.
    Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the sixth ACM international conference on Web search and data mining, pp. 587–596. ACM (2013)Google Scholar
  27. 27.
    Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181–213 (2015)CrossRefGoogle Scholar
  28. 28.
    Zhou, T., Lü, L., Zhang, Y.C.: Predicting missing links via local information. Eur. Phys. J. B Condens. Matter Complex Syst. 71(4), 623–630 (2009)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Raphael Tackx
    • 1
  • Fabien Tarissan
    • 2
    Email author
  • Jean-Loup Guillaume
    • 3
  1. 1.LIP6, CNRS, Sorbonne Universités, UMR 7606ParisFrance
  2. 2.CNRS, ISP, École Normale Supérieure de Paris-Saclay, Universités Paris-SaclayParisFrance
  3. 3.L3IUniversity of La RochelleLa RochelleFrance

Personalised recommendations