We introduce the so-called naive tests and give a brief review of the new developments. Naive testing methods are easy to understand and perform robustly, especially when the dimension is large. We focus mainly on reviewing some naive testing methods for the mean vectors and covariance matrices of high-dimensional populations, and we believe that this naive testing approach can be used widely in many other testing problems.
The Random Projection was first proposed by @cite_40 and was further discussed in later studies @cite_39 @cite_34 @cite_18 @cite_41 . For Gaussian data, the procedure projects high-dimensional data onto random subspaces of relatively low-dimensional spaces to allow the traditional Hotelling @math statistic to work well. This method can be viewed as a two-step procedure. First, a single random projection is drawn, and it is then used to map the samples from the high-dimensional space to a low-dimensional space. Second, the Hotelling @math test is applied to a new hypothesis-testing problem in the projected space. A decision is then returned to the original problem by simply rejecting @math whenever the Hotelling test rejects it in the projected spaces.
@cite_18 @cite_41 @cite_39 @cite_40 @cite_34
2205780429 1499910526 1531259569 2089497633
A common problem in modern genetic research is that of comparing the mean vectors of two populations-typically in settings in which the data dimension is larger than the sample size-where Hotelling's test cannot be applied.Recently, a test using random subspaces was proposed, in which the data are randomly projected into several lower-dimensional subspaces, and Hotelling's test is well defined. Superior performance with competing tests was demonstrated when the variables were correlated.Following the research of random subspaces, a modified test was proposed that might make more efficient use of covariance structure at high dimension. Hierarchical clustering is performed first such that highly correlated variables are clustered together. Next, Hotelling's statistics are computed for every cluster-subspace and summed as the new test statistic. High performance was demonstrated via simulations and real data analysis. A two-sample test using hierarchical clustering was proposed.Hotelling's statistics are computed in cluster-subspaces and summed as the statistic.Highly correlated variables take priority for being processed.A cutoff distance is used to restrain the effect of statistical fluctuations.High performance was demonstrated in simulations and real data analysis. We discuss a one-sample location test that can be used in the case of highdimensional data. For high-dimensional data, the power of Hotelling’s test decreases when the dimension is close to the sample size. To address this loss of power, some non-exact approaches were proposed, e.g., Dempster (1958, 1960), Bai and Saranadasa (1996) and Srivastava and Du (2006). In this paper, we focus on Hotelling’s test and Dempster’s test. The comparative merits and demerits of these two tests vary according to the local parameters. In particular, we consider the situation where it is difficult to determine which test should be used, that is, where the two tests are asymptotically equivalent in terms of local power. We propose a new statistic based on the weighted averaging of Hotelling’s T 2 statistic and Dempster’s statistic that can be applied in such a situation. Our weight is determined on the basis of the maximum local asymptotic power on a restricted parameter space that induces local asymptotic equivalence between Hotelling’s test and Dempster’s test. In addition, some good asymptotic properties with respect to the local power are shown. Numerical results show that our test is more stable than Hotelling’s T 2 statistic and Dempster’s statistic in most parameter settings. Recent theoretical work has identified random projection as a promising dimensionality reduction technique for learning mixtures of Gaussians. Here we summarize these results and illustrate them by a wide variety of experiments on synthetic and real data. Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however, empirical results are sparse. We present experimental results on using random projection as a dimensionality reduction tool in a number of cases, where the high dimensionality of the data would otherwise lead to burden-some computations. Our application areas are the processing of both noisy and noiseless images, and information retrieval in text documents. We show that projecting the data onto a random lower-dimensional subspace yields results comparable to conventional dimensionality reduction methods such as principal component analysis: the similarity of data vectors is preserved well under random projection. However, using random projections is computationally significantly less expensive than using, e.g., principal component analysis. We also show experimentally that using a sparse random matrix gives additional computational savings in random projection.