Search Results for author: Paris D. L. Flood

Found 1 papers, 0 papers with code

Investigating Estimated Kolmogorov Complexity as a Means of Regularization for Link Prediction

no code implementations7 Jun 2020 Paris D. L. Flood, Ramon Viñas, Pietro Liò

We investigate a flexible means of regularization for link prediction based on an approximation of the Kolmogorov complexity of graphs that is differentiable and compatible with recent advances in link prediction algorithms.

Link Prediction

Cannot find the paper you are looking for? You can Submit a new open access paper.