A New Method for Statistical Multidimensional Unfolding

ABSTRACT

Consider the problem of estimating the positions of a set of targets in a multidimensional Euclidean space from distances reported by a number of observers when the observers do not know their own positions in the space. Each observer reports the distance from the observer to each target plus a random error. This statistical problem is the basic model for the various forms of what is called multidimensional unfolding in the psychometric literature. Multidimensional unfolding methodology as developed in the field of cognitive psychology is basically a statistical estimation problem where the data structure is a set of measures that are monotonic functions of Euclidean distances between a number of observers and targets in a multidimensional space. The new method presented in this article deals with estimating the target locations and the observer positions when the observations are functions of the squared distances between observers and targets observed with an additive random error in a two-dimensional space. The method provides robust estimates of the target locations in a multidimensional space for the parametric structure of the data generating model presented in the article. The method also yields estimates of the orientation of the coordinate system and the mean and variances of the observer locations. The mean and the variances are not estimated by standard unfolding methods which yield targets maps that are invariant to a rotation of the coordinate system. The data is transformed so that the nonlinearity due to the squared observer locations is removed. The sampling properties of the estimates are derived from the asymptotic variances of the additive errors of a maximum likelihood factor analysis of the sample covariance matrix of the transformed data augmented with bootstrapping. The robustness of the new method is tested using artificial data. The method is applied to a 2001 survey data set from Turkey to provide a real data example.     

Bayesian inference and prediction of the Pareto distribution based on ordered ranked set sampling

In this paper, order statistics from independent and non identically distributed random variables is used to obtain ordered ranked set sampling (ORSS). Bayesian inference of unknown parameters under a squared error loss function of the Pareto distribution is determined. We compute the minimum posterior expected loss (the posterior risk) of the derived estimates and compare them with those based on the corresponding simple random sample (SRS) to assess the efficiency of the obtained estimates. Two-sample Bayesian prediction for future observations is introduced by using SRS and ORSS for one- and m-cycle. A simulation study and real data are applied to show the proposed results.     

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.     

Comparison of two sampling schemes for generating record-breaking data from the proportional hazard rate models

ABSTRACT

In this article, we consider a sampling scheme in record-breaking data set-up, as record ranked set sampling. We compare the proposed sampling with the well-known sampling scheme in record values known as inverse sampling scheme when the underlying distribution follows the proportional hazard rate model. Various point estimators are obtained in each sampling schemes and compared with respect to mean squared error and Pitman measure of closeness criteria. It is observed in most of the situations that the new sampling scheme provides more efficient estimators than their counterparts. Finally, one data set has been analyzed for illustrative purposes.     

E-Bayesian estimation and its E-MSE under the scaled squared error loss function,for exponential distribution as example

This paper is concerned with using the E-Bayesian method for computing estimates of exponential distribution. In order to measure the estimated error, based on the E-Bayesian estimation, we proposed the definition of E-MSE(expected mean square error). Moreover, the formulas of E-Bayesian estimation and formulas of E-MSE are given respectively, these estimations are derived based on a conjugate prior distribution for the unknown parameter under the scaled squared error loss function. The properties of E-MSE under different scaled parameters are also provided. Monte Carlo simulations are performed to compare the performances of the proposed methods of estimation and a real data set have been analysed for illustrative purposes. Results are compared on the basis of E-MSE.     

Another look at subset selection using linear least squares

The QR-factorization provides a set of orthogonal variables which has advantages over other orthogonal representations, such as principal components and the singular-value decomposition, in selecting subsets of regression variables by least squares methods. Stopping rules, in particular, are easily understood. A new stopping rule is derived for prediction. This is derived by approximately minimizing the mean squared error in estimating the squared error of prediction. A clear distinction is made between the kind of stopping rule which is relevant when the objective is prediction, and when the objective is asymptotic consistency. Progress with reducing the bias due to the model selection procedure is briefly summarized.     

Prediction Error of Small Area Predictors Shrinking Both Means and Variances

The article considers a new approach for small area estimation based on a joint modelling of mean and variances. Model parameters are estimated via expectation–maximization algorithm. The conditional mean squared error is used to evaluate the prediction error. Analytical expressions are obtained for the conditional mean squared error and its estimator. Our approximations are second‐order correct, an unwritten standardization in the small area literature. Simulation studies indicate that the proposed method outperforms the existing methods in terms of prediction errors and their estimated values.     

