International Journal of Applied Information Systems |
Foundation of Computer Science (FCS), NY, USA |
Volume 5 - Number 3 |
Year of Publication: 2013 |
Authors: K. Sendil Kumar, K. S. Suganthi, C. Suchitra, S. Sharmili |
10.5120/ijais12-450877 |
K. Sendil Kumar, K. S. Suganthi, C. Suchitra, S. Sharmili . An Analysis for the Detection of Network Communities in Dynamic Environments. International Journal of Applied Information Systems. 5, 3 ( February 2013), 53-57. DOI=10.5120/ijais12-450877
Community Detection basically refers to the discovery of the naturally occurring associations between vertices in a given network. Initial algorithms involved detecting communities in static networks. This slowly evolved into detecting communities in dynamic environments as the nature of the network itself, in general, is dynamic. This paper on community detection is based on the analysis of existing algorithms present for the detection in dynamic environments and we have proposed an idea involving the combination of two techniques: local community measurement of multi resolution applied in multi – objective immune algorithm.