Abstract  

Complex network is defined as the network having large no. of nodes with complex relation (huge connectivity) among themselves. Mining communities in complex network is very important for analyzing the complex network. Many existing systems are not able to restore relation of nodes in network and do not maintain mining efficiency and community quality. A dynamical system to provide efficient mining and its membership in the community has been designed in the previous research paper, “Fast and Accurate Mining the Community Structure: Integrating Center Locating and Membership Optimization”. In it , community detection algorithm to identify the central node and related network communities has been implemented. The designed algorithm is very effective and efficient to detect network communities in identifying most accurate central nodes of simple as well as complex network. Identifying centers of the communities is very important in analyzing the properties of the complex networks. In determining the membership in structure, the previous classical optimization and heuristic methods iteratively update the membership but cannot provide the optimized result. In the previous research paper, an effective mechanism to reveal the community structure by identifying the central nodes in the network has been implemented. It also optimizes the mining efficiency and the community quality and provides more efficient way for complex network.

In the enhancement part, a secure routing algorithm jointly optimizing underlay and overlay paths using key pre-distribution schemes has been implemented where data transmission between to nodes can take place.

Keywords: Community mining, complex networks, hierarchical structure, dynamical systems.

[1] X. F. Wang and G. Chen, “Complex networks: Small-world, scale-free and beyond,” IEEE Circuits and Systems Magazine, vol.3, no.1, pp.6-20, Feb. 2003.

[2] R. D. Doverspike and J. Yates, “Optical network management and control,” Proceedings of the IEEE, vol.100, no.5, pp.1092-1104, May. 2012.

[3] R. Albert and A. L. Barab#asi, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol.74, no.1, p.47, 2002.

[4] M. E. J. Newman, “Networks: an introduction,” Oxford University Press, 2010.

[5] J. L. Payne and M. J. Eppstein, “Evolutionary dynamics on scale-free interaction networks”, IEEE Transactions on Evolutionary Computation, vol.13, no.4, pp.895-912, Aug. 2009.

[6] L. Wang and X. Li, “Spatial epidemiology of networked metapopulation: An overview”, Chinese Science Bulletin, vol.59, no.28, pp. 3511-3522, Oct. 2014.

[7] S. Fortunato, “Community detection in graphs,” Physics Reports, vol.486, no.3-5, pp.75-174, Feb. 2010.

[8] M. Gong, Q. Cai, X. Chen X and L. Ma, “Complex network clustering by multiobjective discrete particle swarm optimization based on decomposition,” IEEE Transactions on Evolutionary  Computation, vol.18, no.1, pp.82-97, Feb. 2014.

[9] C. Pizzuti, “A multiobjective genetic algorithm to find communities in complex networks,” IEEE Transactions on Evolutionary Computation, vol.16, no.3, pp.418-430, Jun. 2012.

[10] A. Rubio-Largo, M. A. Vega-Rodr#iguez, J. A. G#omez-Pulido and Juan M. S#anchez-P#erez, “Multiobjective Metaheuristics for Traffic Grooming in Optical Networks,” IEEE Transactions on Evolutionary Computation, vol.17, no.4, pp.457-473, Aug. 2013.

[11] B. Yang, J. M. Liu, D. Y. Liu, “Characterizing and Extracting Multiplex Patterns in Complex Networks,” IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol.42, no.2, pp.469-481, Apr. 2012.

[12] T. Rolland, M. Tasan, B. Charloteaux, et al., “A Proteome-Scale Map of the Human Interactome Network, Cell, vol.159, no.5,pp.1212-1226, Nov. 2014.

[13] Y. Liu, J. Moser, and S. Aviyente, “Network Community Structure Detection for Directional Neural Networks Inferred From Multichannel Multisubject EEG Data,” IEEE Transactions on Biomedical Engineering, vol.61, no.7, pp.1919-1930, Jul. 2014.

[14] H. Gharavi and B. Hu, “Multigate communication network for smart grid”, Proceedings of the IEEE, vol.99, no.6, pp.1028-1045,Jun. 2011.

