A new approach to radial basis function approximation and its application to QSAR.
Ontology highlight
ABSTRACT:
SUBMITTER: Zakharov AV
PROVIDER: S-EPMC3985791 | biostudies-other | 2014 Mar
REPOSITORIES: biostudies-other
Similar Datasets
Project description:The curse of dimensionality has long been a hurdle in the analysis of complex data in areas such as computational biology, ecology and econometrics. In this work, we present a forecasting algorithm that exploits the dimensionality of data in a nonparametric autoregressive framework. The main idea is that the dynamics of a chaotic dynamical system consisting of multiple time-series can be reconstructed using a combination of different variables. This nonlinear autoregressive algorithm uses multivariate attractors reconstructed as the inputs of a neural network to predict the future. We show that our approach, attractor ranked radial basis function network (AR-RBFN) provides a better forecast than that obtained using other model-free approaches as well as univariate and multivariate autoregressive models using radial basis function networks. We demonstrate this for simulated ecosystem models and a mesocosm experiment. By taking advantage of dimensionality, we show that AR-RBFN overcomes the shortcomings of noisy and short time-series data.
| S-EPMC7052196 | biostudies-literature
Project description:This paper examines the application of a bootstrap test error estimation of radial basis functions, specifically thin-plate spline fitting, in surface smoothing. The presence of noisy data is a common issue of the point set model that is generated from 3D scanning devices, and hence, point set denoising is one of the main concerns in point set modelling. Bootstrap test error estimation, which is applied when searching for the smoothing parameters of radial basis functions, is revisited. The main contribution of this paper is a smoothing algorithm that relies on a bootstrap-based radial basis function. The proposed method incorporates a k-nearest neighbour search and then projects the point set to the approximated thin-plate spline surface. Therefore, the denoising process is achieved, and the features are well preserved. A comparison of the proposed method with other smoothing methods is also carried out in this study.
| S-EPMC4912139 | biostudies-literature
Project description:BackgroundThe inference of a genetic network is a problem in which mutual interactions among genes are deduced using time-series of gene expression patterns. While a number of models have been proposed to describe genetic regulatory networks, this study focuses on a set of differential equations since it has the ability to model dynamic behavior of gene expression. When we use a set of differential equations to describe genetic networks, the inference problem can be defined as a function approximation problem. On the basis of this problem definition, we propose in this study a new method to infer reduced NGnet models of genetic networks.ResultsThrough numerical experiments on artificial genetic network inference problems, we demonstrated that our method has the ability to infer genetic networks correctly and it was faster than the other inference methods. We then applied the proposed method to actual expression data of the bacterial SOS DNA repair system, and succeeded in finding several reasonable regulations. When our method inferred the genetic network from the actual data, it required about 4.7 min on a single-CPU personal computer.ConclusionThe proposed method has an ability to obtain reasonable networks with a short computational time. As a high performance computer is not always available at every laboratory, the short computational time of our method is a preferable feature. There does not seem to be a perfect model for the inference of genetic networks yet. Therefore, in order to extract reliable information from the observed gene expression data, we should infer genetic networks using multiple inference methods based on different models. Our approach could be used as one of the promising inference methods.
| S-EPMC2258286 | biostudies-literature
Project description:Smoothing splines have been used pervasively in nonparametric regressions. However, the computational burden of smoothing splines is significant when the sample size n is large. When the number of predictors d ≥ 2 , the computational cost for smoothing splines is at the order of O(n 3) using the standard approach. Many methods have been developed to approximate smoothing spline estimators by using q basis functions instead of n ones, resulting in a computational cost of the order O(nq 2). These methods are called the basis selection methods. Despite algorithmic benefits, most of the basis selection methods require the assumption that the sample is uniformly-distributed on a hyper-cube. These methods may have deteriorating performance when such an assumption is not met. To overcome the obstacle, we develop an efficient algorithm that is adaptive to the unknown probability density function of the predictors. Theoretically, we show the proposed estimator has the same convergence rate as the full-basis estimator when q is roughly at the order of O[n 2d/{(pr+1)(d +2)}] , where p ∈[1, 2] and r ≈ 4 are some constants depend on the type of the spline. Numerical studies on various synthetic datasets demonstrate the superior performance of the proposed estimator in comparison with mainstream competitors.
| S-EPMC9674117 | biostudies-literature
Project description:BackgroundComputational drug design approaches are important for shortening the time and reducing the cost for drug discovery and development. Among these methods, molecular docking and quantitative structure activity relationship (QSAR) play key roles for lead discovery and optimization. Here, we propose an integrated approach with core strategies to identify the protein-ligand hot spots for QSAR models and lead optimization. These core strategies are: 1) to generate both residue-based and atom-based interactions as the features; 2) to identify compound common and specific skeletons; and 3) to infer consensus features for QSAR models.ResultsWe evaluated our methods and new strategies on building QSAR models of human acetylcholinesterase (huAChE). The leave-one-out cross validation values q 2 and r 2 of our huAChE QSAR model are 0.82 and 0.78, respectively. The experimental results show that the selected features (resides/atoms) are important for enzymatic functions and stabling the protein structure by forming key interactions (e.g., stack forces and hydrogen bonds) between huAChE and its inhibitors. Finally, we applied our methods to arthrobacter globiformis histamine oxidase (AGHO) which is correlated to heart failure and diabetic.ConclusionsBased on our AGHO QSAR model, we identified a new substrate verified by bioassay experiments for AGHO. These results show that our methods and new strategies can yield stable and high accuracy QSAR models. We believe that our methods and strategies are useful for discovering new leads and guiding lead optimization in drug discovery.
| S-EPMC5374651 | biostudies-literature
Project description:This paper presents improvements to the conventional Topology Representing Network to build more appropriate topology relationships. Based on this improved Topology Representing Network, we propose a novel method for online dimensionality reduction that integrates the improved Topology Representing Network and Radial Basis Function Network. This method can find meaningful low-dimensional feature structures embedded in high-dimensional original data space, process nonlinear embedded manifolds, and map the new data online. Furthermore, this method can deal with large datasets for the benefit of improved Topology Representing Network. Experiments illustrate the effectiveness of the proposed method.
| S-EPMC4498733 | biostudies-literature
Project description:Ubiquitin (Ub) is a small protein that consists of 76 amino acids about 8.5 kDa. In ubiquitin conjugation, the ubiquitin is majorly conjugated on the lysine residue of protein by Ub-ligating (E3) enzymes. Three major enzymes participate in ubiquitin conjugation. They are E1, E2 and E3 which are responsible for activating, conjugating and ligating ubiquitin, respectively. Ubiquitin conjugation in eukaryotes is an important mechanism of the proteasome-mediated degradation of a protein and regulating the activity of transcription factors. Motivated by the importance of ubiquitin conjugation in biological processes, this investigation develops a method, UbSite, which uses utilizes an efficient radial basis function (RBF) network to identify protein ubiquitin conjugation (ubiquitylation) sites. This work not only investigates the amino acid composition but also the structural characteristics, physicochemical properties, and evolutionary information of amino acids around ubiquitylation (Ub) sites. With reference to the pathway of ubiquitin conjugation, the substrate sites for E3 recognition, which are distant from ubiquitylation sites, are investigated. The measurement of F-score in a large window size (-20∼+20) revealed a statistically significant amino acid composition and position-specific scoring matrix (evolutionary information), which are mainly located distant from Ub sites. The distant information can be used effectively to differentiate Ub sites from non-Ub sites. As determined by five-fold cross-validation, the model that was trained using the combination of amino acid composition and evolutionary information performs best in identifying ubiquitin conjugation sites. The prediction sensitivity, specificity, and accuracy are 65.5%, 74.8%, and 74.5%, respectively. Although the amino acid sequences around the ubiquitin conjugation sites do not contain conserved motifs, the cross-validation result indicates that the integration of distant sequence features of Ub sites can improve predictive performance. Additionally, the independent test demonstrates that the proposed method can outperform other ubiquitylation prediction tools.
| S-EPMC3052307 | biostudies-literature
Project description:BackgroundAlthough short interfering RNA (siRNA) has been widely used for studying gene functions in mammalian cells, its gene silencing efficacy varies markedly and there are only a few consistencies among the recently reported design rules/guidelines for selecting siRNA sequences effective for mammalian genes. Another shortcoming of the previously reported methods is that they cannot estimate the probability that a candidate sequence will silence the target gene.ResultsWe propose two prediction methods for selecting effective siRNA target sequences from many possible candidate sequences, one based on the supervised learning of a radial basis function (RBF) network and other based on decision tree learning. They are quite different from the previous score-based siRNA design techniques and can predict the probability that a candidate siRNA sequence will be effective. The proposed methods were evaluated by applying them to recently reported effective and ineffective siRNA sequences for various genes (15 genes, 196 siRNA sequences). We also propose the combined prediction method of the RBF network and decision tree learning. As the average prediction probabilities of gene silencing for the effective and ineffective siRNA sequences of the reported genes by the proposed three methods were respectively 65% and 32%, 56.6% and 38.1%, and 68.5% and 28.1%, the methods imply high estimation accuracy for selecting candidate siRNA sequences.ConclusionNew prediction methods were presented for selecting effective siRNA sequences. As the proposed methods indicated high estimation accuracy for selecting candidate siRNA sequences, they would be useful for many other genes.
| S-EPMC1764479 | biostudies-literature
Project description:Deformable surface mesh registration is a useful technique for various medical applications, such as intra-operative treatment guidance and intra- or inter-patient study. In this paper, we propose an automatic deformable mesh registration technique. The proposed method iteratively deforms a source mesh to a target mesh without manual feature extraction. Each iteration of the registration consists of two steps, automatic correspondence finding using robust point-matching (RPM) and local deformation using a radial basis function (RBF). The proposed RBF-based RPM algorithm solves the interlocking problems of correspondence and deformation using a deterministic annealing framework with fuzzy correspondence and RBF interpolation. Simulation tests showed promising results, with the average deviations decreasing by factors of 21.2 and 11.9, respectively. In the human model test, the average deviation decreased from 1.72±1.88mm to 0.57±0.66mm. We demonstrate the effectiveness of the proposed method by presenting some medical applications.
| S-EPMC5035630 | biostudies-literature
Project description:BackgroundSuicide is one of the leading causes of death for college students. The predictors of suicidal ideation among college students are inconsistent and few studies have systematically investigated psychological symptoms of college students to predict suicide. Therefore, this study aims to develop a suicidal ideation prediction model and explore important predictors of suicidal ideation among college students in China.MethodsWe recruited 1,500 college students of Sichuan University and followed up for 4 years. Demographic information, behavioral and psychological information of the participants were collected using computer-based questionnaires. The Radial Basis Function Neural Network (RBFNN) method was used to develop three suicidal ideation risk prediction models and to identify important predictive factors for suicidal ideation among college students.ResultsThe incidence of suicidal ideation among college students in the last 12 months ranged from 3.00 to 4.07%. The prediction accuracies of all the three models were over 91.7%. The area under curve scores were up to 0.96. Previous suicidal ideation and poor subjective sleep quality were the most robust predictors. Poor self-rated mental health has also been identified to be an important predictor. Paranoid symptom, internet addiction, poor self-rated physical health, poor self-rated overall health, emotional abuse, low average annual household income per person and heavy study pressure were potential predictors for suicidal ideation.ConclusionsThe study suggested that the RBFNN method was accurate in predicting suicidal ideation. And students who have ever had previous suicidal ideation and poor sleep quality should be paid consistent attention to.
| S-EPMC9751327 | biostudies-literature