Progresses and challenges in link prediction

Summary: Link prediction is a paradigmatic problem in network science, which aims at estimating the existence likelihoods of nonobserved links, based on known topology. After a brief introduction of the standard problem and evaluation metrics of link prediction, this review will summarize representa...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Tao Zhou
Formato: article
Lenguaje:EN
Publicado: Elsevier 2021
Materias:
Q
Acceso en línea:https://doaj.org/article/32c023c3d57e4e41abc8bcbdac6f6ada
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
id oai:doaj.org-article:32c023c3d57e4e41abc8bcbdac6f6ada
record_format dspace
spelling oai:doaj.org-article:32c023c3d57e4e41abc8bcbdac6f6ada2021-11-20T05:08:22ZProgresses and challenges in link prediction2589-004210.1016/j.isci.2021.103217https://doaj.org/article/32c023c3d57e4e41abc8bcbdac6f6ada2021-11-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2589004221011858https://doaj.org/toc/2589-0042Summary: Link prediction is a paradigmatic problem in network science, which aims at estimating the existence likelihoods of nonobserved links, based on known topology. After a brief introduction of the standard problem and evaluation metrics of link prediction, this review will summarize representative progresses about local similarity indices, link predictability, network embedding, matrix completion, ensemble learning, and some others, mainly extracted from related publications in the last decade. Finally, this review will outline some long-standing challenges for future studies.Tao ZhouElsevierarticleComputer scienceNetworkNetwork topologyScienceQENiScience, Vol 24, Iss 11, Pp 103217- (2021)
institution DOAJ
collection DOAJ
language EN
topic Computer science
Network
Network topology
Science
Q
spellingShingle Computer science
Network
Network topology
Science
Q
Tao Zhou
Progresses and challenges in link prediction
description Summary: Link prediction is a paradigmatic problem in network science, which aims at estimating the existence likelihoods of nonobserved links, based on known topology. After a brief introduction of the standard problem and evaluation metrics of link prediction, this review will summarize representative progresses about local similarity indices, link predictability, network embedding, matrix completion, ensemble learning, and some others, mainly extracted from related publications in the last decade. Finally, this review will outline some long-standing challenges for future studies.
format article
author Tao Zhou
author_facet Tao Zhou
author_sort Tao Zhou
title Progresses and challenges in link prediction
title_short Progresses and challenges in link prediction
title_full Progresses and challenges in link prediction
title_fullStr Progresses and challenges in link prediction
title_full_unstemmed Progresses and challenges in link prediction
title_sort progresses and challenges in link prediction
publisher Elsevier
publishDate 2021
url https://doaj.org/article/32c023c3d57e4e41abc8bcbdac6f6ada
work_keys_str_mv AT taozhou progressesandchallengesinlinkprediction
_version_ 1718419533768687616