Improved Link Prediction Technique Using Community Detection Algorithm
Snigdha Luthra1, Gursimran Kaur2, Dilbag Singh3
1Snigdha Luthra Apex Institute of Technology, Chandigarh University, Gharuan (Punjab), India.
2Gursimran Kaur Apex Institute of Technology, Chandigarh University, Gharuan (Punjab), India.
3Dilbag Singh Apex Institute of Technology, Chandigarh University, Gharuan (Punjab), India.
Manuscript received on 18 June 2019 | Revised Manuscript received on 25 June 2019 | Manuscript published on 30 June 2019 | PP: 2153-2157 | Volume-8 Issue-5, June 2019 | Retrieval Number: E7564068519/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: As social technology has connected substantial number of users together to interact and share of millions of information across the network. It is essential to foresee the frequent future links of the users which are connecting together and has the future possibility to connect. The social hub network is dynamic as it changes the structure at different timestamps. The network obtained at time t is varied at time t+1. In order to predict the ongoing changes on network, graph embedded techniques are used to obtain an unsupervised graph with different parameters of nodes and edges which can be used in machine learning methods. In this paper, we device a community detection algorithm with edge betweenness, closeness, betweenness, degree, hubs and authority parameters to predict the efficiency of the model with the dataset and visualize a graph network to determine the centrality of the network model.
Keywords: Link Prediction, Community Detection, Betweenness, Closeness, Edge Betweenness, Hubs And Authority.
Scope of the Article: Community Information Systems