On the fisher β-sufficient partition

This paper shows that the Fisher information in a partition of the space of a random variable X is less than or equal to the Fisher information of X about the unknown parameter. It also provides tables to construct β-sufficient partitions if X has an exponential distribution or a geometric distribution. Simulation study was conducted to show the advantage of using these tables over the usual methods used to construct histograms.     

Tail density estimation for exploratory data analysis using kernel methods

It is often critical to accurately model the upper tail behaviour of a random process. Nonparametric density estimation methods are commonly implemented as exploratory data analysis techniques for this purpose and can avoid model specification biases implied by using parametric estimators. In particular, kernel-based estimators place minimal assumptions on the data, and provide improved visualisation over scatterplots and histograms. However kernel density estimators can perform poorly when estimating tail behaviour above a threshold, and can over-emphasise bumps in the density for heavy tailed data. We develop a transformation kernel density estimator which is able to handle heavy tailed and bounded data, and is robust to threshold choice. We derive closed form expressions for its asymptotic bias and variance, which demonstrate its good performance in the tail region. Finite sample performance is illustrated in numerical studies, and in an expanded analysis of the performance of global climate models.     

Local likelihood density estimation for interval censored data

The authors propose a class of procedures for local likelihood estimation from data that are either interval‐censored or that have been aggregated into bins. One such procedure relies on an algorithm that generalizes existing self‐consistency algorithms by introducing kernel smoothing at each step of the iteration. The entire class of procedures yields estimates that are obtained as solutions of fixed point equations. By discretizing and applying numerical integration, the authors use fixed point theory to study convergence of algorithms for the class. Rapid convergence is effected by the implementation of a local EM algorithm as a global Newton iteration. The latter requires an explicit solution of the local likelihood equations which can be found by using the symbolic Newton‐Raphson algorithm, if necessary.     

Visual analysis of categorical time series

While at least some standard graphical tools do exist for cardinal time series analysis, little research effort has been given directed towards the visualization of categorical time series. The repertoire of such visual methods is nearly exclusively restricted to few isolated proposals from computer science and biology. This article aims at presenting a toolbox of known and newly developed approaches for analysing given categorical time series data visually. Among these tools, especially the rate evolution graph, the circle transformation, pattern histograms and control charts are promising.     

On derivaton and application of aic as a data-based criterion for histograms

In this paper a derivation of the Akaike's Information Criterion (AIC) is presented to select the number of bins of a histogram given only the data, showing that AIC strikes a balance between the “bias” and “variance” of the histogram estimate. Consistency of the criterion is discussed, an asymptotically optimal histogram bin width for the criterion is derived and its relationship to penalized likelihood methods is shown. A formula relating the optimal number of bins for a sample and a sub-sample obtained from it is derived. A number of numerical examples are presented.