THE CONVERGENCE RATE OF SEQUENTIAL FIXED-WIDTH CONFIDENCE INTERVALS FOR REGULAR FUNCTIONALS

Let X₁X₂,.be i.i.d. random variables and let U_n= (n r)^-1S?^(n,r) h (X_i1,., X_ir,) be a U-statistic with EU_n= v, v unknown. Assume that g(X₁) =E[h(X₁,.,X_r) - v |X₁]has a strictly positive variance s?². Further, let a be such that φ(a) - φ(-a) =α for fixed α, 0 < α < 1, where φ is the standard normal d.f., and let S²_n be the Jackknife estimator of n Var U_n. Consider the stopping times N(d)= min {n: S²_n: + n^-1≤²a^-2},d > 0, and a confidence interval for v of length 2d,of the form I_n,d= [U_n,-d, Un + d]. We assume that Var U_n is unknown, and hence, no fixed sample size method is available for finding a confidence interval for v of prescribed width 2d and prescribed coverage probability α Turning to a sequential procedure, let I_N(d),d be a sequence of sequential confidence intervals for v. The asymptotic consistency of this procedure, i.e. lim_{d → 0}P(v ∈ I_N(d),d)=α follows from Sproule (1969). In this paper, the rate at which |P(v ∈ I_N(d),d) converges to α is investigated. We obtain that |P(v ∈ I_N(d),d) - α| = 0 (d^{1/2-(1+k)/2(1+m)}), d → 0, where K = max {0,4 - m}, under the condition that E|h(X₁, X_r)|^m < ∞m > 2. This improves and extends recent results of Ghosh & DasGupta (1980) and Mukhopadhyay (1981).     

ROBUST COMPARISON OF DISPERSIONS FOR SAMPLES OF DIRECTIONAL DATA

Robust methods are proposed for testing whether several directional distributions on the unit p-sphere have comparable dispersions. The families of distributions considered are the Langevin for random vectors, and the Generalised Scheidegger-Watson for random axes, with specific interest in the Fisher and Watson distributions on the sphere. The methods are analogues of Levene's procedure for comparing variances of normal distributions.     

FITTING FINITE MIXTURE MODELS IN A REGRESSION CONTEXT

Suppose data are collected in a three-mode fashion (individuals x items X attributes), and it is sought to cluster the individuals into groups on the basis of lineat relations between scores on the attributes for each item and auxiliary measurements made on the same items. A mixture model is pro posed and the EM algorithm is used to fit it to the data by simultaneously estimating the group parameters and allocating individuals to groups. The method is illustrated by a simulation study and a real example in which consumers are clustered on the basis of product scores that are related to a sensory laboratory measurement.     

Complete designs with blocks of maximal multiplicity

The set of distinct blocks of a block design is known as its support. We construct complete designs with parameters v(?7), k=3, λ=v ? 2 which contain a block of maximal multiplicity and with support size $\text{b}{}^1\text{= (}{}^{\mathrm{v}}{}_3\text{) ? 4(v ? 2)}$. Any complete design which contains such a block, and has parameters v, k, λ as above, must be supported on at most (^v₃) ? 4(v ? 2) blocks. Attention is given to complete designs because of their direct relationship to simple random sampling.     

Length-Biassed Sampling from a Finite Population

Expressions are derived for the interval moments of a length-biassed sample from a renewal process of finite length.     

视频点击流数据挖掘在远程教育中的应用

Web数据挖掘已经成为数据挖掘技术一个重要的应用领域,文章主要通过对远程教育网站的视频点击流日志文件进行数据挖掘,寻求用户访问规律,构建动态的个性化教育网站.     

A case study in non-centering for data augmentation: Stochastic epidemics

In this paper, we introduce non-centered and partially non-centered MCMC algorithms for stochastic epidemic models. Centered algorithms previously considered in the literature perform adequately well for small data sets. However, due to the high dependence inherent in the models between the missing data and the parameters, the performance of the centered algorithms gets appreciably worse when larger data sets are considered. Therefore non-centered and partially non-centered algorithms are introduced and are shown to out perform the existing centered algorithms.     

Tree-structured subgroup analysis for censored survival data: Validation of computationally inexpensive model selection criteria

The performance of computationally inexpensive model selection criteria in the context of tree-structured subgroup analysis is investigated. It is shown through simulation that no single model selection criterion exhibits a uniformly superior performance over a wide range of scenarios. Therefore, a two-stage approach for model selection is proposed and shown to perform satisfactorily. Applied example of subgroup analysis is presented. Problems associated with tree-structured subgroup analysis are discussed and practical solutions are suggested.     

Random Weighted Bootstrap Method for Recurrent Events with Informative Censoring

Using the data from the AIDS Link to Intravenous Experiences cohort study as an example, an informative censoring model was used to characterize the repeated hospitalization process of a group of patients. Under the informative censoring assumption, the estimators of the baseline rate function and the regression parameters were shown to be related to a latent variable. Hence, it becomes impractical to directly estimate the unknown quantities in the moments of the estimators for the bandwidth selection of a smoothing estimator and the construction of confidence intervals, which are respectively based on the asymptotic mean squared errors and the asymptotic distributions of the estimators. To overcome these difficulties, we develop a random weighted bootstrap procedure to select appropriate bandwidths and to construct approximated confidence intervals. One can see that our method is simple and faster to implement from a practical point of view, and is at least as accurate as other bootstrap methods. In this article, it is shown that the proposed method is useful through the performance of a Monte Carlo simulation. An application of our procedure is also illustrated by a recurrent event sample of intravenous drug users for inpatient cares over time.     

Structural probability bounds for the strong Pareto law

By using the structural density function (Fraser 1979, Ch. 7) of the parameters of a Pareto distribution, the structural distribution function of the strong Pareto law is derived. Its fractiles have been evaluated numerically for special cases, and the results are displayed through graphs from which structural one-sided probability bounds may be found. It is shown that these graphs may also be used to find structural tolerance bounds for the Pareto distribution.