Displaying 101 – 120 of 160

Showing per page

Optimal estimator of hypothesis probability for data mining problems with small samples

Andrzej Piegat, Marek Landowski (2012)

International Journal of Applied Mathematics and Computer Science

The paper presents a new (to the best of the authors' knowledge) estimator of probability called the "Epₕ√2 completeness estimator" along with a theoretical derivation of its optimality. The estimator is especially suitable for a small number of sample items, which is the feature of many real problems characterized by data insufficiency. The control parameter of the estimator is not assumed in an a priori, subjective way, but was determined on the basis of an optimization criterion (the least absolute...

Optimized state estimation for nonlinear dynamical networks subject to fading measurements and stochastic coupling strength: An event-triggered communication mechanism

Chaoqing Jia, Jun Hu, Chongyang Lv, Yujing Shi (2020)

Kybernetika

This paper is concerned with the design of event-based state estimation algorithm for nonlinear complex networks with fading measurements and stochastic coupling strength. The event-based communication protocol is employed to save energy and enhance the network transmission efficiency, where the changeable event-triggered threshold is adopted to adjust the data transmission frequency. The phenomenon of fading measurements is described by a series of random variables obeying certain probability distribution....

Parameter estimation of sub-Gaussian stable distributions

Vadym Omelchenko (2014)

Kybernetika

In this paper, we present a parameter estimation method for sub-Gaussian stable distributions. Our algorithm has two phases: in the first phase, we calculate the average values of harmonic functions of observations and in the second phase, we conduct the main procedure of asymptotic maximum likelihood where those average values are used as inputs. This implies that the main procedure of our method does not depend on the sample size of observations. The main idea of our method lies in representing...

Particle filter with adaptive sample size

Ondřej Straka, Miroslav Šimandl (2011)

Kybernetika

The paper deals with the particle filter in state estimation of a discrete-time nonlinear non-Gaussian system. The goal of the paper is to design a sample size adaptation technique to guarantee a quality of a filtering estimate produced by the particle filter which is an approximation of the true filtering estimate. The quality is given by a difference between the approximate filtering estimate and the true filtering estimate. The estimate may be a point estimate or a probability density function...

Random projection RBF nets for multidimensional density estimation

Ewa Skubalska-Rafajłowicz (2008)

International Journal of Applied Mathematics and Computer Science

The dimensionality and the amount of data that need to be processed when intensive data streams are observed grow rapidly together with the development of sensors arrays, CCD and CMOS cameras and other devices. The aim of this paper is to propose an approach to dimensionality reduction as a first stage of training RBF nets. As a vehicle for presenting the ideas, the problem of estimating multivariate probability densities is chosen. The linear projection method is briefly surveyed. Using random...

Reduced-order Unscented Kalman Filtering with application to parameter identification in large-dimensional systems

Philippe Moireau, Dominique Chapelle (2011)

ESAIM: Control, Optimisation and Calculus of Variations

We propose a general reduced-order filtering strategy adapted to Unscented Kalman Filtering for any choice of sampling points distribution. This provides tractable filtering algorithms which can be used with large-dimensional systems when the uncertainty space is of reduced size, and these algorithms only invoke the original dynamical and observation operators, namely, they do not require tangent operator computations, which of course is of considerable benefit when nonlinear operators are considered....

Reduced-order Unscented Kalman Filtering with application to parameter identification in large-dimensional systems

Philippe Moireau, Dominique Chapelle (2011)

ESAIM: Control, Optimisation and Calculus of Variations

We propose a general reduced-order filtering strategy adapted to Unscented Kalman Filtering for any choice of sampling points distribution. This provides tractable filtering algorithms which can be used with large-dimensional systems when the uncertainty space is of reduced size, and these algorithms only invoke the original dynamical and observation operators, namely, they do not require tangent operator computations, which of course is of considerable benefit when nonlinear operators are considered....

Robust parameter design using the weighted metric method - The case of 'the smaller the better'

Mostafa Kamali Ardakani, Rassoul Noorossana, Seyed Taghi Akhavan Niaki, Homayoun Lahijanian (2009)

International Journal of Applied Mathematics and Computer Science

In process robustness studies, it is desirable to minimize the influence of noise factors on the system and simultaneously determine the levels of controllable factors optimizing the overall response or outcome. In the cases when a random effects model is applicable and a fixed effects model is assumed instead, an increase in the variance of the coefficient vector should be expected. In this paper, the impacts of this assumption on the results of the experiment in the context of robust parameter...

Currently displaying 101 – 120 of 160