New estimations on the upper bounds for the nuclear norm of a tensor.
Ontology highlight
ABSTRACT:
SUBMITTER: Kong X
PROVIDER: S-EPMC6208618 | biostudies-other | 2018
REPOSITORIES: biostudies-other
Similar Datasets
Project description:The notion of a fuzzy upper bound over a groupoid is introduced and some properties of it are investigated. We also define the notions of an either-or subset of a groupoid and a strong either-or subset of a groupoid and study some of their related properties. In particular, we consider fuzzy upper bounds in Bin(X), where Bin(X) is the collection of all groupoids. Finally, we define a fuzzy-d-subset of a groupoid and investigate some of its properties.
| S-EPMC4058160 | biostudies-other
Project description:We propose an adaptive nuclear norm penalization approach for low-rank matrix approximation, and use it to develop a new reduced rank estimation method for high-dimensional multivariate regression. The adaptive nuclear norm is defined as the weighted sum of the singular values of the matrix, and it is generally non-convex under the natural restriction that the weight decreases with the singular value. However, we show that the proposed non-convex penalized regression method has a global optimal solution obtained from an adaptively soft-thresholded singular value decomposition. The method is computationally efficient, and the resulting solution path is continuous. The rank consistency of and prediction/estimation performance bounds for the estimator are established for a high-dimensional asymptotic regime. Simulation studies and an application in genetics demonstrate its efficacy.
| S-EPMC4101086 | biostudies-literature
Project description:MotivationComputational drug repositioning is a cost-effective strategy to identify novel indications for existing drugs. Drug repositioning is often modeled as a recommendation system problem. Taking advantage of the known drug-disease associations, the objective of the recommendation system is to identify new treatments by filling out the unknown entries in the drug-disease association matrix, which is known as matrix completion. Underpinned by the fact that common molecular pathways contribute to many different diseases, the recommendation system assumes that the underlying latent factors determining drug-disease associations are highly correlated. In other words, the drug-disease matrix to be completed is low-rank. Accordingly, matrix completion algorithms efficiently constructing low-rank drug-disease matrix approximations consistent with known associations can be of immense help in discovering the novel drug-disease associations.ResultsIn this article, we propose to use a bounded nuclear norm regularization (BNNR) method to complete the drug-disease matrix under the low-rank assumption. Instead of strictly fitting the known elements, BNNR is designed to tolerate the noisy drug-drug and disease-disease similarities by incorporating a regularization term to balance the approximation error and the rank properties. Moreover, additional constraints are incorporated into BNNR to ensure that all predicted matrix entry values are within the specific interval. BNNR is carried out on an adjacency matrix of a heterogeneous drug-disease network, which integrates the drug-drug, drug-disease and disease-disease networks. It not only makes full use of available drugs, diseases and their association information, but also is capable of dealing with cold start naturally. Our computational results show that BNNR yields higher drug-disease association prediction accuracy than the current state-of-the-art methods. The most significant gain is in prediction precision measured as the fraction of the positive predictions that are truly positive, which is particularly useful in drug design practice. Cases studies also confirm the accuracy and reliability of BNNR.Availability and implementationThe code of BNNR is freely available at https://github.com/BioinformaticsCSU/BNNR.Supplementary informationSupplementary data are available at Bioinformatics online.
| S-EPMC6612853 | biostudies-literature
Project description:Premature discontinuation and other forms of noncompliance with treatment assignment can complicate causal inference of treatment effects in randomized trials. The intent-to-treat analysis gives unbiased estimates for causal effects of treatment assignment on outcome, but may understate potential benefit or harm of actual treatment. The corresponding upper confidence limit can also be underestimated.To compare estimates of the hazard ratio and upper bound of the two-sided 95% confidence interval from causal inference methods that account for noncompliance with those from the intent-to-treat analysis.We used simulations with parameters chosen to reflect cardiovascular safety trials of diabetes drugs, with a focus on upper bound estimates relative to 1.3, based on regulatory guidelines. A total of 1000 simulations were run under each parameter combination for a hypothetical trial of 10,000 total subjects randomly assigned to active treatment or control at 1:1 ratio. Noncompliance was considered in the form of treatment discontinuation and cross-over at specified proportions, with an assumed true hazard ratio of 0.9, 1, and 1.3, respectively. Various levels of risk associated with being a non-complier (independent of treatment status) were evaluated. Hazard ratio and upper bound estimates from causal survival analysis and intent-to-treat were obtained from each simulation and summarized under each parameter setting.Causal analysis estimated the true hazard ratio with little bias in almost all settings examined. Intent-to-treat was unbiased only when the true hazard ratio?=?1; otherwise it underestimated both benefit and harm. When upper bound estimates from intent-to-treat were ?1.3, corresponding estimates from causal analysis were also ?1.3 in almost 100% of the simulations, regardless of the true hazard ratio. When upper bound estimates from intent-to-treat were <1.3 and the true hazard ratio?=?1, corresponding upper bound estimates from causal analysis were ?1.3 in up to 66% of the simulations under some settings.Simulations cannot cover all scenarios for noncompliance in real randomized trials.Causal survival analysis was superior to intent-to-treat in estimating the true hazard ratio with respect to bias in the presence of noncompliance. However, its large variance should be considered for safety upper bound exclusion especially when the true hazard ratio?=?1. Our simulations provided a broad reference for practical considerations of bias-variance trade-off in dealing with noncompliance in cardiovascular safety trials of diabetes drugs. Further research is warranted for the development and application of causal inference methods in the evaluation of safety upper bounds.
| S-EPMC4420771 | biostudies-literature
Project description:MotivationReticulate network is a model for displaying and quantifying the effects of complex reticulate processes on the evolutionary history of species undergoing reticulate evolution. A central computational problem on reticulate networks is: given a set of phylogenetic trees (each for some region of the genomes), reconstruct the most parsimonious reticulate network (called the minimum reticulate network) that combines the topological information contained in the given trees. This problem is well-known to be NP-hard. Thus, existing approaches for this problem either work with only two input trees or make simplifying topological assumptions.ResultsWe present novel results on the minimum reticulate network problem. Unlike existing approaches, we address the fully general problem: there is no restriction on the number of trees that are input, and there is no restriction on the form of the allowed reticulate network. We present lower and upper bounds on the minimum number of reticulation events in the minimum reticulate network (and infer an approximately parsimonious reticulate network). A program called PIRN implements these methods, which also outputs a graphical representation of the inferred network. Empirical results on simulated and biological data show that our methods are practical for a wide range of data. More importantly, the lower and upper bounds match for many datasets (especially when the number of trees is small or reticulation level is low), and this allows us to solve the minimum reticulate network problem exactly for these datasets.AvailabilityA software tool, PIRN, is available for download from the web page: http://www.engr.uconn.edu/~ywu.Supplementary informationSupplementary data is available at Bioinformatics online.
| S-EPMC2881383 | biostudies-literature
Project description:BACKGROUND: Enumeration of chemical graphs satisfying given constraints is one of the fundamental problems in chemoinformatics and bioinformatics since it leads to a variety of useful applications including structure determination of novel chemical compounds and drug design. RESULTS: In this paper, we consider the problem of enumerating all tree-like chemical graphs from a given set of feature vectors, which is specified by a pair of upper and lower feature vectors, where a feature vector represents the frequency of prescribed paths in a chemical compound to be constructed. This problem can be solved by applying the algorithm proposed by Ishida et al. to each single feature vector in the given set, but this method may take much computation time because in general there are many feature vectors in a given set. We propose a new exact branch-and-bound algorithm for the problem so that all the feature vectors in a given set are handled directly. Since we cannot use the bounding operation proposed by Ishida et al. due to upper and lower constraints, we introduce new bounding operations based on upper and lower feature vectors, a bond constraint, and a detachment condition. CONCLUSIONS: Our proposed algorithm is useful for enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
| S-EPMC3287468 | biostudies-literature
Project description:Clustering techniques are widely used in many applications. The goal of clustering is to identify patterns or groups of similar objects within a dataset of interest. However, many cluster methods are neither robust nor sensitive to noises and outliers in real data. In this paper, we present Nuclear Norm Clustering (NNC, available at https://sourceforge.net/projects/nnc/), an algorithm that can be used in various fields as a promising alternative to the k-means clustering method. The NNC algorithm requires users to provide a data matrix M and a desired number of cluster K. We employed simulated annealing techniques to choose an optimal label vector that minimizes nuclear norm of the pooled within cluster residual matrix. To evaluate the performance of the NNC algorithm, we compared the performance of both 15 public datasets and 2 genome-wide association studies (GWAS) on psoriasis, comparing our method with other classic methods. The results indicate that NNC method has a competitive performance in terms of F-score on 15 benchmarked public datasets and 2 psoriasis GWAS datasets. So NNC is a promising alternative method for clustering tasks.
| S-EPMC6052164 | biostudies-literature
Project description:The identification of potential interactions between drugs and target proteins is crucial in pharmaceutical sciences. The experimental validation of interactions in genomic drug discovery is laborious and expensive; hence, there is a need for efficient and accurate in-silico techniques which can predict potential drug-target interactions to narrow down the search space for experimental verification. In this work, we propose a new framework, namely, Multi-Graph Regularized Nuclear Norm Minimization, which predicts the interactions between drugs and target proteins from three inputs: known drug-target interaction network, similarities over drugs and those over targets. The proposed method focuses on finding a low-rank interaction matrix that is structured by the proximities of drugs and targets encoded by graphs. Previous works on Drug Target Interaction (DTI) prediction have shown that incorporating drug and target similarities helps in learning the data manifold better by preserving the local geometries of the original data. But, there is no clear consensus on which kind and what combination of similarities would best assist the prediction task. Hence, we propose to use various multiple drug-drug similarities and target-target similarities as multiple graph Laplacian (over drugs/targets) regularization terms to capture the proximities exhaustively. Extensive cross-validation experiments on four benchmark datasets using standard evaluation metrics (AUPR and AUC) show that the proposed algorithm improves the predictive performance and outperforms recent state-of-the-art computational methods by a large margin. Software is publicly available at https://github.com/aanchalMongia/MGRNNMforDTI.
| S-EPMC6964976 | biostudies-literature
Project description:This data article is related to the research article entitled "Origin and intra-island diversification of Sulawesi endemic Adrianichthyidae" by Mokodongan and Yamahira [1]. In this data article, we present phylogenetic trees of Sulawesi adrianichthyids separately reconstructed using mitochondrial (cytochrome b: cyt b and NADH dehydrogenase subunit 2: ND2) and nuclear (tyrosinase) sequences. We also present Bayesian chronograms of Sulawesi adrianichthyids separately estimated using a substitution rate for cyt b and for ND2.
| S-EPMC4589798 | biostudies-literature
Project description:The disruption from COVID-19 has been felt deeply across all walks of life. Similarly, academic conferences as one key pillar of dissemination and interaction around research and development have taken a hit. We analyse an interesting focal point as to how conferences in the area of Computer Science have reacted to this disruption with respect to their mode of offering and registration prices, and whether their response is contingent upon specific factors such as where the conference was to be hosted, its ranking, its publisher or its original scheduled date. To achieve this, we collected metadata associated with 170 conferences in the area of Computer Science and as a means of comparison; 25 Psychology conferences. We show that conferences in the area of Computer Science have demonstrated agility and resilience by progressing to an online mode due to COVID-19 (approximately 76% of Computer Science conferences moved to an online mode), many with no changes in their schedule, particularly those in North America and those with a higher ranking. Whilst registration fees have lowered by an average of 42% due to the onset of COVID-19, conferences still have to facilitate attendance on a large scale due to the logistics and costs involved. In conclusion, we discuss the implications of our findings and speculate what they mean for conferences, including those in Computer Science, in the post-COVID-19 world.
| S-EPMC7695239 | biostudies-literature