Distribution-free confidence intervals for quantiles and tolerance intervals in terms of k-records

In this paper, we consider the problem of determining non-parametric confidence intervals for quantiles when available data are in the form of k-records. Distribution-free confidence intervals as well as lower and upper confidence limits are derived for fixed quantiles of an arbitrary unknown distribution based on k-records of an independent and identically distributed sequence from that distribution. The construction of tolerance intervals and limits based on k-records is also discussed. An exact expression for the confidence coefficient of these intervals are derived. Some tables are also provided to assist in choosing the appropriate k-records for the construction of these confidence intervals and tolerance intervals. Some simulation results are presented to point out some of the features and properties of these intervals. Finally, the data, representing the records of the amount of annual rainfall in inches recorded at Los Angeles Civic Center, are used to illustrate all the results developed in this paper and also to demonstrate the improvements that they provide on those based on either the usual records or the current records.     

Simultaneous Closeness of k-Records

In this article, we study the simultaneous Pitman closeness of upper (and lower) k-records to a common parameter of the parent distribution and obtain general expressions for the corresponding probabilities. Since the usual record values are contained in the k-records, the corresponding results for the usual records can be deduced as special cases. The results are then applied to location-scale families with an emphasis on population quantiles. Exact expressions are derived for some common distributions such as exponential and uniform. In each case, the simultaneous closest k-record to a population quantile is determined.     

On characterization results based on the number of observations near the k-records

In this paper, using the completeness properties of the sequence of functions {h_n(x)=(?log x)ⁿ, 0<x<1, n≥1}, some characterization results are established. The results are based on the number of observations near the k-records. It is shown that the equality of the moment of the appropriate subsequence of the number of observations near to upper and lower k-records is a characteristic property of symmetric distributions. Since ordinary record values are contained in the k-records, the results hold for usual records as a particular case.     

The Distribution of the Record Position and its Applications

This is mainly an expository article on the positions of records in sequences of ordered elements. Such sequences are obtained, for example, when observing and ordering continuous iid random variables. In practice, records are of interest, for example, in meteorology and sports. A k-record is obtained when a new element is placed at position k counted from the top. The sequences of time points, when new k-records occur, are studied by elementary random walk methods. In the last section, it is shown that the time scale can be changed so that the time points of the k-records follow, approximately, a Poisson process.     

Some results on conditional expectations of lower record values

In this paper, we propose a measure for obtaining the expectation of time between two lower k-records under the condition that the greater one is given. Several properties of the proposed measure are derived. Some characterization results and stochastic comparisons based on the new measure are also provided.     

Fisher information in generalized order statistics

A representation of the Fisher information in generalized order statistics in terms of the hazard rate of the underlying distribution function is derived under mild regularity conditions. This expression supplements results for complete, Type-II censored, and progressively Type-II censored data. As a byproduct, we find a hazard rate based representation for samples of k-records which apparently has not been known so far. Moreover, sufficient conditions for the validity of this representation in location and scale family settings are given. The result is illustrated by considering generalized order statistics based on logistic, Laplace, and extreme value distributions.     

Prediction intervals for generalized-order statistics with random sample size

The problem of predicting future generalized-order statistics, by assuming the future sample size is a random variable, is discussed. A general expression for the coverage probability of the prediction intervals is derived. Since k-records and progressively type-II censored-order statistics are contained in the model of generalized-order statistics, the corresponding results for them can be deduced as special cases. When the future sample size has degenerate, binomial, Poisson and geometric distributions, numerical computations are given. The procedure for finding an optimal prediction interval is presented for each case. Finally, we apply our results to a real data set in life testing given in Lee and Wang [Statistical methods for survival data analysis. Hoboken, NJ: John Wiley and Sons; 2003, p. 58, Table 3.4] for illustrative the proposed procedure in this paper.     

RECURRENCE RELATIONS FOR SINGLE AND PRODUCT MOMENTS OF GENERALIZED ORDER STATISTICS FROM PARETO,GENERALIZED PARETO,AND BURR DISTRIBUTIONS

We give recurrence relations for single and product moments of generalized order statistics under the concept of Kamps from Pareto, generalized Pareto and Burr distributions. The results include as particular cases the above relations for moments of k–th record values.     

Bonferroni-type Plug-in Procedure Controlling Generalized Familywise Error Rate

