Indian Journal of Science and Technology
Year: 2017, Volume: 10, Issue: 19, Pages: 1-5
Er. Rohit Kumar* and Er. Harpreet Arora
Department of C.S.E., IKG Punjab Technical University, Ibban, Kapurthala – 144603, Punjab, India; [email protected], [email protected]
*Author for the correspondence:
Er. Rohit Kumar
Department of C.S.E., IKG Punjab Technical University, Ibban, Kapurthala – 144603, Punjab, India; [email protected]
Objectives: To eliminate Sink nodes so that rate of detection can improve within the community overlapping detection and this also increases the modularity. It also consumes less time. Methods/Statistical Analysis: Modified k-clique Algorithm is used. Clique algorithm considers Sink nodes. Sink nodes are those which do not have any connecting edge. The proposed algorithm (MKC) does eliminate these nodes and hence consider only those nodes which are connected in nature. To detect the Sink nodes adjacency matrix is used. MATLAB is used for the simulation. Community detection toolbox is used which provides several functions for graph generations, clustering algorithms etc., Findings: This approach produces better result in terms of community finding. More community are discovered with the proposed approach and also entropy is improved greatly. Result in terms of time consumption is reduced almost by 50%. Application/Improvements: The length and complexity of the cliques found is reduced considerably. The speed is almost enhanced by 5% which can further be increased by using hop count mechanism in addition to the already used Sink node elimination.
Keywords: Community Overlapping, k-clique, Sink Nodes
Subscribe now for latest articles and news.