Home           Contact us           FAQs           
     Journal Home     |     Aim & Scope    |    Author(s) Information      |     Editorial Board     |     MSP Download Statistics
2014 (Vol. 7, Issue: 7)
Article Information:

Mining of Network Communities by Spectral Characterization Using KD-tree

R. Renuga Devi and M. Hemalatha
Corresponding Author:  M. Hemalatha 

Key words:  Community bipartition scheme, community mining, eigen-gap, eigen values, KD-tree, recursive bisection strategy,
Vol. 7 , (7): 1294-1301
Submitted Accepted Published
April 12, 2013 June 05, 2013 February 20, 2014

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.
Abstract PDF HTML
  Cite this Reference:
R. Renuga Devi and M. Hemalatha, 2014. Mining of Network Communities by Spectral Characterization Using KD-tree.  Research Journal of Applied Sciences, Engineering and Technology, 7(7): 1294-1301.
    Advertise with us
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2015. MAXWELL Scientific Publication Corp., All rights reserved