Link Prediction In Bipartite Network Research Articles

BERT4FCA: A method for bipartite link prediction using formal concept analysis and BERT.

Link prediction in bipartite networks finds practical applications in various domains, including friend recommendation in social networks and chemical reaction prediction in metabolic networks. Recent studies have highlighted the potential for link prediction by maximal bi-cliques, which is a structural feature within bipartite networks that can be extracted using formal concept analysis (FCA). Although previous FCA-based methods for bipartite link prediction have achieved good performance, they still have the problem that they cannot fully capture the information of maximal bi-cliques. To solve this problem, we propose a novel method for link prediction in bipartite networks, utilizing a BERT-like transformer encoder network to enhance the contribution of FCA to link prediction. Our method facilitates bipartite link prediction by learning more information from the maximal bi-cliques and their order relations extracted by FCA. Experimental results on five real-world bipartite networks demonstrate that our method outperforms previous FCA-based methods, a state-of-the-art Graph Neural Network(GNN)-based method, and classic methods such as matrix-factorization and node2vec.

Link prediction in bipartite networks via effective integration of explicit and implicit relations

Link prediction in bipartite networks aims to identify or predict possible links between nodes of different types based on known network information. However, most existing studies predominantly focus on monopartite networks, neglecting the intrinsic properties unique to bipartite networks, such as the intricate high-order relationships between nodes. Both explicit relations (representing low-order information) and implicit relations (representing high-order information) play essential roles in predicting the evolution of bipartite networks, and they are indispensable and mutually reinforce each other. To fully leverage their potential in addressing the link prediction problem, we propose a novel framework from the perspective of network representation. This framework not only effectively integrates explicit relations and implicit relations, but also preserves the local and global structure of bipartite networks. Specifically, the probability of a link between two nodes of different types is determined by the linear sum of the contribution values of the mutually connected nodes in their respective common neighbors. Implicit relations are then used to preserve the local structure during the network representation. Furthermore, we implement optimization using a relaxed majorization-minimization algorithm, offering the advantage of uncovering high-quality local minima. Our proposed framework has undergone extensive testing on eight real-world datasets, and the results unequivocally demonstrate its significant superiority over state-of-the-art methods.

A novel similarity measure of link prediction in bipartite social networks based on neighborhood structure

AbstractLink prediction is one of the methods of social network analysis. Bipartite networks are a type of complex network that can be used to model many natural events. In this study, a novel similarity measure for link prediction in bipartite networks is presented. Due to the fact that classical social network link prediction methods are less efficient and effective for use in bipartite network, it is necessary to use bipartite network-specific methods to solve this problem. The purpose of this study is to provide a centralized and comprehensive method based on the neighborhood structure that performs better than the existing classical methods. The proposed method consists of a combination of criteria based on the neighborhood structure. Here, the classical criteria for link prediction by modifying the bipartite network are defined. These modified criteria constitute the main component of the proposed similarity measure. In addition to low simplicity and complexity, this method has high efficiency. The simulation results show that the proposed method with a superiority of 0.5% over MetaPath, 1.32% over FriendLink, and 1.8% over Katz in thef-measure criterion shows the best performance.

Toward link predictability of bipartite networks based on structural enhancement and structural perturbation

Link prediction in bipartite networks is attracting tremendous research interests. Most previous studies mainly assume the generation of link follows a predefined prior mechanism while neglecting complexity of the link generation mechanisms. To address this limitation, we present a parameter-free method, termed Structural Enhancement and Structural Perturbation (SESP), which jointly exploits explicit relations (low-order information) and implicit relations (high-order information) from the perspective of perturbation. The essence of SESP is that it transforms bipartite link prediction into monopartite link prediction without losing any information and predicts the missing links from a perturbed perspective. Compared with traditional link prediction methods, SESP does not assume a particular link generation mechanism, but learns this mechanism from the network itself. Extensive experiments on several disparate real-world bipartite networks demonstrate the effectiveness of the SESP model.

