KRISHI
ICAR RESEARCH DATA REPOSITORY FOR KNOWLEDGE MANAGEMENT
(An Institutional Publication and Data Inventory Repository)
"Not Available": Please do not remove the default option "Not Available" for the fields where metadata information is not available
"1001-01-01": Date not available or not applicable for filling metadata infromation
"1001-01-01": Date not available or not applicable for filling metadata infromation
Please use this identifier to cite or link to this item:
http://krishi.icar.gov.in/jspui/handle/123456789/61972
Title: | Link prediction model based on geodesic distance measure using various machine learning classification models |
Other Titles: | Not Available |
Authors: | Not Available |
ICAR Data Use Licennce: | http://krishi.icar.gov.in/PDF/ICAR_Data_Use_Licence.pdf |
Author's Affiliated institute: | Salam Jayachitra Devi, Buddha Singh |
Published/ Complete Date: | 2020-05-29 |
Project Code: | Not Available |
Keywords: | Link prediction, geodesic distance, classification model, complex network, data mining |
Publisher: | IOS Press |
Citation: | • Jayachitra Devi, S., & Singh, B. (2020). Link prediction model based on geodesic distance measure using various machine learning classification models. Journal of Intelligent & Fuzzy Systems, pp 1-13. |
Series/Report no.: | Not Available; |
Abstract/Description: | Link prediction tremendously gained interest in the field of machine learning and data mining due to its real world applicability on various fields such as in social network analysis, biomedicine, e-commerce, scientific community, etc. Several link prediction methods have been developed which mainly focuses on the topological features of the network structure, to figure out the link prediction problem. Here, the main aim of this paper is to perform feature extraction from the given real time complex network using subgraph extraction technique and labeling of the vertices in the subgraph according to the distance from the vertex associated with each target link. This proposed model helps to learn the topological pattern from the extracted subgraph without using the topological properties of each vertex. The Geodesic distance measure is used in labeling of the vertices in the subgraph. The feature extraction is carried out with different size of the subgraph as K = 10and K = 15. Then the features are fit to different machine learning classification model. For the evaluation purpose, area under the ROC curve (AUC) metric is used. Further, comparative analysis of the existing link prediction methods is performed to have a clear picture of their variability in the performance of each network. Later, the experimental results obtained from different machine learning classifiers based on AUC metric have been presented. From the analysis, we can conclude that AdaBoost, Adaptive Logistic Regression, Bagging and Random forest maintain great performance comparatively on all the network. Finally, comparative analysis has been carried out between some best existing methods, and four best classification models, to make visible that link prediction based on classification models works well across several varieties of complex networks and solve the link prediction problem with superior performance and with robustness. |
Description: | Not Available |
ISSN: | Not Available |
Type(s) of content: | Research Paper |
Sponsors: | Not Available |
Language: | English |
Name of Journal: | Journal of Intelligent & Fuzzy Systems |
Impact Factor: | 1.851 |
Volume No.: | vol. 38, no. 5 |
Page Number: | pp. 6663-6675 |
Name of the Division/Regional Station: | Not Available |
Source, DOI or any other URL: | 10.3233/JIFS-179745 |
URI: | http://krishi.icar.gov.in/jspui/handle/123456789/61972 |
Appears in Collections: | AS-NRCP-Publication |
Files in This Item:
There are no files associated with this item.
Items in KRISHI are protected by copyright, with all rights reserved, unless otherwise indicated.