Browse
Submit Data
Databases
API
Help

Dataset Information

23 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Optimal Permutation Recovery in Permuted Monotone Matrix Model.

ABSTRACT: Motivated by recent research on quantifying bacterial growth dynamics based on genome assemblies, we consider a permuted monotone matrix model Y = ΘΠ+ Z, where the rows represent different samples, the columns represent contigs in genome assemblies and the elements represent log-read counts after preprocessing steps and Guanine-Cytosine (GC) adjustment. In this model, Θ is an unknown mean matrix with monotone entries for each row, Π is a permutation matrix that permutes the columns of Θ, and Z is a noise matrix. This paper studies the problem of estimation/recovery of Π given the observed noisy matrix Y. We propose an estimator based on the best linear projection, which is shown to be minimax rate-optimal for both exact recovery, as measured by the 0-1 loss, and partial recovery, as quantified by the normalized Kendall's tau distance. Simulation studies demonstrate the superior empirical performance of the proposed estimator over alternative methods. We demonstrate the methods using a synthetic metagenomics dataset of 45 closely related bacterial species and a real metagenomic dataset to compare the bacterial growth dynamics between the responders and the non-responders of the IBD patients after 8 weeks of treatment.

SUBMITTER: Ma R

PROVIDER: S-EPMC8612635 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Near-optimal matrix recovery from random linear measurements.

Project description:In matrix recovery from random linear measurements, one is interested in recovering an unknown M-by-N matrix [Formula: see text] from [Formula: see text] measurements [Formula: see text], where each [Formula: see text] is an M-by-N measurement matrix with i.i.d. random entries, [Formula: see text] We present a matrix recovery algorithm, based on approximate message passing, which iteratively applies an optimal singular-value shrinker-a nonconvex nonlinearity tailored specifically for matrix estimation. Our algorithm typically converges exponentially fast, offering a significant speedup over previously suggested matrix recovery algorithms, such as iterative solvers for nuclear norm minimization (NNM). It is well known that there is a recovery tradeoff between the information content of the object [Formula: see text] to be recovered (specifically, its matrix rank r) and the number of linear measurements n from which recovery is to be attempted. The precise tradeoff between r and n, beyond which recovery by a given algorithm becomes possible, traces the so-called phase transition curve of that algorithm in the [Formula: see text] plane. The phase transition curve of our algorithm is noticeably better than that of NNM. Interestingly, it is close to the information-theoretic lower bound for the minimal number of measurements needed for matrix recovery, making it not only state of the art in terms of convergence rate, but also near optimal in terms of the matrices it successfully recovers.

| S-EPMC6048528 | biostudies-literature

The optimal power puzzle: scrutiny of the monotone likelihood ratio assumption in multiple testing.

Project description:In single hypothesis testing, power is a non-decreasing function of type I error rate; hence it is desirable to test at the nominal level exactly to achieve optimal power. The puzzle lies in the fact that for multiple testing, under the false discovery rate paradigm, such a monotonic relationship may not hold. In particular, exact false discovery rate control may lead to a less powerful testing procedure if a test statistic fails to fulfil the monotone likelihood ratio condition. In this article, we identify different scenarios wherein the condition fails and give caveats for conducting multiple testing in practical settings.

| S-EPMC3984571 | biostudies-literature

Discrete bat algorithm for optimal problem of permutation flow shop scheduling.

Project description:A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.

| S-EPMC4163327 | biostudies-other

Semiparametric approach for non-monotone missing covariates in a parametric regression model.

Project description:Missing covariate data often arise in biomedical studies, and analysis of such data that ignores subjects with incomplete information may lead to inefficient and possibly biased estimates. A great deal of attention has been paid to handling a single missing covariate or a monotone pattern of missing data when the missingness mechanism is missing at random. In this article, we propose a semiparametric method for handling non-monotone patterns of missing data. The proposed method relies on the assumption that the missingness mechanism of a variable does not depend on the missing variable itself but may depend on the other missing variables. This mechanism is somewhat less general than the completely non-ignorable mechanism but is sometimes more flexible than the missing at random mechanism where the missingness mechansim is allowed to depend only on the completely observed variables. The proposed approach is robust to misspecification of the distribution of the missing covariates, and the proposed mechanism helps to nullify (or reduce) the problems due to non-identifiability that result from the non-ignorable missingness mechanism. The asymptotic properties of the proposed estimator are derived. Finite sample performance is assessed through simulation studies. Finally, for the purpose of illustration we analyze an endometrial cancer dataset and a hip fracture dataset.

| S-EPMC4061254 | biostudies-literature

Monotone and near-monotone biochemical networks.

Project description:Monotone subsystems have appealing properties as components of larger networks, since they exhibit robust dynamical stability and predictability of responses to perturbations. This suggests that natural biological systems may have evolved to be, if not monotone, at least close to monotone in the sense of being decomposable into a "small" number of monotone components, In addition, recent research has shown that much insight can be attained from decomposing networks into monotone subsystems and the analysis of the resulting interconnections using tools from control theory. This paper provides an expository introduction to monotone systems and their interconnections, describing the basic concepts and some of the main mathematical results in a largely informal fashion.

