Granular Social Network: Model and Applications

  • Sankar K. Pal
  • Suman KunduEmail author


Social networks are becoming an integral part of the modern society. Popular social network applications like Facebook, Twitter produces data in huge scale. These data shows all the characteristic of Big data. Accordingly, it leads to a deep change in the way social networks were being analyzed. The chapter describes a model of social network and its applications within the purview of information diffusion and community structure in network analysis. Here fuzzy granulation theory is used to model uncertainties in social networks. This provides a new knowledge representation scheme of relational data by taking care of the indiscernibility among the actors as well as the fuzziness in their relations. Various measures of network are defined on this new model. Within the context of this knowledge framework of social network, algorithms for target set selection and community detection are developed. Here the target sets are determined using the new measure granular degree, whereas it is granular embeddedness, together with granular degree, which is used for detecting various overlapping communities. The resulting community structures have a fuzzy-rough set theoretic description which allows a node to be a member of multiple communities with different memberships of association only if it falls in the (rough upper - rough lower) approximate region. A new index, called normalized fuzzy mutual information is introduced which can be used to quantify the similarity between two fuzzy partition matrices, and hence the quality of the communities detected. Comparative studies demonstrating the superiority of the model over graph theoretic model is shown through extensive experimental results.


Social Network Social Network Analysis Community Detection Granular Computing Community Detection Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



