We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction function of two vertices denotes the similarity or proximity of the vertices. Common link prediction functions for general graphs are defined using paths of length two between two nodes. Since in a bipartite graph adjacency vertices can only be connected by paths of odd lengths, these functions do not apply to bipartite graphs. Instead, a certain class of graph kernels (spectral transformation kernels) can be generalized to bipartite graphs when the positive-semidefinite kernel constraint is relaxed. This generalization is realized by the odd component of the underlying spectral transformation. This construction leads to several new link prediction pseudokernels such as the matrix hyperbolic sine, which we examine for rating graphs, authorship graphs, folksonomies, document--feature networks and other types of bipartite networks.
Bipartite Patient-Modality Graph Learning with Event-Conditional Modelling of Censoring for Cancer Survival Prediction
Hunan Provincial Key Lab on Bioinformatics, School of Computer Science and Engineering, Central South University(湖南省级生物信息学重点实验室,计算机科学与工程学院,中南大学);Xinjiang Engineering Research Center of Big Data and Intelligent Software, School of Software, Xinjiang University(新疆大数据与智能软件工程研究中心,软件学院,新疆大学)
Enhancing Missing Data Imputation through Combined Bipartite Graph and Complete Directed Graph
School of Statistics, East China Normal University(华东师范大学统计学院);The University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校);School of Global Public Health, New York University(纽约大学全球公共卫生学院)
DRExplainer: Quantifiable Interpretability in Drug Response Prediction with Directed Graph Convolutional Network
University of Science and Technology of China(中国科学技术大学);School of Information and Artificial Intelligence, Anhui Agricultural University(安徽农业大学信息与人工智能学院);Institutes of Physical Science and Information Technology, Anhui University(安徽大学物理科学与信息技术研究院)
Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\text{L}$-/$\text{L}^\natural$-Convex Function Minimization
A Bipartite Graph Approach to U.S.-China Cross-Market Return Forecasting
Department of Statistics, University of Oxford, UK(英国牛津大学统计学系);Finance Department, Neoma Business School, France(法国Neoma商学院金融系);Department of Engineering Science, University of Oxford, UK(英国牛津大学工程科学系);Department of Mathematics, University of California Los Angeles, US(美国加州大学洛杉矶分校数学系);Oxford-Man Institute of Quantitative Finance, University of Oxford, UK(牛津大学量化金融研究所)