Networks have proved to be very helpful in modelling complex systems with interacting components. There are various problems across various domains where the systems can be modelled in the form of a network with links between interacting components. The Problem of Link Prediction deals with predicting missing links in a given network. The application of link prediction ranges across various disciplines including biological networks, transportation networks, social networks, telecommunication networks, etc. In this paper, we use node embedding methods to encode the nodes into low dimensional embeddings and predict links based on the edge embeddings computed by taking the hadamard product of the participating nodes. We further compare the accuracy of the models trained on different dimensions of embeddings. We also study how the introduction of additional features changes the accuracy when introduced to various dimensions of node embeddings. The additional features include overlapping measures such as Jaccard similarity, Adamic-Adar score and dot product between node embeddings as well as heuristic features i.e. Common Neighbors, Resource Allocation, preferential attachment and friend tns score.
CITATION STYLE
Kumar*, S., Gupta, V., & Singh, S. S. (2020). Link Prediction in Complex Networks using Embedding Techniques and Similarity Measures. International Journal of Innovative Technology and Exploring Engineering, 9(5), 1690–1696. https://doi.org/10.35940/ijitee.e2762.039520
Mendeley helps you to discover research relevant for your work.