The work was completed while S.K. Pal held the J.C. Bose National Fellowship, Indian National Academy of Engineering Chair professorship, and DAE Raja Ramanna Fellowship.


  1. 1.
    L.A. Adamic, N. Glance, The political blogosphere and the 2004 US election: divided they blog, in Proceedings of the 3rd International Workshop on Link Discovery, LinkKDD ’05 (ACM, Chicago, 2005), pp. 36–43Google Scholar
  2. 2.
    Y.Y. Ahn, J.P. Bagrow, S. Lehmann, Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010)CrossRefGoogle Scholar
  3. 3.
    A. Anthony, S. Biesan, Block Modeling in Large Social Networks with Many Clusters. Technical report (2012)Google Scholar
  4. 4.
    C. Aslay, N. Barbieri, F. Bonchi, R. Baeza-Yates, Online topic-aware influence maximization. Proc. VLDB Endow. 8(6), 666–677 (2015)CrossRefGoogle Scholar
  5. 5.
    A.L. Barabási, R. Albert, Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)Google Scholar
  6. 6.
    S.A. Boorman, H.C. White, Social structure from multiple networks. ii. role structures social structure from multiple networks. Am. J. Sociol. 81(6), 1384–1446 (1976)CrossRefGoogle Scholar
  7. 7.
    D. Chakraborty, B.U. Shankar, S.K. Pal, Granulation, rough entropy and spatiotemporal moving object detection. Appl. Soft Comput. J. 13(9), 4001–4009 (2013)CrossRefGoogle Scholar
  8. 8.
    S. Chattopadhyay, C.A. Murthy, S.K. Pal, Fitting truncated geometric distributions in large scale real world networks. Theor. Comput. Sci. 551, 22–38 (2014)Google Scholar
  9. 9.
    S. Chen, Y. Li, Dynamic grade on the major hazards using community detection based on genetic algorithm, in Proceedings of 2009 International Conference on Signal Processing Systems (IEEE, Singapore, 2009), pp. 713–717Google Scholar
  10. 10.
    W. Chen, C. Wang, Y. Wang, Scalable influence maximization for prevalent viral marketing in large-scale social networks, in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, New York, 2010a), pp. 1029–1038Google Scholar
  11. 11.
    W. Chen, Y. Wang, S. Yang, Efficient influence maximization in social networks, in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM Press, Paris, 2009), pp. 199–208Google Scholar
  12. 12.
    W. Chen, Y. Yuan, L. Zhang, Scalable influence maximization in social networks under the linear threshold model, in 2010 IEEE International Conference on Data Mining (IEEE, New Jersey, 2010b), pp. 88–97Google Scholar
  13. 13.
    E. Cohen, D. Delling, T. Pajor, R.E. Werneck, Sketch-based influence maximization and computation: scaling up with guarantees, in Proceedings of the 23rd ACM International Conference on Information and Knowledge Management (CIKM ’14) (ACM Press, New York, 2014), pp. 629–638Google Scholar
  14. 14.
    G.B. Davis, K.M. Carley, Clearing the FOG: fuzzy, overlapping groups for social networks. Soc. Netw. 30(3), 201–212 (2008)Google Scholar
  15. 15.
    J. Dean, S. Ghemawat, mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107 (2008)Google Scholar
  16. 16.
    P. Domingos, M. Richardson, Mining the network value of customers, in Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, San Francisco, CA, 2001), pp. 57–66Google Scholar
  17. 17.
    D. Easley, J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Cambridge, Cambridge University Press, 2010)Google Scholar
  18. 18.
    P.a. Estevez, P. Vera, K. Saito, Selecting the most influential nodes in social networks, in Proceedings of 2007 International Joint Conference on Neural Networks (IEEE, New Jersey, 2007), pp. 2397–2402Google Scholar
  19. 19.
    T.S. Evans, R. Lambiotte, Line graphs of weighted networks for overlapping communities. Eur. Phys. J. B 77(2), 265–272 (2010)CrossRefGoogle Scholar
  20. 20.
    T. Falkowski, A. Barth, M. Spiliopoulou, DENGRAPH: a density-based community detection algorithm, in Proceedings of IEEE/WIC/ACM International Conference on Web Intelligence (WI’07) (IEEE, Washington, 2007), pp. 112–115Google Scholar
  21. 21.
    M. Faloutsos, P. Faloutsos, C. Faloutsos, On power-Law relationships of the internet topology, in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM ’99 (ACM, New York, 1999), pp. 251–262Google Scholar
  22. 22.
    T.F. Fan, C.J. Liau, T.Y. Lin, Positional analysis in fuzzy social networks, in Proceedings of 2007 IEEE International Conference on Granular Computing (GRC 2007) (IEEE, Silicon Valley, 2007), pp. 423–428Google Scholar
  23. 23.
    I.J. Farkas, D. Ábel, G. Palla, T. Vicsek, Weighted network modules. New J. Phys. 9(6), 180 (2007)CrossRefGoogle Scholar
  24. 24.
    S. Fortunato, Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  25. 25.
    O. Frank, Estimation and sampling in social network analysis, in Encyclopedia of Complexity and Systems Science, by R.A. Meyers (ed.) (Springer, New York, 2009), pp. 8213–8231Google Scholar
  26. 26.
    A. Ganivada, S. Dutta, S.K. Pal, Fuzzy rough granular neural networks, fuzzy granules, and classification. Theor. Comput. Sci. 412(42), 5834–5853 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    K.J. Gile, M.S. Handcock, Respondent-driven sampling: an assessment of current methodology. Sociol. Methodol. 40(1), 285–327 (2010)CrossRefGoogle Scholar
  28. 28.
    M. Girvan, M.E.J. Newman, Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A 99(12), 7821–7826 (2002)Google Scholar
  29. 29.
    M. Gomez-Rodriguez, B. Schölkopf, Influence maximization in continuous time diffusion networks, in Proceedings of the 29th International Conference on Machine Learning (ICML-12) (Edinburgh, 2012), pp. 313–320Google Scholar
  30. 30.
    A. Goyal, W. Lu, L. Lakshmanan, CELF++: optimizing the greedy algorithm for influence maximization in social networks, in Proceedings of the 20th International Conference Companion on World Wide Web (ACM, New York, 2011), pp. 47–48Google Scholar
  31. 31.
    T. Hastie, R. Tibshirani, J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd edn. (Springer Series in Statistics, Springer, New York, 2009)CrossRefzbMATHGoogle Scholar
  32. 32.
    P. Hońko, Association discovery from relational data via granular computing. Inf. Sci. 234(2), 136–149 (2013)Google Scholar
  33. 33.
    H. Jeong, B. Tombor, R. Albert, Z.N. Oltvai, aL Barabási, The large-scale organization of metabolic networks. Nature 407(6804), 651–654 (2000)CrossRefGoogle Scholar
  34. 34.
    G. Jiang, F. Ma, J. Shang, P.Y. Chau, Evolution of knowledge sharing behavior in social commerce: an agent-based computational approach. Inf. Sci. 278, 250–266 (2014)Google Scholar
  35. 35.
    L.j. Kao, Y.P. Huang, Mining influential users in social network, in Proceedings of IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2015 (Hong Kong, 2015), pp. 1209–1214Google Scholar
  36. 36.
    S. Kelley, M. Goldberg, M. Magdon-Ismail, K. Mertsalov, A. Wallace, Defining and discovering communities in social networks, in Handbook of Optimization in Complex Networks (2012), pp. 139–168Google Scholar
  37. 37.
    D. Kempe, J. Kleinberg, É. Tardos, Maximizing the spread of influence through a social network, in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM Press, New York, NY, 2003), p. 137Google Scholar
  38. 38.
    D. Kempe, J. Kleinberg, É. Tardos, Influential nodes in a diffusion model for social networks. Autom. Lang. Program. 3580, 1127–1138 (2005)MathSciNetzbMATHGoogle Scholar
  39. 39.
    Y.A. Kim, R. Phalak, A trust prediction framework in rating-based experience sharing social networks without a Web of Trust. Inf. Sci. 191, 128–145 (2012)CrossRefzbMATHGoogle Scholar
  40. 40.
    J. Kleinberg, Cascading behavior in networks: algorithmic and economic issues, in Algorithmic Game Theory, by eds. N. Nisan, T. Roughgarden, E. Tardos, V.V. Vazirani (Cambridge, Cambridge University Press, 2007), pp. 613–632Google Scholar
  41. 41.
    J. Kleinberg, S. Suri, É. Tardos, T. Wexler, Strategic network formation with structural holes, in Proceedings of the 9th ACM Conference on Electronic Commerce - EC’08 (ACM Press, New York, USA, 2008), pp. 284–293Google Scholar
  42. 42.
    B. Krishnamurthy, J. Wang, On network-aware clustering of web clients, in Proceedings of of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM ’00 (ACM, New York, Stockholm, 2000), pp. 97–110Google Scholar
  43. 43.
    L. Kuang, X. Tang, M. Yu, Y. Huang, K. Guo, A comprehensive ranking model for tweets big data in online social network. EURASIP J. Wireless Commun. Netw. 2016(1), 46 (2016)CrossRefGoogle Scholar
  44. 44.
    S. Kundu, S.K. Pal, FGSN: fuzzy granular social networks - model and applications. Inf. Sci. 314, 100–117 (2015a)CrossRefGoogle Scholar
  45. 45.
    S. Kundu, S.K. Pal, Fuzzy-rough community in social networks. Pattern Recognit. Lett. 67(2), 145–152 (2015b)Google Scholar
  46. 46.
    M. Lahiri, M. Cebrian, The genetic algorithm as a general diffusion model for social networks, in Proceedings of the 24th AAAI Conference on Artificial Intelligence (Atlanta, Georgia, 2010), pp. 494–499Google Scholar
  47. 47.
    A. Lancichinetti, S. Fortunato, Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E. 80(1), 016118 (2009)Google Scholar
  48. 48.
    A. Lancichinetti, S. Fortunato, F. Radicchi, Benchmark graphs for testing community detection algorithms. Phys. Rev. E. 80(1), 016118 (2008)Google Scholar
  49. 49.
    J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, N. Glance, N, Cost-effective outbreak detection in networks, in Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM Press, San Jose, 2007), pp. 420–429Google Scholar
  50. 50.
    J. Leskovec, K.J. Lang, M. Mahoney, Empirical comparison of algorithms for network community detection, in Proceedings of the 19th International Conference on World Wide Web - WWW ’10 (Raleigh, 2010), p. 631Google Scholar
  51. 51.
    G. Li, S. Chen, J. Feng, K.J. Tan, W.s. Li, Efficient location-aware influence maximization, in Proceedings of the 2014 ACM SIGMOD international conference on Management of data (SIGMOD’14) (Snowbird, 2014), pp. 87–98Google Scholar
  52. 52.
    L. Li, S. Li, X. Chen, A new genetics-based diffusion model for social networks, in Proceedings of 2011 International Conference on Computational Aspects of Social Networks (CASoN) (IEEE, Salamanca, Spain, 2011), pp. 76–81Google Scholar
  53. 53.
    O. Liu, K.L. Man, W. Chong, C.O. Chan, Social network analysis and big data, in Proceedings of the International Multi Conference of Engineers and Computer Scientists, vol. II (Hong Kong, 2016), pp. 6–7Google Scholar
  54. 54.
    W, Liu., X, Jiang, M, Pellegrini, X, Wang, Discovering communities in complex networks by edge label propagation. Sci. Rep. 6 (2016)Google Scholar
  55. 55.
    D. Lusseau, K. Schneider, O.J. Boisseau, P. Haase, E. Slooten, S.M. Dawson, The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396–405 (2003)CrossRefGoogle Scholar
  56. 56.
    P. Maji, S.K. Pal, Fuzzy-rough sets for information measures and selection of relevant genes from microarray data. IEEE Trans. Syst. Man Cybern. Part B 40(3), 741–52 (2010)Google Scholar
  57. 57.
    F.D. Malliaros, M. Vazirgiannis, Clustering and community detection in directed networks: a survey. Phys. Rep. 533(4), 95–142 (2013)MathSciNetCrossRefGoogle Scholar
  58. 58.
    J.L. Moreno, Who Shall Survive? A New Approach to the Problem of Human Interrelations, Nervous and Mental Disease Monograph Series (Nervous and Mental Disease Publishing co., New York, 1934)Google Scholar
  59. 59.
    P.S. Nair, S.T. Sarasamma, Data mining through fuzzy social network analysis, in Proceedings of the 26th International Conference of North American Fuzzy Information Processing Society (IEEE, San Diego, California, 2007), pp. 251–255Google Scholar
  60. 60.
    R. Narayanam, Y. Narahari, A Shapley value-based approach to discover influential nodes in social networks. IEEE Trans. Autom. Sci. Eng. 8(1), 130–147 (2011)CrossRefGoogle Scholar
  61. 61.
    M. Narayanan, A. Cherukuri, A study and analysis of recommendation systems for location-based social network (LBSN) with big data. IIMB Manag. Rev. 28(1), 25–30 (2016)CrossRefGoogle Scholar
  62. 62.
    M. Newman, Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)Google Scholar
  63. 63.
    M. Newman, M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 1–15 (2004)Google Scholar
  64. 64.
    M. Newman, Modularity and community structure in networks. Proc. Natl. Acad. Sci. U.S.A 103(23), 8577–8582 (2006)CrossRefGoogle Scholar
  65. 65.
    G.K. Orman, V. Labatut, The effect of network realism on community detection algorithms, in Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining (IEEE, Odense, Denmark, 2010), pp. 301–305Google Scholar
  66. 66.
    S.K. Pal, Granular mining and rough-fuzzy pattern recognition: a way to natural computation. IEEE Intell. Inf. Bull. 13(1), 3–13 (2012)Google Scholar
  67. 67.
    S.K. Pal, S. Kundu, C.A. Murthy, Centrality measures, upper bound, and influence maximization in large scale directed social networks. Fundam. Inf. 130(3), 317–342 (2014)MathSciNetGoogle Scholar
  68. 68.
    S.K. Pal, S.K. Meher, Natural computing: a problem solving paradigm with granular information processing. Appl. Soft Comput. J. 13(9), 3944–3955 (2013)CrossRefGoogle Scholar
  69. 69.
    S.k. Pal, S.K. Meher, A. Skowron, Data science, big data and granular mining. Pattern Recognit. Lett. 67(2), 109–112 (2015)Google Scholar
  70. 70.
    S.K. Pal, P. Mitra, Pattern Recognition Algorithms for Data Mining (CRC Press, Boca Raton, 2004)CrossRefzbMATHGoogle Scholar
  71. 71.
    G. Palla, I. Derényi, I. Farkas, T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)Google Scholar
  72. 72.
    W. Pedrycz, Granular Computing: Analysis and Design of Intelligent Systems (CRC Press, Boca Raton, 2013)CrossRefGoogle Scholar
  73. 73.
    W. Pedrycz, A. Skowron, V. Kreinovich (eds.), Handbook of granular computing (Wiley, Sussex, 2008)Google Scholar
  74. 74.
    M.D. Pham, P. Boncz, O. Erling, S3G2: a scalable structure-correlated social graph generator, in Selected Topics in Performance Evaluation and Benchmarking: 4th TPC Technology Conference, TPCTC 2012, Istanbul, Turkey, August 27, 2012, Revised Selected Papers, ed. by R. Nambiar, M. Poess (Springer, Berlin, 2013), pp. 156–172CrossRefGoogle Scholar
  75. 75.
    A. Prat, DATAGEN: Data Generation for the Social Network Benchmark (2014).
  76. 76.
    Y. Qin, J. Ma, S. Gao, Efficient influence maximization under TSCM: a suitable diffusion model in online social networks. Soft Comput. 1–12 (2016)Google Scholar
  77. 77.
    U. Raghavan, R. Albert, S. Kumara, Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 36106 (2007)CrossRefGoogle Scholar
  78. 78.
    P.K. Reddy, M. Kitsuregawa, P. Sreekanth, S.S. Rao, A graph based approach to extract a neighborhood customer community for collaborative filtering, in Proceedings of the Second International Workshop on Databases in Networked Information Systems, DNIS ’02 (Springer, London, 2002), pp. 188–200Google Scholar
  79. 79.
    F. Reid, A. McDaid, N. Hurley, Partitioning breaks communities, in Proceedings of 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011 (Kaohsiung City, Taiwan, 2011), pp. 102–109Google Scholar
  80. 80.
    S.A. Rice, The identification of blocs in small political bodies. Am. Polit. Sci. Rev. 21(3), 619–627 (1927)CrossRefGoogle Scholar
  81. 81.
    M. Richardson, P. Domingos, Mining knowledge-sharing sites for viral marketing, in Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM Press, Edmonton, Alberta, 2002), pp. 61–70Google Scholar
  82. 82.
    D. Sen, S. Pal, Generalized rough sets, entropy, and image ambiguity measures. IEEE Trans. Syst. Man Cybern. Part B 39(1), 117–128 (2009)CrossRefGoogle Scholar
  83. 83.
    M. Spreen, Rare Populations, Hidden Populations, and Link-Tracing Designs: What and Why? Bulletin de Méthodologie Sociologique 36, 34–58 (1992)CrossRefGoogle Scholar
  84. 84.
    M. Steenstrup, Cluster-based networks, in Ad Hoc Networking, Chap, vol. 4 (Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA, 2001), pp. 75–138Google Scholar
  85. 85.
    Z. Su, Q. Xu, Q. Qi, Big data in mobile social networks: a QoE-oriented framework. IEEE Netw. 30(1), 52–57 (2016)CrossRefGoogle Scholar
  86. 86.
    C. Wang, L. Deng, G. Zhou, M. Jiang, A global optimization algorithm for target set selection problems. Inf. Sci. 267, 101–118 (2014)Google Scholar
  87. 87.
    C. Wang, W. Chen, Y. Wang, Scalable influence maximization for independent cascade model in large-scale social networks. Data Mining Knowl. Discov. 25(3), 545–576 (2012)Google Scholar
  88. 88.
    S. Wasserman, K. Faust, Social Network Analysis: Methods and Applications (Cambridge University Press, Cambridge, 1994)CrossRefzbMATHGoogle Scholar
  89. 89.
    R.S. Weiss, E. Jacobson, A method for the analysis of the structure of complex organizations. Am. Sociol. Assoc. 20(6), 661–668 (1955)CrossRefGoogle Scholar
  90. 90.
    H.C. White, S.A. Boorman, R.L. Breiger, Social structure from multiple networks. I. Blockmodels of roles and positions. Am. J. Sociol. 81(4), 730–780 (1976)CrossRefGoogle Scholar
  91. 91.
    J. Yao, A.V. Vasilakos, W. Pedrycz, Granular computing: perspectives and challenges. IEEE Trans. Cybern. 43, 1977–1989 (2013)CrossRefGoogle Scholar
  92. 92.
    W. Zachary, An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452–473 (1977)CrossRefGoogle Scholar
  93. 93.
    L. Zadeh, Fuzzy sets. Inf. Control 8, 338–353 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  94. 94.
    L.A. Zadeh, Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets Syst. 90, 111–127 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  95. 95.
    Y. Zeng, X. Chen, G. Cong, S. Qin, J. Tang, Y. Xiang, Maximizing influence under influence loss constraint in social networks. Expert Syst. Appl. 55, 255–267 (2016)CrossRefGoogle Scholar
  96. 96.
    T. Zhu, B. Wang, B. Wu, C. Zhu, Maximizing the spread of influence ranking in social networks. Inf. Sci. 278, 535–544 (2014)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Center for Soft Computing Research, Indian Statistical InstituteKolkataIndia

Personalised recommendations