[15] N. Tremblay and P. Borgnat, “Graph Wavelets for Multiscale Community Mining,” IEEE Transactions on Signal Processing, vol.62, no.20, pp.5227-5239, Oct. 2014.

[16] H. J. Li and J. Daniels, “Social significance of community structure: Statistical view,” Physical Review E, vol.91, no.1, p.012801,2015.

[17] A. Stanoev, D. Smilkov, L. Kocarev, “Identifying communities by influence dynamics in social networks,” Physical Review E,vol.84, no.4, p.046102, 2011.

[18] J. Liu and T. Liu, “Detecting community structure in complex networks using simulated annealing with k-means algorithms,” Physica A, vol.389, no.11, pp.2300-2309, 2010.

[19] S. Zhang, R. S. Wang and X. S. Zhang, “Identification of overlapping community structure in complex networks using fuzzy c-means clustering,” Physica A, vol.374, no.1, pp.483-490, 2007.

[20] B. Yang, J. M. Liu, J. F. Feng, “On the Spectral Characterization and Scalable Mining of Network Communities,” IEEE Transactions on Knowledge and Data Engineering, vol.24, no.2, pp.326-337, Feb. 2012.

[21] V. D. Blondel, J. Guillaume, R. Lambiotte and E. Lefebvre, “Fast unfolding of communities in large networks,” Journal of Statistical Mechanics: Theory and Experiment vol.2008, no.10, p.10008, Oct. 2008.

[22] Y. Y. Ahn, J. P. Bagrow, and S. Lehmann, “Link communities reveal multiscale complexity in networks,” Nature, vol.466, no.7307, pp.761-764, Aug. 2010.

[23] Y. V. Pehlivanoglu, “A new particle swarm optimization method enhanced with a periodic mutation strategy and neural networks,” IEEE Transactions on Evolutionary Computation, vol.17, no.3, pp.436-452, Jun. 2013.

[24] S. Verel, G. Ochoa and M. Tomassini, “Local optima networks of NK landscapes with neutrality”, IEEE Transactions on Evolutionary Computation, vol.15, no.6, pp.783-797, Dec. 2011.

[25] S. P. Mendes, G. Molina, M. A. Vega-Rodr#iguez and et al, “Benchmarking a wide spectrum of metaheuristic techniques  for the radio network design problem,” IEEE Transactions on Evolutionary Computation, vol.13, no.5, pp.1133-1150, Oct. 2009.

[26] S. Fortunato and M. Barth#elemy, “Resolution limit in community detection,” Proceedings of the National Academy of Sciences of the United States of America, vol.104, no.1, pp.36-41, Jan. 2007.

[27] A. Khadivi, A. A. Rad and M. Hasler, “Network Community Detection Enhancement by Proper Weighting,” Physical Review E, vol.83, no.4, p.046104, Apr. 2011.

[28] X. S. Zhang, R. S. Wang, Y. Wang, J. Wang, Y. Qiu, L. Wang and L. Chen, “Modularity optimization in community detection of complex networks,” Europhysics Letters, vol.87, no.3, p.38002,Aug. 2009.

[29] G. Palla, I. Derenyi, I. Farkas and T. Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature, vol.435, no.7043, pp.814-818, Jun. 2005.

[30] L. Tang, H. Liu, And J. Zhang, “Identifying Evolving Groups In Dynamic Multimode Networks,” Ieee Transactions On Knowledge And Data Engineering, Vol.24, No.1, Pp.72-85, Jan. 2012. [31] M. B. Hastings, “Community Detection As An Inference Problem,” Phys. Rev. E, Vol. 74, No. 3, P. 035102, Sep. 2006.  [32] S. Boccaletti, M. Ivanchenko, V. Latora, And A. Pluchino, “Detecting Complex Network Modularity By Dynamical Clustering,” Phys. Rev. E, Vol. 75, No. 4, P. 045102, Apr. 2007.  [33] A. Clauset, M. E. J. Newman, And C. Moore, “Finding Community Structure In Very Large Networks,” Phys. Rev. E, Vol. 70, No. 6, P. 066111, Dec. 2004.