Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/4337
Title: IDENTIFICATION OF SUBGROUPS IN A DIRECTED SOCIAL NETWORK USING EDGE BETWEENNESS AND RANDOM WALKS
Authors: Sathiyakumari, K
Vijaya, M S
Keywords: Edge betweenness
Random walks
Modularity
Community detection
Social network
Issue Date: 2018
Publisher: Springer Link
Abstract: Social networks have obtained masses hobby recently, largely because of the success of online social networking Web sites and media sharing sites. In such networks, rigorous and complex interactions occur among several unique entities, leading to huge information networks with first rate commercial enterprise ability. Network detection is an unmanaged getting to know challenge that determines the community groups based on common place hobbies, career, modules, and their hierarchical agency, the usage of the records encoded in the graph topology. Locating groups from social network is a tough mission because of its topology and overlapping of various communities. In this research, edge betweenness modularity and random walks is used for detecting groups in networks with node attributes. The twitter data of the famous cricket player is used here and network of friends and followers is analyzed using two algorithms based on edge betweenness and random walks. Also the strength of extracted communities is evaluated using on modularity score and the experiment results confirmed that the cricket player’s network is dense.
URI: https://link.springer.com/chapter/10.1007/978-981-10-5544-7_12
Appears in Collections:4.Conference Paper (09)

Files in This Item:
File Description SizeFormat 
IDENTIFICATION OF SUBGROUPS IN A DIRECTED SOCIAL NETWORK USING EDGE BETWEENNESS AND RANDOM WALKS.docx152.78 kBMicrosoft Word XMLView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.