The Mean Squared Error of the Generalized Ridge Regression Estimator and the Orientation of β

Newhouse and Oman (1971) identified the orientations with respect to the eigenvectors of X'X of the true coefficient vector of the linear regression model for which the ordinary ridge regression estimator performs best and performs worse when mean squared error is the measure of performance. In this paper the corresponding result is derived for generalized ridge regression for two risk functions: mean squared error and mean squared error of prediction.     

Subsampling-extrapolation bandwidth selection in bivariate kernel density estimation

This paper focuses on bivariate kernel density estimation that bridges the gap between univariate and multivariate applications. We propose a subsampling-extrapolation bandwidth matrix selector that improves the reliability of the conventional cross-validation method. The proposed procedure combines a U-statistic expression of the mean integrated squared error and asymptotic theory, and can be used in both cases of diagonal bandwidth matrix and unconstrained bandwidth matrix. In the subsampling stage, one takes advantage of the reduced variability of estimating the bandwidth matrix at a smaller subsample size m (m < n); in the extrapolation stage, a simple linear extrapolation is used to remove the incurred bias. Simulation studies reveal that the proposed method reduces the variability of the cross-validation method by about 50% and achieves an expected integrated squared error that is up to 30% smaller than that of the benchmark cross-validation. It shows comparable or improved performance compared to other competitors across six distributions in terms of the expected integrated squared error. We prove that the components of the selected bivariate bandwidth matrix have an asymptotic multivariate normal distribution, and also present the relative rate of convergence of the proposed bandwidth selector.     

Choosing a robustness tuning parameter

A novel method is proposed for choosing the tuning parameter associated with a family of robust estimators. It consists of minimising estimated mean squared error, an approach that requires pilot estimation of model parameters. The method is explored for the family of minimum distance estimators proposed by [Basu, A., Harris, I.R., Hjort, N.L. and Jones, M.C., 1998, Robust and efficient estimation by minimising a density power divergence. Biometrika, 85, 549–559.] Our preference in that context is for a version of the method using the L ₂ distance estimator [Scott, D.W., 2001, Parametric statistical modeling by minimum integrated squared error. Technometrics, 43, 274–285.] as pilot estimator.     

Presmoothed Estimation with Left-Truncated and Right-Censored Data

We propose a new method to estimate the cumulative hazard function and the corresponding distribution function of survival times under randomly left-truncated and right-censored observations (LTRC). The new estimators are based on presmoothing ideas, the estimation of the conditional expectation m of the censoring indicator. An almost sure representation for both estimators is established, from which a strong consistency rate and asymptotic normality are derived. It is shown that the presmoothed modification leads to a gain in terms of asymptotic mean squared error. This efficiency with respect to the classical estimators is also shown in a simulation study. Finally, an application to a real data set is provided.     

Mem squared error estimation in finite populations under nonlinear models

Four estimators of the prediction mean squared error (MSB) of an estimated finite population total for a zero-one characteristic are examined. The characteristic associated with each population unit is modeled as the realization of a Bernoulli random variable whose expected value is a nonlinear function of a parameter vector and a set of known auxiliary variables. To compare the estimators, a simulation study is conducted using a population of hospitals. The MSB estimator Implied by the form of the assumed model underestimates the mean squared error in each of the cases studied and produces confidence lntervals with less than the nominal coverage probabilities. Of the three alternative MSE estimators presented, a linear approximation to the jackknife produces the best results and improves upon the model-specific estimator.     

第一HJ距离的理论分析

模型设定检验是资产定价的核心环节,作为模型误设的新指标,第一HJ距离受到学术界的广泛关注。然而,鲜有文献比较第一HJ距离和传统的误设测度的异同。本文系统地分析第一HJ距离的性质,并与传统的模型设定误差测度进行比较发现：（1）第一HJ距离将基于模型所用SDF的欧氏空间距离和最大定价误相联系,有丰富的经济含义;（2）第一HJ距离关注定价误差,相较于传统的模型误设测度,倾向于选择大的零Beta收益率和小的因子风险溢酬,对模型的排序有差异;（3）第一HJ距离的加权矩阵具有模型独立性和对测试资产组合选择的一致性。     

