Central-Smoothing Hypergraph Neural Networks for Predicting Drug-Drug Interactions

• URL: http://arxiv.org/abs/2112.07837v4
• Date: Tue, 4 Apr 2023 07:49:03 GMT
• Title: Central-Smoothing Hypergraph Neural Networks for Predicting Drug-Drug Interactions
• Authors: Duc Anh Nguyen, Canh Hao Nguyen, and Hiroshi Mamitsuka
• Abstract summary: 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.
• Score: 15.038537438390556
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• NP$^2$L: Negative Pseudo Partial Labels Extraction for Graph Neural Networks [48.39834063008816]
  Pseudo labels are used in graph neural networks (GNNs) to assist learning at the message-passing level. In this paper, we introduce a new method to use pseudo labels in GNNs. We show that our method is more accurate if they are selected by not overlapping partial labels and defined as negative node pairs relations.
  arXiv  Detail & Related papers  (2023-10-02T11:13:59Z)
• NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification [70.51126383984555]
  We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes. The efficient computation is enabled by a kernerlized Gumbel-Softmax operator. Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
  arXiv  Detail & Related papers  (2023-06-14T09:21:15Z)
• Classification of Edge-dependent Labels of Nodes in Hypergraphs [17.454063924648896]
  We introduce a classification of edge-dependent node labels as a new problem. This problem can be used as a benchmark task for hypergraph neural networks. We propose WHATsNet, a novel hypergraph neural network that represents the same node differently depending on the hyperedges it participates in.
  arXiv  Detail & Related papers  (2023-06-05T16:50:34Z)
• STERLING: Synergistic Representation Learning on Bipartite Graphs [78.86064828220613]
  A fundamental challenge of bipartite graph representation learning is how to extract node embeddings. Most recent bipartite graph SSL methods are based on contrastive learning which learns embeddings by discriminating positive and negative node pairs. We introduce a novel synergistic representation learning model (STERLING) to learn node embeddings without negative node pairs.
  arXiv  Detail & Related papers  (2023-01-25T03:21:42Z)
• Resisting Graph Adversarial Attack via Cooperative Homophilous Augmentation [60.50994154879244]
  Recent studies show that Graph Neural Networks are vulnerable and easily fooled by small perturbations. In this work, we focus on the emerging but critical attack, namely, Graph Injection Attack. We propose a general defense framework CHAGNN against GIA through cooperative homophilous augmentation of graph data and model.
  arXiv  Detail & Related papers  (2022-11-15T11:44:31Z)
• Graph Distance Neural Networks for Predicting Multiple Drug Interactions [4.103701929881021]
  We use graph to represent drug-drug interaction: nodes represent drug; edges represent drug-drug interactions. This work proposes a Graph Distance Neural Network (GDNN) to predict drug-drug interactions. GDNN achieved Test Hits@20=0.9037 on ogb-ddiddi dataset.
  arXiv  Detail & Related papers  (2022-08-30T04:04:03Z)
• HyGNN: Drug-Drug Interaction Prediction via Hypergraph Neural Network [0.0]
  Drug-Drug Interactions (DDIs) may hamper the functionalities of drugs, and in the worst scenario, they may lead to adverse drug reactions (ADRs) This paper proposes a novel Hypergraph Neural Network (HyGNN) model based on only the SMILES string of drugs, available for any drug, for the DDI prediction problem. Our proposed HyGNN model effectively predicts DDIs and impressively outperforms the baselines with a maximum ROC-AUC and PR-AUC of 97.9% and 98.1%, respectively.
  arXiv  Detail & Related papers  (2022-06-25T22:48:27Z)
• Discovering the Representation Bottleneck of Graph Neural Networks from Multi-order Interactions [51.597480162777074]
  Graph neural networks (GNNs) rely on the message passing paradigm to propagate node features and build interactions. Recent works point out that different graph learning tasks require different ranges of interactions between nodes. We study two common graph construction methods in scientific domains, i.e., emphK-nearest neighbor (KNN) graphs and emphfully-connected (FC) graphs.
  arXiv  Detail & Related papers  (2022-05-15T11:38:14Z)
• Unveiling Anomalous Edges and Nominal Connectivity of Attributed Networks [53.56901624204265]
  The present work deals with uncovering anomalous edges in attributed graphs using two distinct formulations with complementary strengths. The first relies on decomposing the graph data matrix into low rank plus sparse components to improve markedly performance. The second broadens the scope of the first by performing robust recovery of the unperturbed graph, which enhances the anomaly identification performance.
  arXiv  Detail & Related papers  (2021-04-17T20:00:40Z)
• Dynamic Labeling for Unlabeled Graph Neural Networks [34.65037955481084]
  Graph neural networks (GNNs) rely on node embeddings to represent a node as a vector by its identity, type, or content. Existing GNNs either assign random labels to nodes or assign one embedding to all nodes, which fails to distinguish one node from another. In this paper, we analyze the limitation of existing approaches in two types of classification tasks, graph classification and node classification.
  arXiv  Detail & Related papers  (2021-02-23T04:30:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.