Displaying 481 – 500 of 838

Showing per page

On improving sensitivity of the Kalman filter

Petr Franěk (2002)

Kybernetika

The impact of additive outliers on a performance of the Kalman filter is discussed and less outlier-sensitive modification of the Kalman filter is proposed. The improved filter is then used to obtain an improved smoothing algorithm and an improved state-space model parameters estimation.

On interpolation in periodic autoregressive processes

Jiří Anděl, Asunción Rubio (1986)

Aplikace matematiky

The periodic autoregressive processes are useful in statistical analysis of seasonal time series. Some procedures (e.g. extrapolation) are quite analogous to those in the clasical autoregressive models. The problem of interpolation needs, however, some special methods. They are demonstrated in the paper on the case of the process of the second order with the period of length 2.

On invariant density estimation for ergodic diffusion processes.

Yuri A. Kutoyants (2004)

SORT

We present a review of several results concerning invariant density estimation by observations of ergodic diffusion process and some related problems. In every problem we propose a lower minimax bound on the risks of all estimators and then we construct an asymptotically efficient estimator.

On invertibility of a random coefficient moving average model

Tomáš Marek (2005)

Kybernetika

A linear moving average model with random coefficients (RCMA) is proposed as more general alternative to usual linear MA models. The basic properties of this model are obtained. Although some model properties are similar to linear case the RCMA model class is too general to find general invertibility conditions. The invertibility of some special examples of RCMA(1) model are investigated in this paper.

On minimax sequential procedures for exponential families of stochastic processes

Ryszard Magiera (1998)

Applicationes Mathematicae

The problem of finding minimax sequential estimation procedures for stochastic processes is considered. It is assumed that in addition to the loss associated with the error of estimation a cost of observing the process is incurred. A class of minimax sequential procedures is derived explicitly for a one-parameter exponential family of stochastic processes. The minimax sequential procedures are presented in some special models, in particular, for estimating a parameter of exponential families of...

On multiple periodic autoregression

Jiří Anděl (1987)

Aplikace matematiky

The model of periodic autoregression is generalized to the multivariate case. The autoregressive matrices are periodic functions of time. The mean value of the process can be a non-vanishing periodic sequence of vectors. Estimators of parameters and tests of statistical hypotheses are based on the Bayes approach. Two main versions of the model are investigated, one with constant variance matrices and the other with periodic variance matrices of the innovation process.

On periodic autoregression with unknown mean

Jiří Anděl, Asunción Rubio, Antonio Insua (1985)

Aplikace matematiky

If the parameters of an autoregressive model are periodic functions we get a periodic autoregression. In the paper the case is investigated when the expectation can also be a periodic function. The innovations have either constant or periodically changing variances.

On random processes as an implicit solution of equations

Petr Lachout (2017)

Kybernetika

Random processes with convenient properties are often employed to model observed data, particularly, coming from economy and finance. We will focus our interest in random processes given implicitly as a solution of a functional equation. For example, random processes AR, ARMA, ARCH, GARCH are belonging in this wide class. Their common feature can be expressed by requirement that stated random process together with incoming innovations must fulfill a functional equation. Functional dependence is...

On selecting the best features in a noisy environment

Jan Flusser, Tomáš Suk (1998)

Kybernetika

This paper introduces a novel method for selecting a feature subset yielding an optimal trade-off between class separability and feature space dimensionality. We assume the following feature properties: (a) the features are ordered into a sequence, (b) robustness of the features decreases with an increasing order and (c) higher-order features supply more detailed information about the objects. We present a general algorithm how to find under those assumptions the optimal feature subset. Its performance...

Currently displaying 481 – 500 of 838