Correlation analysis of community detection in social network of big data methodical using set theorem

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    A trending issue in the network system that aids in learning and understanding the overall network structure is the community detection in the social network. Actually, they are the dividing wall which divides the node of the network into several subgroups. While dividing, the nodes within the subgroups will get connected densely but, their connections will be sparser between the subgroups. The ultimate objective of the community detection method is to divide the network into dense regions of the graph. But, in general, those regions will correlate with close related entities which can be then said that it is belonging to a community. It is defined based on the principle that the pair of nodes will be connected only if they belong to the same community and if they don’t share the communities, they are less likely to be connected. The vital problems across various research fields like the detection of minute and scattered communities have been necessitated with the ever growing variety of the social networks. The problem of community detection over the time has been recognized with the literature survey and the proposal methodology of set theorem to find the communities detection where the group belongs to activities. In addition to this, several basic concepts are stated in an exhaustive way where the research fields arise from social networks.

     

     


  • Keywords


    Community detection, social network, big data, set theorem, probability.

  • References


      [1] Feyza A & Bilal A, “Overlapping Community Detection in Social Networks Using Parliamentary Optimization Algorithm”, International Journal of Computer Networks and Applications, Vol.2, No.1, (2015).

      [2] Rao B & Mitra A, “A new approach for detection of common communities in a social network using graph mining techniques”, IEEE International Conference on High Performance Computing and Applications (ICHPCA), 2014, pp. 1-6.

      [3] Bhat SY & Abulaish M, “HOC Tracker: Tracking the evolution of hierarchical and overlapping communities in dynamic social networks”, IEEE Transactions on Knowledge and Data engineering, Vol.27, No.4, (2015), pp.1019-1013.

      [4] Cohen Y, Hendler D & Rubin, A, “Node-centric detection of overlapping communities in social networks”, International Conference and School on Network Science, Springer, Cham. (2017), pp.1-10.

      [5] Zhan W, Guan J, Chen H, Niu J & Jin G, “Identifying overlapping communities in networks using evolutionary method”, Physica A: Statistical Mechanics and its Applications, Vol.442, (2016), pp.182-192.

      [6] Martinez-Seis B & Li X, “Ranking features in Facebook to detect overlapping communities”, IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC), (2016), pp.1-6.

      [7] Wenjun W & Nick W, “Street Department of Management Sciences University of Iowa, Iowa City, IA 52242, USA A Novel Algorithm for Community Detection and Influence Ranking in Social Networks”, IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, (2014).

      [8] Mahajan A & Kaur M, “Various approaches of community detection in complex networks: a glance”, International Journal of Information Technology and Computer Science (IJITCS), Vol.8, No.35, (2016).


 

View

Download

Article ID: 12451
 
DOI: 10.14419/ijet.v7i2.21.12451




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.