The rank transformation as a method of discrimination with some examples

The procedure of statistical discrimination Is simple in theory but so simple in practice. An observation x₀possibly uiultivariate, is to be classified into one of several populations π₁,…,π_k which have respectively, the density functions f₁(x), ? ? ? , f_k(x). The decision procedure is to evaluate each density function at X₀ to see which function gives the largest value f_i(X₀) , and then to declare that X₀ belongs to the population corresponding to the largest value. If these den-sities can be assumed to be normal with equal covariance matricesthen the decision procedure is known as Fisher’s linear discrimi-nant function (LDF) method. In the case of unequal covariance matrices the procedure is called the quadratic discriminant func-tion (QDF) method. If the densities cannot be assumed to be nor-mal then the LDF and QDF might not perform well. Several different procedures have appeared in the literature which offer discriminant procedures for nonnormal data. However, these pro-cedures are generally difficult to use and are not readily available as canned statistical programs.

Another approach to discriminant analysis is to use some sortof mathematical trans format ion on the samples so that their distribution function is approximately normal, and then use the convenient LDF and QDF methods. One transformation that:applies to all distributions equally well is the rank transformation. The result of this transformation is that a very simple and easy to use procedure is made available. This procedure is quite robust as is evidenced by comparisons of the rank transform results with several published simulation studies.     

Exact factorization of the spectral density ann its application to wrf,castiilg and time series analysis

Let f be the spectral density function of a purely nondeterministic stationary stochastic process and be the optimal (canonical) fator of f. The role of the coefficients c_n and d_n (n ≥ 0) of φ and φ^?1 respectivey, in prediction, filtering and control theory is well-knwn. We show that the c_n's and d_n's can be obtained recursively in terms of the Fourier coefficients of log f. Also, recursive and updating formulae fr the kolmogorovwiener predictor similar to those Box-Jenkins are provided..     

Bayes least squares linear estimation of densities

Linear, least squares statistical methods in which the "parameters" are interpreted as random variables were introduced by Whittle, and further developed by Hartigan and others. They are applied here to the problem of estimating the coefficients in an orthogonal expansion of a multivariate density, given a simple random sample.     

An optimal variable cell histogram

A simple procedure for specifying a histogram with variable cell sizes is proposed. The procedure chooses a set of cutpoints that maximizes a criterion function based on the sample spacings:Under some conditions, this estimated set of cutpoints is shown to converge in probability to the theoretical set of cutpoints for the histogram estimate that minimizes the Hellingerdistance to the underlying density. An algorithm for finding the set of cutpoints that numerically maximizes the criterion function is presented along with an example. Performance for finite sample sizes is evaluated by simulations.     

Generalized weibull family: a structural analysis

A two shape parameter generalization of the well known family of the Weibull distributions is presented and its properties are studied. The properties examined include the skewness and kurtosis, density shapes and tail character, and relation of the members of the family to those of the Pear-sonian system. The members of the family are grouped in four classes in terms of these properties. Also studied are the extreme value distributions and the limiting distributions of the extreme spacings for the members of the family. It is seen that the generalized Weibull family contains distributions with a variety of density and tail shapes, and distributions which in terms of skewness and kurtosis approximate the main types of curves of the Pearson system. Furthermore, as shown by the extreme value and extreme spacings distributions the family contains short, medium and long tailed distributions. The quantile and density quantile functions are the principle tools used for the structural analysis of the family.     

The Estimation and Testing of the Cointegration Order Based on the Frequency Domain

ABSTRACT

This article proposes a method to estimate the degree of cointegration in bivariate series and suggests a test statistic for testing noncointegration based on the determinant of the spectral density matrix for the frequencies close to zero. In the study, series are assumed to be I(d), 0 < d ? 1, with parameter d supposed to be known. In this context, the order of integration of the error series is I(d ? b), b ∈ [0, d]. Besides, the determinant of the spectral density matrix for the dth difference series is a power function of b. The proposed estimator for b is obtained here performing a regression of logged determinant on a set of logged Fourier frequencies. Under the null hypothesis of noncointegration, the expressions for the bias and variance of the estimator were derived and its consistency property was also obtained. The asymptotic normality of the estimator, under Gaussian and non-Gaussian innovations, was also established. A Monte Carlo study was performed and showed that the suggested test possesses correct size and good power for moderate sample sizes, when compared with other proposals in the literature. An advantage of the method proposed here, over the standard methods, is that it allows to know the order of integration of the error series without estimating a regression equation. An application was conducted to exemplify the method in a real context.     

Kernel density estimators for random fields satisfying an interlaced mixing condition

For a sequence of strictly stationary random fields that are uniformly ρ′-mixing$\rho \prime \mathrm{-}\mathrm{mixing}$ and satisfy a Lindeberg condition, a central limit theorem is obtained for sequences of “rectangular” sums from the given random fields. The “Lindeberg CLT” is then used to prove a CLT for some kernel estimators of probability density for some strictly stationary random fields satisfying ρ′-mixing$\rho \prime \mathrm{-}\mathrm{mixing}$, and whose probability density and joint densities are absolutely continuous.