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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Facebook Statistics (2011), http://www.facebook.com/press/info.php?statistics (Accessed November 10, 2011)
Fang, L., LeFevre, K.: Privacy Wizards for Social Networking Sites. In: IW3C2, pp. 351–360 (2010)
Newman, M.E.J.: Networks: an introduction. Oxford University Press (2010)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)
Girvan, M., Newman, M.: Community structure in social and biological networks. P. Natl. Acad. Sci. Usa 99, 7821 (2002)
Clauset, A., Newman, M., Moore, C.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 70(6), 066111 (2004)
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp., P10008 (2008)
Wakita, K., Tsurumi, T.: Finding community structure in mega-scale social networks. In: WWW/Internet (2007)
Yan, B., Gregory, S.: Detecting communities in networks by merging cliques. In: ICIS (2009)
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)
Yang, B., Sato, I., Nakagawa, H.: Secure Clustering in Private Networks. In: ICDM (2011)
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)
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)
Thathachar, M., Sastry, P.S.: Varieties of learning automata: an overview. IEEE T. Syst. Man Cy. B 32(6), 711–722 (2002)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)
Narendra, K.S., Thathachar, M.A.L.: Learning automata: an introduction. Prentice-Hall (1989)
Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: ISCIS (2005)
Pujol, J.M., Béjar, J., Delgado, J.: Clustering algorithm for determining community structure in large networks. Phys. Rev. E 74(1), 016107 (2006)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amiri, F., Yazdani, N., Faili, H., Rezvanian, A. (2013). A Novel Community Detection Algorithm for Privacy Preservation in Social Networks. In: Abraham, A., Thampi, S. (eds) Intelligent Informatics. Advances in Intelligent Systems and Computing, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32063-7_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-32063-7_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32062-0
Online ISBN: 978-3-642-32063-7
eBook Packages: EngineeringEngineering (R0)