Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/7071
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sarswat, A. | - |
dc.contributor.author | Ram Mohana Reddy, Guddeti | - |
dc.date.accessioned | 2020-03-30T09:58:28Z | - |
dc.date.available | 2020-03-30T09:58:28Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | 2018 10th International Conference on Communication Systems and Networks, COMSNETS 2018, 2018, Vol.2018-January, , pp.649-654 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7071 | - |
dc.description.abstract | Detecting Overlapping Community in Social Networks is one of the challenging and complex problem. Several approaches based on heuristic, modularity & modularity density, graph partitioning and game theory are available for community detection. However getting an optimum and stable solution with less computation cost for large datasets is not possible using these existing approaches. Hence, in this work, we propose a novel overlapping community detection algorithm based on parallel community forest model and sequential Nash Equilibrium for large datasets. In this paper, community forest model (CFM) is implemented in parallel using Spark framework to get the initial community structure and then a Nash Equilibrium is computed to find a stable overlapping community structure. We conducted experiments on the benchmark LFR dataset with different sizes like 500, 1000, 2000 upto 10,000 nodes to evaluate the proposed method. Our experimental results clearly demonstrate that the proposed approach outperforms the existing works in terms of quality, scalability, stability and less computation time. � 2018 IEEE. | en_US |
dc.title | A novel overlapping community detection using parallel CFM and sequential nash equilibrium | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.