Topic recommendation for authors as a link prediction problem

Recently, link prediction studies on large-scale and complex networks have particularly become the focus of interest for researchers in various scientific fields. Many complex networks created from the real-world data contain bipartite structure by nature. Bipartite networks are a kind of complex networks that represent the interactions between the different node groups. Almost all of the previous studies on link prediction in bipartite networks focus on using the properties of projection networks to predict the relations between the node pairs. In this study, a novel similarity-based link prediction method based on strengthening weighted projection is proposed to predict the potential links between the authors and the topics in the large-scale bipartite academic information network created from the real-world data. Since information loss occurs when bipartite networks are converted to unimodal networks, it should be noted that when making a link prediction in this paper, both the bipartite network and the information on strengthening unimodal network obtained from the bipartite network are used. To evaluate the proposed method, a bipartite network was first created from a real dataset consisting of authors and their work. Then the method was tested on this network. Experimental results demonstrate that it is possible to obtain faster and more accurate link prediction results by the proposed method.

Similarity-based Regularized Latent Feature Model for Link Prediction in Bipartite Networks

Link prediction is an attractive research topic in the field of data mining and has significant applications in improving performance of recommendation system and exploring evolving mechanisms of the complex networks. A variety of complex systems in real world should be abstractly represented as bipartite networks, in which there are two types of nodes and no links connect nodes of the same type. In this paper, we propose a framework for link prediction in bipartite networks by combining the similarity based structure and the latent feature model from a new perspective. The framework is called Similarity Regularized Nonnegative Matrix Factorization (SRNMF), which explicitly takes the local characteristics into consideration and encodes the geometrical information of the networks by constructing a similarity based matrix. We also develop an iterative scheme to solve the objective function based on gradient descent. Extensive experiments on a variety of real world bipartite networks show that the proposed framework of link prediction has a more competitive, preferable and stable performance in comparison with the state-of-art methods.

Pioneering topological methods for network-based drug-target prediction by exploiting a brain-network self-organization theory.

The bipartite network representation of the drug–target interactions (DTIs) in a biosystem enhances understanding of the drugs’ multifaceted action modes, suggests therapeutic switching for approved drugs and unveils possible side effects. As experimental testing of DTIs is costly and time-consuming, computational predictors are of great aid. Here, for the first time, state-of-the-art DTI supervised predictors custom-made in network biology were compared—using standard and innovative validation frameworks—with unsupervised pure topological-based models designed for general-purpose link prediction in bipartite networks. Surprisingly, our results show that the bipartite topology alone, if adequately exploited by means of the recently proposed local-community-paradigm (LCP) theory—initially detected in brain-network topological self-organization and afterwards generalized to any complex network—is able to suggest highly reliable predictions, with comparable performance with the state-of-the-art-supervised methods that exploit additional (non-topological, for instance biochemical) DTI knowledge. Furthermore, a detailed analysis of the novel predictions revealed that each class of methods prioritizes distinct true interactions; hence, combining methodologies based on diverse principles represents a promising strategy to improve drug–target discovery. To conclude, this study promotes the power of bio-inspired computing, demonstrating that simple unsupervised rules inspired by principles of topological self-organization and adaptiveness arising during learning in living intelligent systems (like the brain) can efficiently equal perform complicated algorithms based on advanced, supervised and knowledge-based engineering.

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

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.

A Network Information Filtering Method Based on Node Energy Transfer

Network information filtering can be projected into link prediction in bipartite network to alleviate information overload. The paper discovers that node transfers redundant recommendation energy in network and gives bad effect on information filtering efficiency. Gathering node’s overlapping degree by factorizing negative matrix, redundant energy is reduced with overlapping degree and initial recommendation energy. The method endows information filtering system with dynamic recommendation prediction, the empirical results indicates the method can enhance information filtering performance.