Consider the multiple hypotheses testing problem controlling the generalized familywise error rate k-FWER, the probability of at least k false rejections. We propose a plug-in procedure based on the estimation of the number of true null hypotheses. Under the independence assumption of the p-values corresponding to the true null hypotheses, we first introduce the least favorable configuration (LFC) of k-FWER for Bonferroni-type plug-in procedure, then we construct a plug-in k-FWER-controlled procedure based on LFC. For dependent p-values, we establish the asymptotic k-FWER control under some mild conditions. Simulation studies suggest great improvement over generalized Bonferroni test and generalized Holm test.     

A permutation test approach to the choice of size k for the nearest neighbors classifier

The k nearest neighbors (k-NN) classifier is one of the most popular methods for statistical pattern recognition and machine learning. In practice, the size k, the number of neighbors used for classification, is usually arbitrarily set to one or some other small numbers, or based on the cross-validation procedure. In this study, we propose a novel alternative approach to decide the size k. Based on a k-NN-based multivariate multi-sample test, we assign each k a permutation test based Z-score. The number of NN is set to the k with the highest Z-score. This approach is computationally efficient since we have derived the formulas for the mean and variance of the test statistic under permutation distribution for multiple sample groups. Several simulation and real-world data sets are analyzed to investigate the performance of our approach. The usefulness of our approach is demonstrated through the evaluation of prediction accuracies using Z-score as a criterion to select the size k. We also compare our approach to the widely used cross-validation approaches. The results show that the size k selected by our approach yields high prediction accuracies when informative features are used for classification, whereas the cross-validation approach may fail in some cases.     

The Generalized Pascal Triangle and the Matrix Variate Jensen-Logistic Distribution

This article defines the so called Generalized Matrix Variate Jensen-Logistic distribution. The relevant applications of this class of distributions in Configuration Shape Theory consist of a more efficient computation, supported by the corresponding inference. This demands the solution of two important problems: (1) the development of analytical and efficient formulae for their k-th derivatives and (2) the use of the derivatives to transform the configuration density into a polynomial density under some special matrix Kummer relation, indexed in this case by the Jensen-Logistic kernel. In this article, we solve these problems by deriving a simple formula for the k-th derivative of the density function, avoiding the usual partition theory framework and using a generalization of Pascal triangles. Then we apply the results by obtaining the associated Jensen-Logistic Kummer relations and the configuration polynomial density in the setting of Statistical Shape Theory.     

Asymptotic tail behavior of a random sum with conditionally dependent subexponential summands

In this paper, we obtain some results for the asymptotic behavior of the tail probability of a random sum S_τ = ∑^τ_{k = 1}X_k, where the summands X_k, k = 1, 2, …, are conditionally dependent random variables with a common subexponential distribution F, and the random number τ is a non negative integer-valued random variable, independent of {X_k: k ? 1}.     

Testing concerning the homogeneity of some predator–prey populations

In this paper, we study an inference problem for a stochastic model where k deterministic Lotka–Volterra systems of ordinary differential equations (ODEs) are perturbed with k pairs of random errors. The k deterministic systems describe the ecological interaction between k predator–prey populations. These k deterministic systems depend on unknown parameters. We consider the testing problem concerning the homogeneity between k pairs of the interaction parameters of the ODEs. We assume that the k pairs of random errors are independent and that, each pair follows correlated Ornstein–Uhlenbeck processes. Thus, we extend the stochastic model suggested in Froda and Colavita [2005. Estimating predator–prey systems via ordinary differential equations with closed orbits. Aust. N.Z. J. Stat. 2, 235–254] as well as in Froda and Nkurunziza [2007. Prediction of predator–prey populations modeled by perturbed ODE. J. Math. Biol. 54, 407–451] where k=1. Under this statistical model, we propose a likelihood ratio test and study the asymptotic properties of this test. Finally, we highlight the performance of our method through some simulations studies.     

Uniform consistency rate of kNN regression estimation for functional time series data

In this paper, we investigate the k-nearest neighbours (kNN) estimation of nonparametric regression model for strong mixing functional time series data. More precisely, we establish the uniform almost complete convergence rate of the kNN estimator under some mild conditions. Furthermore, a simulation study and an empirical application to the real data analysis of sea surface temperature (SST) are carried out to illustrate the finite sample performances and the usefulness of the kNN approach.     

