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,932 papers · 148 categories

Trend · papers per month

306089119 · Jun 202019922001200920172026
48 results for SNP Interactions

SAERMA combines deep learning and rule mining to identify SNP interactions.

problem Identifying significant SNPs and their interactions in complex diseases.
method Stacked Autoencoder Rule Mining Algorithm (SAERMA) integrating deep learning and association rule mining.
result Achieved high classification accuracy (77% AUC, 77% SE, 68% SP) with 100 units.

A computationally simple genome-wide association study (GWAS) algorithm for estimating the main and epistatic effects of markers or single nucleotide polymorphisms (SNPs) is proposed. It is based on the intuitive assumption that changes of alleles corresponding to important SNPs in a pair of individuals lead to large d…

2017-08-05abs ↗pdf ↗

We construct genomic predictors for heritable and extremely complex human quantitative traits (height, heel bone density, and educational attainment) using modern methods in high dimensional statistics (i.e., machine learning). Replication tests show that these predictors capture, respectively, \sim40, 20, and 9 perc…

2017-09-19abs ↗pdf ↗

This paper presents a method for efficient density estimation in nonlinear systems.

problem Accurate representation of non-Gaussian distributions in nonlinear dynamical systems is challenging.
method Uses Seminonparametric (SNP) densities with probabilists' Hermite polynomial basis and Monte Carlo approximation for maximum likelihood estimation.
result Demonstrates that the method can accurately capture non-Gaussian density structure and compute quantiles using fewer samples than raw Monte Carlo.

Discovers discriminative patterns in two-class datasets.

problem Discovering patterns that occur more frequently in one class than the other.
method Proposes SSDPS algorithm with an original enumeration strategy exploiting anti-monotonicity.
result SSDPS outperforms other algorithms in terms of efficiency and pattern generation.

Heterosis is the improved or increased function of any biological quality in a hybrid offspring. We have studied yet the largest maize SNP dataset for traits prediction. We develop linear and non-linear models which consider relationships between different hybrids as well as other effect. Specially designed model prove…

2018-08-20abs ↗pdf ↗

New method analyzes complex multivariate pathways in high-dimensional data.

problem High-dimensional mediation analysis of multivariate exposures, mediators, and outcomes.
method Simultaneous variable selection, indirect effect matrix estimation, and prediction of multivariate outcomes.
result Identifies biologically interpretable genetic-neural-cognitive pathways.

We have developed a strategy for the analysis of newly available binary data to improve outcome predictions based on existing data (binary or non-binary). Our strategy involves two modeling approaches for the newly available data, one combining binary covariate selection via LASSO with logistic regression and one based…

2008-05-21abs ↗pdf ↗

A new method for joint eQTL mapping and gene network estimation.

problem Discovering SNP-gene relationships and gene-gene relationships in gene expression regulation.
method L1-2 regularized multi-task graphical lasso (L1-2 GLasso).
result Competitive performance on capturing true sparse structures of eQTL mapping and gene network.

ASCEND discovers causal relationships in multi-omics data by leveraging known hierarchical structure.

problem Causal inference in high-dimensional multi-omics data, especially when ignoring the hierarchical structure.
method Two-tiered divide-and-conquer strategy with ancestral conditioning sets.
result Achieves polynomial-time complexity and accurately recovers ancestral relationships.

Paper proposes inference method for high-dimensional censored quantile regression.

problem Identifying heterogeneous effects of high-dimensional genetic biomarkers on survival outcomes.
method Combines low-dimensional model estimates based on multi-sample splittings and variable selection.
result Proposed estimator is consistent and asymptotically follows a Gaussian process.

Factorization Machine (FM) is a widely used supervised learning approach by effectively modeling of feature interactions. Despite the successful application of FM and its many deep learning variants, treating every feature interaction fairly may degrade the performance. For example, the interactions of a useless featur…

2019-02-26abs ↗pdf ↗

New method for causal discovery using peeling algorithms for various data types.

problem Challenges in causal discovery due to unmeasured confounders.
method Two peeling algorithms (bottom-up and top-down) for causal discovery with generalized structural equation models.
result Valid discovery of causal relationships and parent-child effects in diverse data types.

A new method detects interactions in neural networks using topological analysis.

problem Detecting interactions between input features in neural networks.
method Topological analysis of neural network connectivity to quantify interaction strength.
result The PID algorithm outperforms state-of-the-art baselines in interaction detection tasks.

InteractE improves link prediction in KGs by increasing feature interactions.

problem Improving link prediction in knowledge graphs by inferring missing links.
method Feature permutation, novel feature reshaping, circular convolution.
result InteractE outperforms ConvE on multiple KG datasets.

iKF method uncovers complex variable interactions for scientific discovery.

problem Limited interpretability of existing models in decision-making applications.
method Iterative Kings' Forests (iKF) method to uncover multi-order interactions.
result iKF provides strong interpretive power for explainable modeling.

Graph neural network predicts vehicle interactions and trajectories for autonomous driving.

problem Predicting future motion of vehicles in traffic scenes.
method Graph neural network that jointly predicts interaction modes and 5-second future trajectories.
result Jointly predicting trajectories and interaction modes leads to lower trajectory error.

A graph neural network detects beneficial feature interactions for recommender systems.

problem Feature interactions are crucial but not all are beneficial for recommendation accuracy.
method Graph neural network with L0 activation regularization for edge prediction.
result The model outperforms baselines and automatically identifies beneficial feature interactions.

We describe and extract time-ordered multibody interactions from complex systems.

problem Complex systems with temporal and multibody dependencies.
method Decompose multivariate Markov chains into time-ordered multibody interactions. Algorithm to extract interactions from data. Measure complexity of interaction ensembles.
result Robust and efficient algorithm to infer time-ordered multibody interactions from data.

Dropout regularizes against high-order interactions by canceling interaction rates.

problem Overfitting to high-order interactions in neural networks.
method Analyzes Dropout through the lens of interaction effects, showing how it effectively cancels out the probability of surviving interactions of different orders.
result Dropout regularizes against high-order interactions by effectively canceling out the probability of surviving interactions of different orders.

Understanding how features interact with each other is of paramount importance in many scientific discoveries and contemporary applications. Yet interaction identification becomes challenging even for a moderate number of covariates. In this paper, we suggest an efficient and flexible procedure, called the interaction …

2016-05-28abs ↗pdf ↗