Identifying efficient controls of complex interaction networks using genetic algorithms

• URL: http://arxiv.org/abs/2007.04853v1
• Date: Thu, 9 Jul 2020 14:56:54 GMT
• Title: Identifying efficient controls of complex interaction networks using genetic algorithms
• Authors: Victor-Bogdan Popescu and Krishna Kanhaiya and Iulian N\u{a}stac and Eugen Czeizler and Ion Petre
• Abstract summary: We propose a new solution for a problem known as network controllability. We tailor our solution for applications in computational drug repurposing. We show how our algorithm identifies a number of potentially efficient drugs for breast, ovarian, and pancreatic cancer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Control theory has seen recently impactful applications in network science, especially in connections with applications in network medicine. A key topic of research is that of finding minimal external interventions that offer control over the dynamics of a given network, a problem known as network controllability. We propose in this article a new solution for this problem based on genetic algorithms. We tailor our solution for applications in computational drug repurposing, seeking to maximise its use of FDA-approved drug targets in a given disease-specific protein-protein interaction network. We show how our algorithm identifies a number of potentially efficient drugs for breast, ovarian, and pancreatic cancer. We demonstrate our algorithm on several benchmark networks from cancer medicine, social networks, electronic circuits, and several random networks with their edges distributed according to the Erd\H{o}s-R\'{e}nyi, the small-world, and the scale-free properties. Overall, we show that our new algorithm is more efficient in identifying relevant drug targets in a disease network, advancing the computational solutions needed for new therapeutic and drug repurposing approaches.

Related papers

• Targeted Cause Discovery with Data-Driven Learning [66.86881771339145]
  We propose a novel machine learning approach for inferring causal variables of a target variable from observations. We employ a neural network trained to identify causality through supervised learning on simulated data. Empirical results demonstrate the effectiveness of our method in identifying causal relationships within large-scale gene regulatory networks.
  arXiv  Detail & Related papers  (2024-08-29T02:21:11Z)
• Simplicity within biological complexity [0.0]
  We survey the literature and argue for the development of a comprehensive framework for embedding of multi-scale molecular network data. Network embedding methods map nodes to points in low-dimensional space, so that proximity in the learned space reflects the network's topology-function relationships. We propose to develop a general, comprehensive embedding framework for multi-omic network data, from models to efficient and scalable software implementation.
  arXiv  Detail & Related papers  (2024-05-15T13:32:45Z)
• Emerging Drug Interaction Prediction Enabled by Flow-based Graph Neural Network with Biomedical Network [69.16939798838159]
  We propose EmerGNN, a graph neural network (GNN) that can effectively predict interactions for emerging drugs. EmerGNN learns pairwise representations of drugs by extracting the paths between drug pairs, propagating information from one drug to the other, and incorporating the relevant biomedical concepts on the paths. Overall, EmerGNN has higher accuracy than existing approaches in predicting interactions for emerging drugs and can identify the most relevant information on the biomedical network.
  arXiv  Detail & Related papers  (2023-11-15T06:34:00Z)
• Cross-Validation for Training and Testing Co-occurrence Network Inference Algorithms [1.8638865257327277]
  Co-occurrence network inference algorithms help us understand the complex associations of micro-organisms, especially bacteria. Previous methods for evaluating the quality of the inferred network include using external data, and network consistency across sub-samples. We propose a novel cross-validation method to evaluate co-occurrence network inference algorithms, and new methods for applying existing algorithms to predict on test data.
  arXiv  Detail & Related papers  (2023-09-26T19:43:15Z)
• Two Novel Approaches to Detect Community: A Case Study of Omicron Lineage Variants PPI Network [0.5156484100374058]
  We aim to uncover the communities within the variant B.1.1.529 (Omicron virus) using two proposed novel algorithms and four widely recognized algorithms. We also compare the networks by the global properties, statistic summary, subgraph count, graphlet and validate by the modulaity.
  arXiv  Detail & Related papers  (2023-08-09T03:51:20Z)
• Anomaly Detection in Multiplex Dynamic Networks: from Blockchain Security to Brain Disease Prediction [0.0]
  ANOMULY is an unsupervised edge anomaly detection framework for multiplex dynamic networks. We show how ANOMULY could be employed as a new tool to understand abnormal brain activity that might reveal a brain disease or disorder.
  arXiv  Detail & Related papers  (2022-11-15T18:25:40Z)
• Quantum network medicine: rethinking medicine with network science and quantum algorithms [0.0]
  Quantum computing may be a key ingredient in enabling the full potential of network medicine. We propose to combine network medicine and quantum algorithms in a novel research field, quantum network medicine.
  arXiv  Detail & Related papers  (2022-06-22T09:05:24Z)
• Frequent Itemset-driven Search for Finding Minimum Node Separators in Complex Networks [61.2383572324176]
  We propose a frequent itemset-driven search approach, which integrates the concept of frequent itemset mining in data mining into the well-known memetic search framework. It iteratively employs the frequent itemset recombination operator to generate promising offspring solution based on itemsets that frequently occur in high-quality solutions. In particular, it discovers 29 new upper bounds and matches 18 previous best-known bounds.
  arXiv  Detail & Related papers  (2022-01-18T11:16:40Z)
• Credit Assignment in Neural Networks through Deep Feedback Control [59.14935871979047]
  Deep Feedback Control (DFC) is a new learning method that uses a feedback controller to drive a deep neural network to match a desired output target and whose control signal can be used for credit assignment. The resulting learning rule is fully local in space and time and approximates Gauss-Newton optimization for a wide range of connectivity patterns. To further underline its biological plausibility, we relate DFC to a multi-compartment model of cortical pyramidal neurons with a local voltage-dependent synaptic plasticity rule, consistent with recent theories of dendritic processing.
  arXiv  Detail & Related papers  (2021-06-15T05:30:17Z)
• LocalDrop: A Hybrid Regularization for Deep Neural Networks [98.30782118441158]
  We propose a new approach for the regularization of neural networks by the local Rademacher complexity called LocalDrop. A new regularization function for both fully-connected networks (FCNs) and convolutional neural networks (CNNs) has been developed based on the proposed upper bound of the local Rademacher complexity.
  arXiv  Detail & Related papers  (2021-03-01T03:10:11Z)
• Towards Interaction Detection Using Topological Analysis on Neural Networks [55.74562391439507]
  In neural networks, any interacting features must follow a strongly weighted connection to common hidden units. We propose a new measure for quantifying interaction strength, based upon the well-received theory of persistent homology. A Persistence Interaction detection(PID) algorithm is developed to efficiently detect interactions.
  arXiv  Detail & Related papers  (2020-10-25T02:15:24Z)

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.