Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

147293440586 · Jun 202019922001200920172026
48 results for biological link prediction

Bi-GNN models drug interactions using a bi-level graph approach.

problem Predicting drug-drug interactions using machine learning.
method Bi-level graph neural networks that consider both interaction graph and representation graphs of drugs.
result Bi-GNN model improves DDI prediction accuracy compared to existing methods.

DeepSIBA predicts biological effects of chemical structures using graph neural networks.

problem Predicting biological effects of chemical structures for drug discovery.
method Siamese Graph Convolutional Neural Networks for structure-biological effect mapping.
result Highly accurate predictions of biological effects for structurally dissimilar compounds.

Paper proposes an inductive RGCN for few-shot link prediction in drug-repurposing.

problem Predicting rare interactions in drug-repurposing for novel diseases.
method Proposes an inductive RGCN to learn relation embeddings for few-shot learning.
result Significantly outperforms state-of-the-art models in few-shot learning tasks.

Most real-world networks are incompletely observed. Algorithms that can accurately predict which links are missing can dramatically speedup the collection of network data and improve the validity of network models. Many algorithms now exist for predicting missing links, given a partially observed network, but it has re…

2019-09-17abs ↗pdf ↗

The paper extends graph embedding models to handle multiple relations.

problem Link prediction in multi-relational networks.
method Generalized pseudo-Riemannian embedding models to multi-relational networks, considering relations as submanifolds.
result Validation of the approach in link prediction tasks, including knowledge graph completion and biological domain analysis.

The stochastic block model (SBM) is a probabilistic model for community structure in networks. Typically, only the adjacency matrix is used to perform SBM parameter inference. In this paper, we consider circumstances in which nodes have an associated vector of continuous attributes that are also used to learn the node-…

2018-03-07abs ↗pdf ↗

SENA-discrepancy-VAE interprets latent causal factors in biological pathways.

problem Interpreting latent causal factors in biological pathways.
method SENA-discrepancy-VAE, a model based on discrepancy-VAE, that produces interpretable latent causal factors.
result Sena-discrepancy-VAE achieves comparable predictive performance with non-interpretable counterparts while providing biologically meaningful causal factors.

Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes then depends only on their cluster assignment. Currently available models can b…

2012-06-27abs ↗pdf ↗

Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of statistical relational learning (SRL) algorithms to these domains. In this article, we exami…

2012-03-30abs ↗pdf ↗

Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This approach has been highly successful owing to the theory, methodology and software that …

2017-03-14abs ↗pdf ↗

Networks provide a powerful formalism for modeling complex systems by using a model of pairwise interactions. But much of the structure within these systems involves interactions that take place among more than two nodes at once; for example, communication within a group rather than person-to person, collaboration amon…

2018-02-20abs ↗pdf ↗

Graph auto-encoder predicts unobserved node features from biological networks and omics data.

problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.

Substring kernels are classical tools for representing biological sequences or text. However, when large amounts of annotated data are available, models that allow end-to-end training such as neural networks are often preferred. Links between recurrent neural networks (RNNs) and substring kernels have recently been dra…

2019-06-07abs ↗pdf ↗

Bio-inspired neural networks use predictive coding for efficient weight updates.

problem Training artificial neural networks efficiently and biologically plausibly.
method Predictive Coding (PC) updates weights locally using only local information.
result PC provides theoretical advantages like automatic gradient scaling.

BioBO optimizes gene perturbation design using Bayesian optimization with biological priors.

problem Efficient design of genomic perturbation experiments in drug discovery.
method Integrates Bayesian optimization with multimodal gene embeddings and enrichment analysis.
result Improves labeling efficiency by 25-40% and identifies top-performing perturbations more effectively.

A new method predicts higher-order interactions in evolving graphs using simplicial complexes.

problem Predicting higher-order interactions in dynamic graphs with theoretical guarantees.
method Capturing higher-order interactions as simplices, modeling neighborhoods with face-vectors, and developing a nonparametric kernel estimator.
result Our method outperforms existing higher-order prediction methods and is theoretically consistent.

The paper relaxes constraints on predictive coding models, making them more biologically plausible.

problem Neurophysiological models of predictive coding are not fully biologically plausible.
method The paper relaxes constraints on standard predictive coding algorithms by removing neurally implausible features.
result The removal of neurally implausible features does not significantly affect learning performance.

Researchers develop flexible kernels for biological sequences with guaranteed reliability.

problem Challenges in applying machine learning to biological sequences, including unreliable methods.
method Theoretical analysis and development of modified kernels to ensure reliability and accuracy.
result Developed kernels that are universal, characteristic, and metrize the space of distributions for biological sequences.

We propose a method to model multi-agent behaviors with limited observation and mechanical constraints.

problem Modeling real-world multi-agent behaviors with limited observation and mechanical constraints.
method Decentralized generative models with partial observation and mechanical constraints based on hierarchical variational recurrent neural networks.
result Our method effectively models and predicts biologically plausible behaviors with minimal constraint violations.

Identifying measurable genetic indicators (or biomarkers) of a specific condition of a biological system is a key element of precision medicine. Indeed it allows to tailor diagnostic, prognostic and treatment choice to individual characteristics of a patient. In machine learning terms, biomarker discovery can be framed…

2016-07-27abs ↗pdf ↗

Paper predicts multiple types of miRNA-disease associations using tensor decomposition.

problem Predicting miRNA-disease associations, especially multi-type ones.
method Represented miRNA-disease-type triplets as a tensor and used Tensor Decomposition methods.
result Tensor Decomposition methods improve a recent baseline by up to 38% in top-1 F1.

Recent years have witnessed a trend that advanced mathematical tools, such as algebraic topology, differential geometry, graph theory, and partial differential equations, have been developed for describing biological macromolecules. These tools have considerably strengthened our ability to understand the molecular mech…

2019-08-01abs ↗pdf ↗

Optimizes biomanufacturing processes with a new digital twin calibration method.

problem Lack of interpretability and sample efficiency in traditional DoE methods.
method Developed a computational approach to calibrate Bio-SoS digital twin model.
result Guides sample-efficient and interpretable DoEs by quantifying sub-model parameter estimation errors.

Biological systems are often modelled at different levels of abstraction depending on the particular aims/resources of a study. Such different models often provide qualitatively concordant predictions over specific parametrisations, but it is generally unclear whether model predictions are quantitatively in agreement, …

2016-05-07abs ↗pdf ↗

scICML integrates multi-omics data from single cells using co-clustering.

problem High noise and sparsity in multi-omics data from single cells.
method Information-theoretic co-clustering-based multi-view learning.
result Improves clustering performance and provides biological insights.

In this paper, we study a geometric/topological measure of knots and links called the nullification number. The nullification of knots/links is believed to be biologically relevant. For example, in DNA topology, one can intuitively regard it as a way to measure how easily a knotted circular DNA can unknot itself throug…

2011-01-06abs ↗pdf ↗