Predicting drug-drug interactions (DDI) is the problem of predicting side effects (unwanted outcomes) of a pair of drugs using drug information and known side effects of many pairs. This problem can be formulated as predicting labels (i.e. side effects) for each pair of nodes in a DDI graph, of which nodes are drugs and edges are interacting drugs with known labels. State-of-the-art methods for this problem are graph neural networks (GNNs), which leverage neighborhood information in the graph to learn node representations. For DDI, however, there are many labels with complicated relationships due to the nature of side effects. Usual GNNs often fix labels as one-hot vectors that do not reflect label relationships and potentially do not obtain the highest performance in the difficult cases of infrequent labels. In this paper, we formulate DDI as a hypergraph where each hyperedge is a triple: two nodes for drugs and one node for a label. We then present CentSmoothie, a hypergraph neural network that learns representations of nodes and labels altogether with a novel central-smoothing formulation. We empirically demonstrate the performance advantages of CentSmoothie in simulations as well as real datasets.
翻译:预测药物相互作用(DDI)是一种使用药物信息和已知许多药物对的副作用来预测一对药物的副作用(不良结果)的问题。该问题可以被表述为预测DDI图中每对节点(药物)的标签(即副作用),其中节点是药物,边是与已知标签的相互作用药物。这个问题的最先进方法是图神经网络(GNNs),它利用图中的邻域信息来学习节点表示。然而,对于DDI来说,由于副作用的性质,许多标签存在着复杂的关系。通常的GNNs通常将标签固定为一次性向量,这些向量不反映标签之间的关系,并且在不频繁标签的困难情况下可能不会获得最高性能。在本文中,我们将DDI表述为超图,其中每个超边都是一个三元组:两个药物节点和一个标签节点。然后,我们提出了CentSmoothie,一种超图神经网络,它使用新的中心平滑公式同时学习节点和标签的表示。我们在模拟和真实数据集中证明了CentSmoothie的性能优势。