Exact average coverage probabilities and confidence coefficients of confidence intervals for discrete distributions

For a confidence interval (L(X),U(X)) of a parameter θ in one-parameter discrete distributions, the coverage probability is a variable function of θ. The confidence coefficient is the infimum of the coverage probabilities, inf  _θ P _θ (θ∈(L(X),U(X))). Since we do not know which point in the parameter space the infimum coverage probability occurs at, the exact confidence coefficients are unknown. Beside confidence coefficients, evaluation of a confidence intervals can be based on the average coverage probability. Usually, the exact average probability is also unknown and it was approximated by taking the mean of the coverage probabilities at some randomly chosen points in the parameter space. In this article, methodologies for computing the exact average coverage probabilities as well as the exact confidence coefficients of confidence intervals for one-parameter discrete distributions are proposed. With these methodologies, both exact values can be derived.     

De-aliasing effects using semifoldover techniques

Semifoldover designs, obtained by semifolding a regular two-level factorial design, have been discussed recently in the literature. In this article, with the use of indicator functions, we investigate various semifoldover designs that are obtained from a general two-level factorial design. We discuss when a main factor or a two-factor interaction can be de-aliased from their aliased two-factor interactions, and extend some of the existing results from regular designs to non-regular designs. Finally, we present some examples to illustrate the results developed here.     

Nonparametric estimation of the shape function in a Gamma process for degradation data

The author considers estimation under a Gamma process model for degradation data. The setting for degradation data is one in which n independent units, each with a Gamma process with a common shape function and scale parameter, are observed at several possibly different times. Covariates can be incorporated into the model by taking the scale parameter as a function of the covariates. The author proposes using the maximum pseudo‐likelihood method to estimate the unknown parameters. The method requires usage of the Pool Adjacent Violators Algorithm. Asymptotic properties, including consistency, convergence rate and asymptotic distribution, are established. Simulation studies are conducted to validate the method and its application is illustrated by using bridge beams data and carbon‐film resistors data. The Canadian Journal of Statistics 37: 102‐118; 2009 © 2009 Statistical Society of Canada     

中美石油安全水平对经济增长影响的对比研究——基于灰色关联分析

为科学地评价比较中美石油安全水平对经济增长的影响程度,文章采用主成分分析方法,选取采储比水平、储量接替率、消费弹性系数、原油价格波动系数、对外依存度和石油占一次能源消费比重等6个要素指标,构成一个新的石油安全指标评价体系,并利用灰色关联方法比较分析了不同时间段内中美两国的石油安全水平与经济增长之间的关联度,得出自21世纪以来,美国经济发展对石油安全水平的依赖程度要远大于中国的结论。     

Statistical inference for partially time-varying coefficient errors-in-variables models

This paper studies the partially time-varying coefficient models where some covariates are measured with additive errors. In order to overcome the bias of the usual profile least squares estimation when measurement errors are ignored, we propose a modified profile least squares estimator of the regression parameter and construct estimators of the nonlinear coefficient function and error variance. The proposed three estimators are proved to be asymptotically normal under mild conditions. In addition, we introduce the profile likelihood ratio test and then demonstrate that it follows an asymptotically χ²${\chi }^2$ distribution under the null hypothesis. Finite sample behavior of the estimators is investigated via simulations too.     

Modular-transform based clustering

Spectral clustering uses eigenvectors of the Laplacian of the similarity matrix. It is convenient to solve binary clustering problems. When applied to multi-way clustering, either the binary spectral clustering is recursively applied or an embedding to spectral space is done and some other methods, such as K-means clustering, are used to cluster the points. Here we propose and study a K-way clustering algorithm – spectral modular transformation, based on the fact that the graph Laplacian has an equivalent representation, which has a diagonal modular structure. The method first transforms the original similarity matrix into a new one, which is nearly disconnected and reveals a cluster structure clearly, then we apply linearized cluster assignment algorithm to split the clusters. In this way, we can find some samples for each cluster recursively using the divide and conquer method. To get the overall clustering results, we apply the cluster assignment obtained in the previous step as the initialization of multiplicative update method for spectral clustering. Examples show that our method outperforms spectral clustering using other initializations.     

A note on statistical method for genotype calling of high-throughput single-nucleotide polymorphism arrays

We study the genotype calling algorithms for the high-throughput single-nucleotide polymorphism (SNP) arrays. Building upon the novel SNP-robust multi-chip average preprocessing approach and the state-of-the-art corrected robust linear model with Mahalanobis distance (CRLMM) approach for genotype calling, we propose a simple modification to better model and combine the information across multiple SNPs with empirical Bayes modeling, which could often significantly improve the genotype calling of CRLMM. Through applications to the HapMap Trio data set and a non-HapMap test set of high quality SNP chips, we illustrate the competitive performance of the proposed method.     

网络舆论倾向性的动态跟踪方法及实证研究

从统计学视角审视网络舆论倾向性的监测问题,提出了以粗糙分类器为基础建立舆论倾向性分类模型,将复杂的预警指标体系简化为单一直观的跟踪统计量,并通过跟踪统计量动态跟踪舆论倾向性变化轨迹的研究方法。实证研究以2011年郭美美事件相关新闻跟帖为对象。分析表明,网络舆论的消极倾向性在整个事件发展过程中呈持续增长,与基本事实相符,证实了方法的可行性和适用性。