| S-EPMC2533521 | biostudies-other

A permutation approach for selecting the penalty parameter in penalized model selection.

Project description:We describe a simple, computationally efficient, permutation-based procedure for selecting the penalty parameter in LASSO-penalized regression. The procedure, permutation selection, is intended for applications where variable selection is the primary focus, and can be applied in a variety of structural settings, including that of generalized linear models. We briefly discuss connections between permutation selection and existing theory for the LASSO. In addition, we present a simulation study and an analysis of real biomedical data sets in which permutation selection is compared with selection based on the following: cross-validation (CV), the Bayesian information criterion (BIC), scaled sparse linear regression, and a selection method based on recently developed testing procedures for the LASSO.

| S-EPMC4715654 | biostudies-literature

Fast, Exact Model Selection and Permutation Testing for ?2-Regularized Logistic Regression.

Project description:Regularized logistic regression is a standard classification method used in statistics and machine learning. Unlike regularized least squares problems such as ridge regression, the parameter estimates cannot be computed in closed-form and instead must be estimated using an iterative technique. This paper addresses the computational problem of regularized logistic regression that is commonly encountered in model selection and classifier statistical significance testing, in which a large number of related logistic regression problems must be solved for. Our proposed approach solves the problems simultaneously through an iterative technique, which also garners computational efficiencies by leveraging the redundancies across the related problems. We demonstrate analytically that our method provides a substantial complexity reduction, which is further validated by our results on real-world datasets.

| S-EPMC3875235 | biostudies-literature

Mathematical Model Coupled to Neural Networks Calculates the Extraction Recovery of Polycyclic Aromatic Hydrocarbons in Problematic Matrix.

Project description:Unknown extraction recovery from solid matrix samples leads to meaningless chemical analysis results. It cannot always be determined, and it depends on the complexity of the matrix and properties of the extracted substances. This paper combines a mathematical model with the machine learning method-neural networks that predict liquid extraction recovery from solid matrices. The prediction of the three-stage extraction recovery of polycyclic aromatic hydrocarbons from a wooden railway sleeper matrix is demonstrated. Calculation of the extraction recovery requires the extract's volume to be measured and the polycyclic aromatic hydrocarbons' concentration to be determined for each stage. These data are used to calculate the input values for a neural network model. Lowest mean-squared error (0.014) and smallest retraining relative standard deviation (20.7%) were achieved with the neural network setup 6:5:5:4:1 (six inputs, three hidden layers with five, five, and four neurons in a layer, and one output). To train such a neural network, it took less than 8000 steps-less than a second--using an average-performance laptop. The relative standard deviation of the extraction recovery predictions ranged between 1.13 and 5.15%. The three-stage recovery of the extracted dry sample showed 104% of three different polycyclic aromatic hydrocarbons. The extracted wet sample recovery was 71, 98, and 55% for phenanthrene, anthracene, and pyrene, respectively. This method is applicable in the environmental, food processing, pharmaceutical, biochemical, biotechnology, and space research areas where extraction should be performed autonomously without human interference.

| S-EPMC8190882 | biostudies-literature

Optimal sequence for chain matrix multiplication using evolutionary algorithm.

Project description:The Chain Matrix Multiplication Problem (CMMP) is an optimization problem that helps to find the optimal way of parenthesization for Chain Matrix Multiplication (CMM). This problem arises in various scientific applications such as in electronics, robotics, mathematical programing, and cryptography. For CMMP the researchers have proposed various techniques such as dynamic approach, arithmetic approach, and sequential multiplication. However, these techniques are deficient for providing optimal results for CMMP in terms of computational time and significant amount of scalar multiplication. In this article, we proposed a new model to minimize the Chain Matrix Multiplication (CMM) operations based on group counseling optimizer (GCO). Our experimental results and their analysis show that the proposed GCO model has achieved significant reduction of time with efficient speed when compared with sequential chain matrix multiplication approach. The proposed model provides good performance and reduces the multiplication operations varying from 45% to 96% when compared with sequential multiplication. Moreover, we evaluate our results with the best known dynamic programing and arithmetic multiplication approaches, which clearly demonstrate that proposed model outperforms in terms of computational time and space complexity.

| S-EPMC7959611 | biostudies-literature

Optical brush: Imaging through permuted probes.

Project description:The combination of computational techniques and ultrafast imaging have enabled sensing through unconventional settings such as around corners, and through diffusive media. We exploit time of flight (ToF) measurements to enable a flexible interface for imaging through permuted set of fibers. The fibers are randomly distributed in the scene and are packed on the camera end, thus making a brush-like structure. The scene is illuminated by two off-axis optical pulses. Temporal signatures of fiber tips in the scene are used to localize each fiber. Finally, by combining the position and measured intensity of each fiber, the original input is reconstructed. Unlike conventional fiber bundles with packed set of fibers that are limited by a narrow field of view (FOV), lack of flexibility, and extended coaxial precalibration, the proposed optical brush is flexible and uses off-axis calibration method based on ToF. The enabled brush form can couple to other types of ToF imaging systems. This can impact probe-based applications such as, endoscopy, tomography, and industrial imaging and sensing.

| S-EPMC4751542 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data