We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks

00:00

Formale Metadaten

Titel
Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks
Serientitel
Anzahl der Teile
62
Autor
Lizenz
CC-Namensnennung 3.0 Unported:
Sie dürfen das Werk bzw. den Inhalt zu jedem legalen Zweck nutzen, verändern und in unveränderter oder veränderter Form vervielfältigen, verbreiten und öffentlich zugänglich machen, sofern Sie den Namen des Autors/Rechteinhabers in der von ihm festgelegten Weise nennen.
Identifikatoren
Herausgeber
Erscheinungsjahr
Sprache

Inhaltliche Metadaten

Fachgebiet
Genre
Abstract
Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug–target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively implement neighbourhood-based link prediction entirely in the bipartite domain.
Kette <Zugmittel>NiederspannungsnetzSchmelzsicherungGleitlagerElementarteilchenphysikVideotechnikComputeranimation
BrechzahlKette <Zugmittel>TrenntechnikModellbauerNetzwerkanalyseTagesschachtUhrwerkKosmischer StaubBestrahlungsstärkeChirpBesprechung/Interview
Kette <Zugmittel>StadtklimaDiagramm
Kette <Zugmittel>Besprechung/Interview
Schwache LokalisationWarmumformenBrechzahlKette <Zugmittel>RundstahlketteModellbauerRelative DatierungBesprechung/Interview
KalenderjahrBesprechung/Interview
Schwache LokalisationErsatzteilBesprechung/Interview
KalenderjahrEnergieniveauDrehenGasBesprechung/Interview
Transkript: Englisch(automatisch erzeugt)
Ciao! I'm Carlo Vittorio Canestracci and I will speak about models of link prediction in complex networks. One of the most famous strategies to predict the likelihood that two individuals interact in a social network is to count the number of common neighbors, common friends, they share.
The more common neighbors they have, the higher is the likelihood that they will interact. This method is called the Common Neighbors Index. It works in general for many complex networks and there exist several variants with indices based on it. In 2012 I proposed a new idea.
I had the intuition that not only the number of common neighbors, but also the number of interactions between them can be fundamental for predicting the likelihood that two individuals interact. The idea is that the more interactions occur between the common neighbors, the higher is the likelihood that they form a local community.
And thus the higher is the likelihood that two individuals will meet each other creating a new link. I automatically modified many indices based on common neighbors strategy introducing the idea of local community and in general I could boost the performance in link prediction.
Finally, I understood that this was possible only because many real networks are organized according to the following general principle. The more common neighbors has an existing link in the network, more local community links will be present in the local community.
This is a theory that I called the local community paradigm. His work was published in 2013 and I have to thank two great colleagues and scientists Gregorian Islobato and Timo D'Iravazzi for their help and contribution to create the article. Around one year ago I moved to Dresden and there I met Simone D'Amelie,
a brilliant scientist interested in network-based prediction of drug-target interactions. Basically, he was doing prediction in bipartite networks and his motivation moved my interest to verify whether the local community paradigm was valid
and could help to improve in prediction also in bipartite network topologies. Well, if you are interested to know whether it does, please read this new article and let me know your opinion. A final thanks to Josephine Thomas and Claudio Durán, the other authors of this new article, for their important contribution.
Many thanks to Carlo Vittorio Kenistracci from Honolulu. Honolulu, yes, it is raining outside.