Advertisement

A Novel Community Detection Algorithm for Privacy Preservation in Social Networks

  • Fatemeh Amiri
  • Nasser Yazdani
  • Heshaam Faili
  • Alireza Rezvanian
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 182)

Abstract

Developed online social networks are recently being grown and popularized tremendously, influencing some life aspects of human. Therefore, privacy preservation is considered as an essential and crucial issue in sharing and propagation of information. There are several methods for privacy preservation in social networks such as limiting the information through community detection. Despite several algorithms proposed so far to detect the communities, numerous researches are still on the way in this area. In this paper, a novel method for community detection with the assumption of privacy preservation is proposed. In the proposed approach is like hierarchical clustering, nodes are divided alliteratively based on learning automata (LA). A set of LA can find min-cut of a graph as two communities for each iteration. Simulation results on standard datasets of social network have revealed a relative improvement in comparison with alternative methods.

Keywords

Social Networks Privacy Preservation Community Detection Top-Down Hierarchical Clustering Learning Automata 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Facebook Statistics (2011), http://www.facebook.com/press/info.php?statistics (Accessed November 10, 2011)
  2. 2.
    Fang, L., LeFevre, K.: Privacy Wizards for Social Networking Sites. In: IW3C2, pp. 351–360 (2010)Google Scholar
  3. 3.
    Newman, M.E.J.: Networks: an introduction. Oxford University Press (2010)Google Scholar
  4. 4.
    Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Girvan, M., Newman, M.: Community structure in social and biological networks. P. Natl. Acad. Sci. Usa 99, 7821 (2002)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Clauset, A., Newman, M., Moore, C.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 70(6), 066111 (2004)CrossRefGoogle Scholar
  7. 7.
    Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp., P10008 (2008) Google Scholar
  8. 8.
    Wakita, K., Tsurumi, T.: Finding community structure in mega-scale social networks. In: WWW/Internet (2007)Google Scholar
  9. 9.
    Yan, B., Gregory, S.: Detecting communities in networks by merging cliques. In: ICIS (2009)Google Scholar
  10. 10.
    Thakur, G.S., Tiwari, R., Thai, M.T., Chen, S.S., Dress, A.W.M.: Detection of local community structures in complex dynamic networks with random walks. IET Syst. Biol. 3(4), 266–278 (2009)CrossRefGoogle Scholar
  11. 11.
    Yang, B., Sato, I., Nakagawa, H.: Secure Clustering in Private Networks. In: ICDM (2011)Google Scholar
  12. 12.
    Rezvanian, A., Meybodi, M.R.: An adaptive mutation operator for artificial immune network using learning automata in dynamic environments. In: NaBic, pp. 479–483 (2010)Google Scholar
  13. 13.
    Rezvanian, A., Meybodi, M.R.: LACAIS: Learning Automata Based Cooperative Artificial Immune System for Function Optimization. In: Ranka, S., Banerjee, A., Biswas, K.K., Dua, S., Mishra, P., Moona, R., Poon, S.-H., Wang, C.-L. (eds.) IC3 2010. CCIS, vol. 94, pp. 64–75. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Thathachar, M., Sastry, P.S.: Varieties of learning automata: an overview. IEEE T. Syst. Man Cy. B 32(6), 711–722 (2002)CrossRefGoogle Scholar
  15. 15.
    Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)CrossRefGoogle Scholar
  16. 16.
    Narendra, K.S., Thathachar, M.A.L.: Learning automata: an introduction. Prentice-Hall (1989)Google Scholar
  17. 17.
    Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: ISCIS (2005)Google Scholar
  18. 18.
    Pujol, J.M., Béjar, J., Delgado, J.: Clustering algorithm for determining community structure in large networks. Phys. Rev. E 74(1), 016107 (2006)CrossRefGoogle Scholar
  19. 19.
    Amiri, F., Yousefi, M.M.R., Lucas, C., Shakery, A., Yazdani, N.: Mutual information-based feature selection for intrusion detection systems. J. Netw. Comput. Appl. 34(4), 1184–1199 (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Fatemeh Amiri
    • 1
  • Nasser Yazdani
    • 1
  • Heshaam Faili
    • 1
  • Alireza Rezvanian
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of TehranTehranIran
  2. 2.Computer & IT Engineering DepartmentAmirkabir University of TechnologyTehranIran

Personalised recommendations