Search results for "Computational Mathematic"
showing 10 items of 987 documents
Visualizing categorical data in ViSta
2003
The modules in the statistical package ViSta related to categorical data analysis are presented These modules are: visualization of frequency data with mosaic and bar plots, correspondence analysis, multiple correspondence analysis and loglinear analysis. All these methods are implemented in ViSta with a big emphasis on plots and graphical representations of data, as well as interactivity for the user with the system. These provide a system that has shown to be easy, useful, and powerful, both for novice and experienced users.
SeqEditor: an application for primer design and sequence analysis with or without GTF/GFF files
2021
[Motivation]: Sequence analyses oriented to investigate specific features, patterns and functions of protein and DNA/RNA sequences usually require tools based on graphic interfaces whose main characteristic is their intuitiveness and interactivity with the user’s expertise, especially when curation or primer design tasks are required. However, interface-based tools usually pose certain computational limitations when managing large sequences or complex datasets, such as genome and transcriptome assemblies. Having these requirments in mind we have developed SeqEditor an interactive software tool for nucleotide and protein sequences’ analysis.
Clustering of spatial point patterns
2006
Spatial point patterns arise as the natural sampling information in many problems. An ophthalmologic problem gave rise to the problem of detecting clusters of point patterns. A set of human corneal endothelium images is given. Each image is described by using a point pattern, the cell centroids. The main problem is to find groups of images corresponding with groups of spatial point patterns. This is interesting from a descriptive point of view and for clinical purposes. A new image can be compared with prototypes of each group and finally evaluated by the physician. Usual descriptors of spatial point patterns such as the empty-space function, the nearest distribution function or Ripley's K-…
A Knowledge Management and Decision Support Model for Enterprises
2011
We propose a novel knowledge management system (KMS) for enterprises. Our system exploits two different approaches for knowledge representation and reasoning: a document-based approach based on data-driven creation of a semantic space and an ontology-based model. Furthermore, we provide an expert system capable of supporting the enterprise decisional processes and a semantic engine which performs intelligent search on the enterprise knowledge bases. The decision support process exploits the Bayesian networks model to improve business planning process when performed under uncertainty. Copyright © 2011 Patrizia Ribino et al.
Triply Factorised Groups and the Structure of Skew Left Braces
2021
The algebraic structure of skew left brace has proved to be useful as a source of set-theoretic solutions of the Yang–Baxter equation. We study in this paper the connections between left and right $$\pi $$ -nilpotency and the structure of finite skew left braces. We also study factorisations of skew left braces and their impact on the skew left brace structure. As a consequence of our study, we define a Fitting-like ideal of a left brace. Our approach depends strongly on a description of a skew left brace in terms of a triply factorised group obtained from the action of the multiplicative group of the skew left brace on its additive group.
Sparse kernel methods for high-dimensional survival data
2008
Abstract Sparse kernel methods like support vector machines (SVM) have been applied with great success to classification and (standard) regression settings. Existing support vector classification and regression techniques however are not suitable for partly censored survival data, which are typically analysed using Cox's proportional hazards model. As the partial likelihood of the proportional hazards model only depends on the covariates through inner products, it can be ‘kernelized’. The kernelized proportional hazards model however yields a solution that is dense, i.e. the solution depends on all observations. One of the key features of an SVM is that it yields a sparse solution, dependin…
MCMC methods to approximate conditional predictive distributions
2006
Sampling from conditional distributions is a problem often encountered in statistics when inferences are based on conditional distributions which are not of closed-form. Several Markov chain Monte Carlo (MCMC) algorithms to simulate from them are proposed. Potential problems are pointed out and some suitable modifications are suggested. Approximations based on conditioning sets are also explored. The issues are illustrated within a specific statistical tool for Bayesian model checking, and compared in an example. An example in frequentist conditional testing is also given.
Componentwise adaptation for high dimensional MCMC
2005
We introduce a new adaptive MCMC algorithm, based on the traditional single component Metropolis-Hastings algorithm and on our earlier adaptive Metropolis algorithm (AM). In the new algorithm the adaption is performed component by component. The chain is no more Markovian, but it remains ergodic. The algorithm is demonstrated to work well in varying test cases up to 1000 dimensions.
Pseudo-Cut Strategies for Global Optimization
2011
Motivated by the successful use of a pseudo-cut strategy within the setting of constrained nonlinear and nonconvex optimization in Lasdon et al. (2010), we propose a framework for general pseudo-cut strategies in global optimization that provides a broader and more comprehensive range of methods. The fundamental idea is to introduce linear cutting planes that provide temporary, possibly invalid, restrictions on the space of feasible solutions, as proposed in the setting of the tabu search metaheuristic in Glover (1989), in order to guide a solution process toward a global optimum, where the cutting planes can be discarded and replaced by others as the process continues. These strategies can…
Model comparison and selection for stationary space–time models
2007
An intensive simulation study to compare the spatio-temporal prediction performances among various space-time models is presented. The models having separable spatio-temporal covariance functions and nonseparable ones, under various scenarios, are also considered. The computational performance among the various selected models are compared. The issue of how to select an appropriate space-time model by accounting for the tradeoff between goodness-of-fit and model complexity is addressed. Performances of the two commonly used model-selection criteria, Akaike information criterion and Bayesian information criterion are examined. Furthermore, a practical application based on the statistical ana…