Consistency of stochastic approximation algorithm with quasi-associated random errors

ABSTRACT

Many mathematical and physical problems are led to find a root of a real function f. This kind of equation is an inverse problem and it is difficult to solve it. Especially in engineering sciences, the analytical expression of the function f is unknown to the experimenter, but it can be measured at each point x_k with M(x_k) as expected value and induced error ξ_k. The aim is to approximate the unique root θ under some assumptions on the function f and errors ξ_k. We use a stochastic approximation algorithm that constructs a sequence (x_k)_{k ? 1}. We establish the almost complete convergence of the sequence (x_k)_k to the exact root θ by considering the errors (ξ_k)_k quasi-associated and we illustrate the method by numerical examples to show its efficiency.     

Testing symmetry based on empirical likelihood

In this paper, we propose a general kth correlation coefficient between the density function and distribution function of a continuous variable as a measure of symmetry and asymmetry. We first propose a root-n moment-based estimator of the kth correlation coefficient and present its asymptotic results. Next, we consider statistical inference of the kth correlation coefficient by using the empirical likelihood (EL) method. The EL statistic is shown to be asymptotically a standard chi-squared distribution. Last, we propose a residual-based estimator of the kth correlation coefficient for a parametric regression model to test whether the density function of the true model error is symmetric or not. We present the asymptotic results of the residual-based kth correlation coefficient estimator and also construct its EL-based confidence intervals. Simulation studies are conducted to examine the performance of the proposed estimators, and we also use our proposed estimators to analyze the air quality dataset.     

Defective Galton–Watson processes

The Galton–Watson process is a Markov chain modeling the population size of independently reproducing particles giving birth to k offspring with probability p_k, k ? 0. In this paper, we consider defective Galton–Watson processes having defective reproduction laws, so that ∑_{k ? 0}p_k = 1 ? ? for some ? ∈ (0, 1). In this setting, each particle may send the process to a graveyard state Δ with probability ?. Such a Markov chain, having an enhanced state space {0, 1, …}∪{Δ}, gets eventually absorbed either at 0 or at Δ. Assuming that the process has avoided absorption until the observation time t, we are interested in its trajectories as t → ∞ and ? → 0.     

An optimal k of kth MA-ARIMA models under AR(p) models

In this article, we discuss finding the optimal k of (i) kth simple moving average, (ii) kth weighted moving average, and (iii) kth exponential weighted moving average based on simulated autoregressive AR(p) model. We run a simulation using the three above examining method under specific conditions. The main finding is that the optimal k = 4 and then k = 3. Especially, the fourth WMA ARIMA model, fourth EWMA ARIMA model, and third EWMA ARIMA model are the best forecasting models among others, respectively. For all the six real data reveal the similar results of simulation study.     

An optimal k of kth MA-ARIMA models under a class of ARIMA model

In this article, we discuss finding the optimal k of (i) kth simple moving average, (ii) kth weighted moving average, and (iii) kth exponential weighted moving average based on simulated ARIMA(p, d, q) model. We run a simulation using the three above examining methods under specific conditions. The main finding is that 5th exponential weighted moving average (5th EWMA) ARIMA model is the best forecasting model among others, which means the optimal k = 5. For Turkish Telecommunications (TTKOM) stock market, real data reveal the similar results of simulation study.     

Ideal bootstrap estimation of expected prediction error for k-nearest neighbor classifiers: Applications for classification and error assessment

Euclidean distance k-nearest neighbor (k-NN) classifiers are simple nonparametric classification rules. Bootstrap methods, widely used for estimating the expected prediction error of classification rules, are motivated by the objective of calculating the ideal bootstrap estimate of expected prediction error. In practice, bootstrap methods use Monte Carlo resampling to estimate the ideal bootstrap estimate because exact calculation is generally intractable. In this article, we present analytical formulae for exact calculation of the ideal bootstrap estimate of expected prediction error for k-NN classifiers and propose a new weighted k-NN classifier based on resampling ideas. The resampling-weighted k-NN classifier replaces the k-NN posterior probability estimates by their expectations under resampling and predicts an unclassified covariate as belonging to the group with the largest resampling expectation. A simulation study and an application involving remotely sensed data show that the resampling-weighted k-NN classifier compares favorably to unweighted and distance-weighted k-NN classifiers.