Automatic selection of a linear predictor through frequency domain cross-validation

Given data from a weakly stationary stochastic process in discrete time, and any L-step ahead linear predictor estimated from that data, we will construct an approximately unbiased estimator of the resulting mean squared error of L-step ahead linear prediction. The motivation for the estimator is based on frequency domain cross-validation, and hence the range of validity and applicability of the resulting selection method is not limited by particular assumptions about the structure of the underlying stochastic process or the form of the fitted linear predictors. We also propose a new frequency domain predictor fitting method. The method provides a natural finite-past analog to the existing spectral factorization techniques, and it compares favorably with the existing techniques, both asymptotically and for finite samples. In a Monte Carlo study, we compare several predictor selection methods, at lead times one and five. The performance criterion used is the mean squared prediction error of the selected predictor. The new selection methods work well, and a comparison of results for the two different lead times underscores the need for tailoring the selection criterion to suit the lead time.     

The Covariance Inflation Criterion for Adaptive Model Selection

We propose a new criterion for model selection in prediction problems. The covariance inflation criterion adjusts the training error by the average covariance of the predictions and responses, when the prediction rule is applied to permuted versions of the data set. This criterion can be applied to general prediction problems (e.g. regression or classification) and to general prediction rules (e.g. stepwise regression, tree-based models and neural nets). As a by-product we obtain a measure of the effective number of parameters used by an adaptive procedure. We relate the covariance inflation criterion to other model selection procedures and illustrate its use in some regression and classification problems. We also revisit the conditional bootstrap approach to model selection.     

Bayesian inference and prediction of the Rayleigh distribution based on ordered ranked set sampling

Based on ordered ranked set sample, Bayesian estimation of the model parameter as well as prediction of the unobserved data from Rayleigh distribution are studied. The Bayes estimates of the parameter involved are obtained using both squared error and asymmetric loss functions. The Bayesian prediction approach is considered for predicting the unobserved lifetimes based on a two-sample prediction problem. A real life dataset and simulation study are used to illustrate our procedures.     

A relationship between generalized and integrated mean square errors

Generalised Mean squared error is a flexible measure of the adequancy of ? repression estimator. It allows specific characteristics of the regression model and its intended use to be In-corportated in the measure itself. Similarly, integrated mean squared error enables a researcher to stipulate particular regions of interest and wi ighting functions in the assessment of a prediction equation. The appeal of both measures is their ability to allow design or model characteristics to directly influence the evaluation of fitted regression models. In this note an e-quivalence of the two measures is established for correctly specified models.     

Decomposition of Prediction Error in Multilevel Models

ABSTRACT

We present a decomposition of prediction error for the multilevel model in the context of predicting a future observable y _*j in the jth group of a hierarchical dataset. The multilevel prediction rule is used for prediction and the components of prediction error are estimated via a simulation study that spans the various combinations of level-1 (individual) and level-2 (group) sample sizes and different intraclass correlation values. Additionally, analytical results present the increase in predicted mean square error (PMSE) with respect to prediction error bias. The components of prediction error provide information with respect to the cost of parameter estimation versus data imputation for predicting future values in a hierarchical data set. Specifically, the cost of parameter estimation is very small compared to data imputation.     

A Note on the Predictors of Differenced Sequences

In this note we consider the problems of optimal linear prediction (o.l.p.) and the minimum mean squared error prediction (m.m.s.e.p.) of a sequence X_t, which fits to a stationary and invertible ARMA model through the filter (1 - B^s)^d X_t= Y_t. It is shown that these two predictors are not identical in general from the theoretical point of view. Permitting the degree of differencing d to take any real value, a set of conditions for these commonly applied prediction formulas to be identical is given.     

Theoretical evaluation of prediction error in linear regression with a bivariate response variable containing missing data

Methods for linear regression with multivariate response variables are well described in statistical literature. In this study we conduct a theoretical evaluation of the expected squared prediction error in bivariate linear regression where one of the response variables contains missing data. We make the assumption of known covariance structure for the error terms. On this basis, we evaluate three well-known estimators: standard ordinary least squares, generalized least squares, and a James–Stein inspired estimator. Theoretical risk functions are worked out for all three estimators to evaluate under which circumstances it is advantageous to take the error covariance structure into account.