Confidence intervals,significance values,maximum likelihood estimates,etc. sharpened into Occam’s razors

Abstract

Confidence sets, p values, maximum likelihood estimates, and other results of non-Bayesian statistical methods may be adjusted to favor sampling distributions that are simple compared to others in the parametric family. The adjustments are derived from a prior likelihood function previously used to adjust posterior distributions.     

A Numerical Solution to the Nonhomogeneous Two-Stage MVK Model of Cancer

In this article, we describe a straightforward method for solving the probability of at least one malignant cell by time t, and the associated hazard function, in the general (i.e., nonhomogeneous) two-stage Moolgavkar-Venzon-Knudson (MVK) model of cancer. The method consists of solving four coupled ordinary differential equations derived from the Kolmogorov backward equations for this process. The relationship of this method to previously proposed solutions is discussed.     

Goodness—of—fit for the two—parameter weibull distribution with estimated parameters

Goodness—of—fit statistics based on the empirical distribution function (EDF) are not distribution—free when parameters for the hypothesized distribution are estimated. Tables are percentile values of several EDF statistics are available for the two—parameter Weibull distribution when parameters are estimated by maximum likelihood. To determine how these tabled values change when simpler estimators are employed, percentile scores for EDF goodness—of—fit tests were obtained by Monte—Carlo simulation for maximum likelihood estimators (MLEs), good linear unbiased estimators (GLUEs), and modified Cramer—von Mises, Anderson—Darling, and Watson statistics are presented for GLUEs for both complete and censored samples. Critical values for Kolmogorov—Smirnov statistics were less affected by the method of estimation than were closer for MLEs and MGLUEs than for MGLUEs and GLUEs. On the other hand, MGLUE and GLUE results were much more similar to each other than to the MLE results when censoring was light and sample sizes were large.     

Closed-form likelihood estimation for one type of affine point processes

ABSTRACT

This paper presents a closed-form likelihood approximation for one type of affine point processes widely used in financial credit risk models. We proceed by first conjecturing the concrete series form of the transition density, verifying our postulation and then establishing the related coefficients by means of Kolmogorov equations. The asymptotic properties of the maximum-likelihood estimators (MLEs) are given in the end.     

An omnibus two-sample test for ranked-set sampling data

We develop an omnibus two-sample test for ranked-set sampling (RSS) data. The test statistic is the conditional probability of seeing the observed sequence of ranks in the combined sample, given the observed sequences within the separate samples. We compare the test to existing tests under perfect rankings, finding that it can outperform existing tests in terms of power, particularly when the set size is large. The test does not maintain its level under imperfect rankings. However, one can create a permutation version of the test that is comparable in power to the basic test under perfect rankings and also maintains its level under imperfect rankings. Both tests extend naturally to judgment post-stratification, unbalanced RSS, and even RSS with multiple set sizes. Interestingly, the tests have no simple random sampling analog.     

A comparison study of computational methods of Kolmogorov–Smirnov statistic in credit scoring

Kolmogorov–Smirnov statistic (KS) is a standard measure in credit scoring. Currently, there are three computational methods of KS: method with equal-width binning, method with equal-size binning and method without binning. This paper compares the three methods in three aspects: Values, Rank Ordering of Scores and Geometrical Way. The computational results on the German Credit Data show that only the method without binning can produce a unique value of KS. It is further proved analytically that the method without binning yields the maximum value of KS among the three methods. The computational results also show that only the method with equal-size binning can be used to evaluate rank ordering of scores. Moreover, it is proved that all the three methods can be used to calculate KS in a geometric way.     

Bootstrap confidence bands for the CDF using ranked-set sampling

In ranked-set sampling (RSS), a stratification by ranks is used to obtain a sample that tends to be more informative than a simple random sample of the same size. Previous work has shown that if the rankings are perfect, then one can use RSS to obtain Kolmogorov–Smirnov type confidence bands for the CDF that are narrower than those obtained under simple random sampling. Here we develop Kolmogorov–Smirnov type confidence bands that work well whether the rankings are perfect or not. These confidence bands are obtained by using a smoothed bootstrap procedure that takes advantage of special features of RSS. We show through a simulation study that the coverage probabilities are close to nominal even for samples with just two or three observations. A new algorithm allows us to avoid the bootstrap simulation step when sample sizes are relatively small.     

The Folded Logistic Distribution

ABSTRACT

Physical measurements like dimensions, including time, and angles in scientific experiments are frequently recorded without their algebraic sign. The directions of those physical quantities measured with respect to a frame of reference in most practical applications are considered to be unimportant and are ignored. As a consequence, the underlying distribution of measurements is replaced by a distribution of absolute measurements. When the underlying distribution is logistic, the resulting distribution is called the “folded logistic distribution”. Here, the properties of the folded logistic distribution will be presented and the techniques for estimating parameters will be given. The advantages of using this folded logistic distribution over the folded normal distribution will be discussed and some examples will be cited.     

On the trimmed mean and minimax-variance L-estimation in Kolmogorov neighbourhoods

We consider the properties of the trimmed mean, as regards minimax-variance L-estimation of a location parameter in a Kolmogorov neighbourhood K() of the normal distribution: We first review some results on the search for an L-minimax estimator in this neighbourhood, i.e. a linear combination of order statistics whose maximum variance in K_t() is a minimum in the class of L-estimators. The natural candidate – the L-estimate which is efficient for that member of K_t,() with minimum Fisher information – is known not to be a saddlepoint solution to the minimax problem. We show here that it is not a solution at all. We do this by showing that a smaller maximum variance is attained by an appropriately trimmed mean. We argue that this trimmed mean, as well as being computationally simple – much simpler than the efficient L-estimate referred to above, and simpler than the minimax M- and R-estimators – is at least “nearly” minimax.     

An Empirical Analysis of Some Nonparametric Goodness-of-Fit Tests for Censored Data

In this article, we consider some nonparametric goodness-of-fit tests for right censored samples, viz., the modified Kolmogorov, Cramer–von Mises–Smirnov, Anderson–Darling, and Nikulin–Rao–Robson χ² tests. We also consider an approach based on a transformation of the original censored sample to a complete one and the subsequent application of classical goodness-of-fit tests to the pseudo-complete sample. We then compare these tests in terms of power in the case of Type II censored data along with the power of the Neyman–Pearson test, and draw some conclusions. Finally, we present an illustrative example.