MMCTest—A Safe Algorithm for Implementing Multiple Monte Carlo Tests

Consider testing multiple hypotheses using tests that can only be evaluated by simulation, such as permutation tests or bootstrap tests. This article introduces MMCTest , a sequential algorithm that gives, with arbitrarily high probability, the same classification as a specific multiple testing procedure applied to ideal p‐values. The method can be used with a class of multiple testing procedures that include the Benjamini and Hochberg false discovery rate procedure and the Bonferroni correction controlling the familywise error rate. One of the key features of the algorithm is that it stops sampling for all the hypotheses that can already be decided as being rejected or non‐rejected. MMCTest can be interrupted at any stage and then returns three sets of hypotheses: the rejected, the non‐rejected and the undecided hypotheses. A simulation study motivated by actual biological data shows that MMCTest is usable in practice and that, despite the additional guarantee, it can be computationally more efficient than other methods.     

On bootstrapping the number of components in finite mixtures of Poisson distributions

Finite mixture models arise in a natural way in that they are modeling unobserved population heterogeneity. It is assumed that the population consists of an unknown number k of subpopulations with parameters λ₁, ..., λ_k receiving weights p₁, ..., p_k. Because of the irregularity of the parameter space, the log-likelihood-ratio statistic (LRS) does not have a (χ²) limit distribution and therefore it is difficult to use the LRS to test for the number of components. These problems are circumvented by using the nonparametric bootstrap such that the mixture algorithm is applied B times to bootstrap samples obtained from the original sample with replacement. The number of components k is obtained as the mode of the bootstrap distribution of k. This approach is presented using the Times newspaper data and investigated in a simulation study for mixtures of Poisson data.     

A resampling procedure for nonparametric combination of several dependent tests

Summary This paper deals with nonparametric methods for combining dependent permutation or randomization tests. Particularly, they are nonparametric with respect to the underlying dependence structure. The methods are based on a without replacement resampling procedure (WRRP) conditional on the observed data, also called conditional simulation, which provide suitable estimates, as good as computing time permits, of the permutational distribution of any statistic. A class C of combining functions is characterized in such a way that all its members, under suitable and reasonable conditions, are found to be consistent and unbiased. Moreover, for some of its members, their almost sure asymptotic equivalence with respect to best tests, in particular cases, is shown. An applicational example to a multivariate permutationalt-paired test is also discussed.     

Recent trends and developments in computational multivariate analysis

Many traditional multivariate techniques such as ordination, clustering, classification and discriminant analysis are now routinely used in most fields of application. However, the past decade has seen considerable new developments, particularly in computational multivariate methodology. This article traces some of these developments and highlights those trends that may prove most fruitful for future practical implementation.     

Heteroscedasticity diagnostics in varying-coefficient partially linear regression models and applications in analyzing Boston housing data

It is important to detect the variance heterogeneity in regression model because efficient inference requires that heteroscedasticity is taken into consideration if it really exists. For the varying-coefficient partially linear regression models, however, the problem of detecting heteroscedasticity has received very little attention. In this paper, we present two classes of tests of heteroscedasticity for varying-coefficient partially linear regression models. The first test statistic is constructed based on the residuals, in which the error term is from a normal distribution. The second one is motivated by the idea that testing heteroscedasticity is equivalent to testing pseudo-residuals for a constant mean. Asymptotic normality is established with different rates corresponding to the null hypothesis of homoscedasticity and the alternative. Some Monte Carlo simulations are conducted to investigate the finite sample performance of the proposed tests. The test methodologies are illustrated with a real data set example.     

Inference for Quantiles of a Finite Population: Asymptotic versus Resampling Results

The aim of the paper is to study the problem of estimating the quantile function of a finite population. Attention is first focused on point estimation, and asymptotic results are obtained. Confidence intervals are then constructed, based on both the following: (i) asymptotic results and (ii) a resampling technique based on rescaling the ‘usual’ bootstrap. A simulation study to compare asymptotic and resampling‐based results, as well as an application to a real population, is finally performed.     

基于修剪平均的神经网络集成时序预测方法

由于复杂时序存在结构性断点和异常值等问题，往往导致预测模型训练效果不佳，并可能出现极端预测值的情况。为此，本文提出了基于修剪平均的神经网络集成预测方法。该方法首先从训练数据中生成多组训练集，然后分别训练多个神经网络预测模型，最后将多个神经网络的预测结果使用修剪平均策略进行集成。相较于简单平均策略而言，修剪平均策略不容易受到极值的影响，能够使集成模型获得鲁棒性强的预测效果。在实证研究中，本文构造了两种神经网络集成预测模型，分别为基于修剪平均的自举神经网络集成模型(Trimmed Average based Bootstrap Neural Network Ensemble, TA-BNNE)和基于修剪平均的蒙特卡洛神经网络集成模型(Trimmed Average based Monte Carlo Neural Network Ensemble, TA-MCNNE)，并采用这两种模型对NN3竞赛数据集进行预测，结果表明在常规和复杂数据集上，修剪平均策略比简单平均策略具有更好的预测精度。此外，本文将所提出的集成模型与NN3的前十名模型进行比较，发现两种模型在全部数据集上均超过了第6名，在复杂数据集上的表现均超过了第1名，进一步验证本文所提方法的有效性。     

A model selection criterion for clustered survival analysis with informative cluster size

We propose a model selection criterion for correlated survival data when the cluster size is informative to the outcome. This approach, called Resampling Cluster Survival Information Criterion (RCSIC), uses the Cox proportional hazards model that is weighted with the inverse of the cluster size. The RCSIC based on the within-cluster resampling idea takes into account the possible variability of the within-cluster subsampling and the possible informativeness of cluster sizes. The RCSIC allows for easy execution for the within-cluster resampling idea without a large number of resamples of the data. In contrast with the traditional model selection method in survival analysis, the RCSIC has an additional penalization for the within-cluster subsampling variability. Our simulations show the satisfactory results where the RCSIC provides a more robust power for variable selection in terms of clustered survival analysis, regardless of whether informative cluster size exists or not. Applying the RCSIC method to a periodontal disease studies, we identify the tooth loss in patients associated with the risk factors, Age, Filled Tooth, Molar, Crown, Decayed Tooth, and Smoking Status, respectively.     

Bootstrap Methods for Markov Processes

The block bootstrap is the best known bootstrap method for time‐series data when the analyst does not have a parametric model that reduces the data generation process to simple random sampling. However, the errors made by the block bootstrap converge to zero only slightly faster than those made by first‐order asymptotic approximations. This paper describes a bootstrap procedure for data that are generated by a Markov process or a process that can be approximated by a Markov process with sufficient accuracy. The procedure is based on estimating the Markov transition density nonparametrically. Bootstrap samples are obtained by sampling the process implied by the estimated transition density. Conditions are given under which the errors made by the Markov bootstrap converge to zero more rapidly than those made by the block bootstrap.