IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-46161-4_19.html
   My bibliography  Save this book chapter

Projection Test with Sparse Optimal Direction for High-Dimensional One Sample Mean Problem

In: Contemporary Experimental Design, Multivariate Analysis and Data Mining

Author

Listed:
  • Wanjun Liu

    (Pennsylvania State University, Department of Statistics)

  • Runze Li

    (Pennsylvania State University, Department of Statistics)

Abstract

Testing whether the mean vector from some population is zero or not is a fundamental problem in statistics. In the high-dimensional regime, where the dimension of data p is greater than the sample size n, traditional methods such as Hotelling’s $$T^2$$ test cannot be directly applied. One can project the high-dimensional vector onto a space of low dimension and then traditional methods can be applied. In this paper, we propose a projection test based on a new estimation of the optimal projection direction $$\varSigma ^{-1}\mu $$. Under the assumption that the optimal projection $$\varSigma ^{-1}\mu $$ is sparse, we use a regularized quadratic programming with nonconvex penalty and linear constraint to estimate it. Simulation studies and real data analysis are conducted to examine the finite sample performance of different tests in terms of type I error and power.

Suggested Citation

  • Wanjun Liu & Runze Li, 2020. "Projection Test with Sparse Optimal Direction for High-Dimensional One Sample Mean Problem," Springer Books, in: Jianqing Fan & Jianxin Pan (ed.), Contemporary Experimental Design, Multivariate Analysis and Data Mining, chapter 0, pages 295-309, Springer.
  • Handle: RePEc:spr:sprchp:978-3-030-46161-4_19
    DOI: 10.1007/978-3-030-46161-4_19
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-030-46161-4_19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.