Abstract
Social networking is the grouping of individuals into specific groups, like small rural communities or a neighborhood subdivision. A fundamental problem in the analysis of social networks is the tracking of communities. A community is often defined as a group of network members with stronger ties to members within the group than to members outside the group. The traditional method for identifying communities in networks is hierarchical clustering. Recently, several works have been done in this community identification using different type of clustering algorithm and connectivity-based scoring function. In this paper Random Head Node Technique and Highest Degree Head Node Techniques are proposed to group the nodes into communities. In these techniques best set of centroids are chosen based on the fitness value to cluster the nodes into communities.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering and Advanced Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
