The notion of node similarity is key in many graph processing techniques and it is especially important in diffusion graph kernels. However, when the graph structure is affected by noise in the form of missing links, similarities are distorted proportionally to the sparsity of the graph and to the fraction of missing links. Here, we introduce the notion of link enrichment, that is, performing link prediction in order to improve the performance of diffusion-based kernels. We empirically show a robust and large effect for the combination of a number of link prediction and a number of diffusion kernel techniques on several gene-disease association problems.
CITATION STYLE
Tran-Van, D., Sperduti, A., & Costa, F. (2017). Link enrichment for diffusion-based graph node kernels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10614 LNCS, pp. 155–162). Springer Verlag. https://doi.org/10.1007/978-3-319-68612-7_18
Mendeley helps you to discover research relevant for your work.