Abstract

Different methods and algorithms have been employed to carry out the task of community mining. Conversely, in the real world, many applications entail distributed and dynamically evolving networks, wherein resources and controls are not only decentralized, but also restructured frequently. This leads a problem of finding all communities from a given network, within that the links are dense, but between which they are sparse. This is referred as Network Community Mining Problem (NCMP). A network community contains a group of nodes connected based on certain relationships sometimes that refers to a special sort of network arrangement where the community mining is discovering all communities hidden in distributed networks based on their relevant local outlooks. To avoid the above mentioned problem, the existing work presented a novel model for characterizing network communities via introducing a stochastic process on networks and analyzing its dynamics based on the large deviation theory. By Using the fundamental properties of local mixing, then proposed an efficient implementation for that framework, called the LM (Network community mining based on Local Mixing properties) algorithm. There also some drawbacks are identified. Actual number of communities is estimated by using a recursive bisection approach, jointly with a predefined stopping criterion. The recursive bisection strategy does not optimize communication performance and the complexity of performing the partitioning. To solve these problems in proposed work a new community bipartition scheme is developed by using KD-Tree. Also, the stopping criterion is calculated automatically by efficiently determining the minimum Eigen-gap without explicitly computing eigenvalues. The experimental result shows that the proposed scheme is more effective and scalable when compared with the existing scheme.

Keywords:

Community bipartition scheme, community mining, eigen-gap, eigen values, KD-tree, recursive bisection strategy,

References

1. Aurel, C. and D. Narsingh, 2005. A greedy community-mining algorithm based on clustering coefficient. Congr. Numer., 172: 161-176.
   
2. Bo, Y., K.C. William and L. Jiming, 2007. Community mining from signed social networks. IEEE T. Knowl. Data En., 19(10).
   
3. Bo, Y., L. Jiming and L. Dayou, 2009. An autonomy-oriented computing approach to community mining in distributed and dynamic networks. Auton. Agent Multi-Agent Syst., Springer Science+Business Media, LLC, DOI: 10.1007/s10458-009-9080-2.
   CrossRef    
4. David, L., S. Didi, Z. Kuan and L. Ee-Peng, 2011. Mining direct antagonistic communities in explicit trust networks. Proceedings of the 20th ACM International Conference on Information and Knowledge Management (CIKM '11), pp: 1013-1018.
   
5. Deng, C., S. Zheng, H. Xiaofei, Y. Xifeng and H. Jiawei, 2005. Mining hidden community in heterogeneous social networks. Proceedings of the 3rd International Workshop on Link Discovery (LinkKDD '05), pp: 58-65.
   PMid:15642201    
6. Di, J., H. Dongxiao, L. Dayou and B. Carlos, 2010. Genetic algorithm with local search for community mining in complex networks. Proceeding of the 22nd International Conference on Tools with Artificial Intelligence.
   
7. Jiyang, C., F. Justin, G. Randy, R. Reihaneh, S. Farzad, T. Mansoureh, V. Eric and Z. Osmar, 2010. Meerkat: Community mining with dynamic social networks. Proceeding of the IEEE International Conference.
   
8. Lusseau, D., K. Schneider, O.J. Boisseau, P. Haase, E. Slooten and S.M. Dawson, 2003. The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol., 54: 396-405.
   CrossRef    
9. Meenu, G. and Y. Rajeev, 2011. Statistical approach of social network in community mining. Int. J. Inform. Technol. Knowl. Manage., 4(1): 43-46.
   
10. Pranay, A. and M.I. Malik, 2012. Communities and balance in signed networks: A spectral approach. Proceedings of the International Conference on Advances in Social Networks Analysis and Mining (ASONAM, 2012), pp: 235-242.
    PMid:22941931    
11. Tushar, S., C. Ankit and P.K. Singh, 2011. Community mining in signed social networks: An automated approach. Proceeding of the International Conference on Computer Engineering and Applications (IPCSIT), Vol. 2.
    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.