New approximate solutions per unit of time for periodically checked systems with different lifetime distributions.
We introduce new estimates and tests of independence in copula models with unknown margins using -divergences and the duality technique. The asymptotic laws of the estimates and the test statistics are established both when the parameter is an interior or a boundary value of the parameter space. Simulation results show that the choice of -divergence has good properties in terms of efficiency-robustness.
The paper gives an overview of feature selection techniques in statistical pattern recognition with particular emphasis on methods developed within the Institute of Information Theory and Automation research team throughout recent years. Besides discussing the advances in methodology since times of Perez’s pioneering work the paper attempts to put the methods into a taxonomical framework. The methods discussed include the latest variants of the optimal algorithms, enhanced sub-optimal techniques...
This paper deals with order identification for Markov chains with Markov regime (MCMR) in the context of finite alphabets. We define the joint order of a MCMR process in terms of the number k of states of the hidden Markov chain and the memory m of the conditional Markov chain. We study the properties of penalized maximum likelihood estimators for the unknown order (k, m) of an observed MCMR process, relying on information theoretic arguments. The novelty of our work relies in the joint...
We discuss two numerical approaches to linear minimax estimation in linear models under ellipsoidal parameter restrictions. The first attacks the problem directly, by minimizing the maximum risk among the estimators. The second method is based on the duality between minimax and Bayes estimation, and aims at finding a least favorable prior distribution.
We briefly discuss an abstract approximation framework and a convergence theory of parameter estimation for a general class of nonautonomous nonlinear evolution equations. A detailed discussion of the above theory has been given earlier by the authors in another paper. The application of this theory together with numerical results indicating the feasibility of this general least squares approach are presented in the context of quasilinear reaction diffusion equations.
An explicit formula for the correlation coefficient in a two-dimensional AR(1) process is derived. Approximate critical values for the correlation coefficient between two one-dimensional AR(1) processes are tabulated. They are based on Bartlett’s approximation and on an asymptotic distribution derived by McGregor. The results are compared with critical values obtained from a simulation study.
The paper gives some basic ideas of both the construction and investigation of the properties of the Bayesian estimates of certain parametric functions of the parent exponential distribution under the model of random censorship assuming the Koziol–Green model. Various prior distributions are investigated and the corresponding estimates are derived. The stress is put on the asymptotic properties of the estimates with the particular stress on the Bayesian risk. Small sample properties are studied...
An iterative procedure for computation of stationary density of autoregressive processes is proposed. On an example with exponentially distributed white noise it is demonstrated that the procedure converges geometrically fast. The AR(1) and AR(2) models are analyzed in detail.
We study the impact of certain transformations within the class of Archimedean copulas. We give some admissibility conditions for these transformations, and define some equivalence classes for both transformations and generators of Archimedean copulas. We extend the r-fold composition of the diagonal section of a copula, from r ∈ N to r ∈ R. This extension, coupled with results on equivalence classes, gives us new expressions of transformations and generators. Estimators deriving directly from these...
In this paper, we analyze the celebrated EM algorithm from the point of view of proximal point algorithms. More precisely, we study a new type of generalization of the EM procedure introduced in [Chretien and Hero (1998)] and called Kullback-proximal algorithms. The proximal framework allows us to prove new results concerning the cluster points. An essential contribution is a detailed analysis of the case where some cluster points lie on the boundary of the parameter space.
A method of estimation of intrinsic volume densities for stationary random closed sets in based on estimating volumes of tiny collars has been introduced in T. Mrkvička and J. Rataj, On estimation of intrinsic volume densities of stationary random closed sets, Stoch. Proc. Appl. 118 (2008), 2, 213-231. In this note, a stronger asymptotic consistency is proved in dimension 2. The implementation of the method is discussed in detail. An important step is the determination of dilation radii in the...
Logrank-type and Kolmogorov-type goodness-of-fit tests for the absence of memory model are proposed when the accelerated experiments are done under step-stresses. The power of the test against the approaching alternatives is investigated. The theoretical results are illustrated with simulated data.
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.
It is shown that a popular variable choice method of Hellwig, which is recommended in the Polish econometric textbooks does not enjoy a very basic consistency property. It means in particular that the method may lead to rejection of significant variables in econometric modeling. A simulation study and a real data analysis case are given to support theoretical results.
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...