Discerning Two Words by a Minimum Size Automaton
Wiedermann, Jiří
2016 - English Keywords: finite automaton; discerning two words; complexity Available in a digital repository NRGL Discerning Two Words by a Minimum Size Automaton

Wiedermann, Jiří
Ústav informatiky, 2016

Report on the Last Work by Dr. Erich Nuding
Rohn, Jiří
2016 - English This is a facsimile copy of a 1994 report on the unpublished last paper by Dr. Erich Nuding. It is being made public here in the hope that even after twenty-two years it may be of interest for researchers working in the area of interval computations because of the intriguing concept of the "fourth modality" which has not been rediscovered during a quarter of century which has elapsed since its original formulation. Keywords: set-valued mapping; interval linear equations; solution set; fourth modality Available in a digital repository NRGL Report on the Last Work by Dr. Erich Nuding

This is a facsimile copy of a 1994 report on the unpublished last paper by Dr. Erich Nuding. It is being made public here in the hope that even after twenty-two years it may be of interest for ...

Rohn, Jiří
Ústav informatiky, 2016

Some Robust Estimation Tools for Multivariate Models
Kalina, Jan
2015 - English Standard procedures of multivariate statistics and data mining for the analysis of multivariate data are known to be vulnerable to the presence of outlying and/or highly influential observations. This paper has the aim to propose and investigate specific approaches for two situations. First, we consider clustering of categorical data. While attention has been paid to sensitivity of standard statistical and data mining methods for categorical data only recently, we aim at modifying standard distance measures between clusters of such data. This allows us to propose a hierarchical agglomerative cluster analysis for two-way contingency tables with a large number of categories, based on a regularized measure of distance between two contingency tables. Such proposal improves the robustness to the presence of measurement errors for categorical data. As a second problem, we investigate the nonlinear version of the least weighted squares regression for data with a continuous response. Our aim is to propose an efficient algorithm for the least weighted squares estimator, which is formulated in a general way applicable to both linear and nonlinear regression. Our numerical study reveals the computational aspects of the algorithm and brings arguments in favor of its credibility. Keywords: robust data mining; high-dimensional data; cluster analysis; outliers Fulltext is available at external website. Some Robust Estimation Tools for Multivariate Models

Standard procedures of multivariate statistics and data mining for the analysis of multivariate data are known to be vulnerable to the presence of outlying and/or highly influential observations. This ...

Kalina, Jan
Ústav informatiky, 2015

Nonlinear Conjugate Gradient Methods
Lukšan, Ladislav; Vlček, Jan
2015 - English Modifications of nonlinear conjugate gradient method are described and tested. Keywords: minimization; nonlinear conjugate gradient methods; comparison of methods; efficiency of methods Available in digital repository of the ASCR Nonlinear Conjugate Gradient Methods

Modifications of nonlinear conjugate gradient method are described and tested.

Lukšan, Ladislav; Vlček, Jan
Ústav informatiky, 2015

A Modified Limited-Memory BNS Method for Unconstrained Minimization Derived from the Conjugate Directions Idea
Vlček, Jan; Lukšan, Ladislav
2015 - English A modification of the limited-memory variable metric BNS method for large scale unconstrained optimization of the differentiable function $f:{\cal R}^N\to\cal R$ is considered, which consists in corrections (based on the idea of conjugate directions) of difference vectors for better satisfaction of the previous quasi-Newton conditions. In comparison with [11], more previous iterations can be utilized here. For quadratic objective functions, the improvement of convergence is the best one in some sense, all stored corrected difference vectors are conjugate and the quasi-Newton conditions with these vectors are satisfied. The algorithm is globally convergent for convex sufficiently smooth functions and our numerical experiments indicate its efficiency. Keywords: large scale unconstrained optimization; numerical experiments; limited-memory variable metric method; BNS method; quasi-Newton method; convergence Available in digital repository of the ASCR A Modified Limited-Memory BNS Method for Unconstrained Minimization Derived from the Conjugate Directions Idea

A modification of the limited-memory variable metric BNS method for large scale unconstrained optimization of the differentiable function $f:{\cal R}^N\to\cal R$ is considered, which consists in ...

Vlček, Jan; Lukšan, Ladislav
Ústav informatiky, 2015

On Two Methods for the Parameter Estimation Problem with Spatio-Temporal FRAP Data
Papáček, Š.; Jablonský, J.; Matonoha, Ctirad
2015 - English FRAP (Fluorescence Recovery After Photobleaching) is a measurement technique for determination of the mobility of fluorescent molecules (presumably due to the diffusion process) within the living cells. While the experimental setup and protocol are usually fixed, the method used for the model parameter estimation, i.e. the data processing step, is not well established. In order to enhance the quantitative analysis of experimental (noisy) FRAP data, we firstly formulate the inverse problem of model parameter estimation and then we focus on how the different methods of data pre- processing influence the confidence interval of the estimated parameters, namely the diffusion constant $p$. Finally, we present a preliminary study of two methods for the computation of a least-squares estimate $\hat{p}$ and its confidence interval. Keywords: parameter estimation; fluorescence recovery after photobleaching; diffusion equation; Moullineaux method; Fisher information matrix; sensitivity analysis; confidence intervals; uncertainty quantification Available in digital repository of the ASCR On Two Methods for the Parameter Estimation Problem with Spatio-Temporal FRAP Data

FRAP (Fluorescence Recovery After Photobleaching) is a measurement technique for determination of the mobility of fluorescent molecules (presumably due to the diffusion process) within the living ...

Papáček, Š.; Jablonský, J.; Matonoha, Ctirad
Ústav informatiky, 2015

Measures for Classification Results Evaluation
Řezanková, Hana; Húsek, Dušan
2015 - English Keywords: similarity measures; measures of agreement; success rate of classification Available in a digital repository NRGL Measures for Classification Results Evaluation

Řezanková, Hana; Húsek, Dušan
Ústav informatiky, 2015

Causation Entropy Principle and Bayesian Inference to Causal Networks
Coufal, David; Hlinka, Jaroslav
2015 - English Keywords: causal links; causation entropy; Bayesian inference Available in a digital repository NRGL Causation Entropy Principle and Bayesian Inference to Causal Networks

Coufal, David; Hlinka, Jaroslav
Ústav informatiky, 2015

IINC Software
Jiřina, Marcel
2015 - English Keywords: Multidimensional data; Classifier; Distance; Metrics; Hassanat metrics; k-NN; IINC Available in a digital repository NRGL IINC Software

Jiřina, Marcel
Ústav informatiky, 2015

Probabilistic learning model PAC - lecture notes
Hakl, František
2015 - English Keywords: supervised learning; PAC model; Vapnik-Chervonenkis dimension; learning algorithms Available in a digital repository NRGL Probabilistic learning model PAC - lecture notes

Hakl, František
Ústav informatiky, 2015