Open AccessLink Prediction for Complex Networks via Random Forest
Author(s) -
Kuanyang Li,
Lilan Tu
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1302/2/022030
Subject(s) - link (geometry) , similarity (geometry) , random forest , complex network , computer science , eigenvalues and eigenvectors , core (optical fiber) , algorithm , artificial intelligence , data mining , image (mathematics) , computer network , telecommunications , physics , quantum mechanics , world wide web
In this paper, based on four existing similarity indexes (CN, LHN-II, COS+ and MFI), we obtain eigenvectors by extracting the features of two arbitrary complex network nodes. The core idea of this paper is to use decision trees to handle these four different indexes which are not strongly related. After training and learning with the random forest algorithm, a new link prediction algorithm for complex networks is proposed. We prove by conducting some numerical simulations, using the US aviation network as an example, that the proposed link prediction algorithm is more accurate and stable than other similar algorithms.