A Survey on Dynamic Community Detection based on Distance Dynamics in Real World Network

  • Unique Paper ID: 145398
  • Volume: 4
  • Issue: 9
  • PageNo: 407-411
  • Abstract:
  • In today’s era, real world networks have become quite prominent and a lot of research is getting done for making these networks valuable, by proposing helpful communities and similar interest communities to users. Moreover, due to freely available web space and interactions, there are different communities per user, making it extremely hard for highly iterative detection algorithms perform quickly and give important suggestions. Furthermore, real world networks are dynamic in nature. Along this lines, there is a requirement for dynamic community detection algorithm which can appropriately detect communities with time differs. Because it accepts the changes in network rather than static community detection algorithm. A Real world network is vital complicated network. There is a number of algorithms developed to detect communities. In this paper, we will see advantages and disadvantages of existing algorithms.

Copyright & License

Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

BibTeX

@article{145398,
        author = {Komal Prajapati and Prof. M. B. Chaudhary},
        title = {A Survey on Dynamic Community Detection based on Distance Dynamics in Real World Network},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {9},
        pages = {407-411},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145398},
        abstract = {In today’s era, real world networks have become quite prominent and a lot of research is getting done for making these networks valuable, by proposing helpful communities and similar interest communities to users. Moreover, due to freely available web space and interactions, there are different communities per user, making it extremely hard for highly iterative detection algorithms perform quickly and give important suggestions. Furthermore, real world networks are dynamic in nature. Along this lines, there is a requirement for dynamic community detection algorithm which can appropriately detect communities with time differs. Because it accepts the changes in network rather than static community detection algorithm. A Real world network is vital complicated network. There is a number of algorithms developed to detect communities. In this paper, we will see advantages and disadvantages of existing algorithms.},
        keywords = {Communities, Dynamic community detection, Distance dynamics},
        month = {},
        }

Cite This Article

  • ISSN: 2349-6002
  • Volume: 4
  • Issue: 9
  • PageNo: 407-411

A Survey on Dynamic Community Detection based on Distance Dynamics in Real World Network

Related Articles