English  |  正體中文  |  简体中文  |  Items with full text/Total items : 68069/68069 (100%)
Visitors : 23145359      Online Users : 180
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/82285


    Title: 高維度電腦實驗設計:智能篩選與訊息擷取( I );High-Dimensional Computer Experiments: Intelligent Screening and Informative Sampling( I )
    Authors: 張明中
    Contributors: 國立中央大學統計研究所
    Keywords: 大數據;混沌多項式;因子篩選;空間填充;資訊子資料;Big data;Polynomial chaos;Factor screening;Space-filling;informative subdata
    Date: 2020-01-13
    Issue Date: 2020-01-13 14:36:43 (UTC+8)
    Publisher: 科技部
    Abstract: ``高維度''一詞充斥在許多新的研究領域。以往該詞意指變數個數遠大過資料量。近來由於科技進步,數據常有資料量遠大過變數個數的情況,因此高維度可泛指前述任一情境。本計畫致力在高維度電腦實驗下,發展高品質的因子篩選設計,與準確的估計參數/預測反應曲面的方法,完整的理論結構與快速運行的程式套件將是本計畫執行重點之一。在計畫的第一部分,我們將發展當p>>n時,可快速篩選出重要因子之方法論。此方法論預計可容易執行,且不須太耗費硬體資源。在計畫的第二部分,我們將探討當n>>p時,利用混沌多項式來估計電腦實驗的模型參數與預測反應曲面。除了完整的理論價構外,有效率的演算法也是發展重點。本計畫的成果預計可改善傳統方法的效能,並期對社會產業有所貢獻。 ;With technological advances, the terminology “high-dimensional” is much more commonly seen nowadays than a few decades ago. It used to refer to “the number of variables are much greater than the sample size” (i.e., p>>n). Recently, there has been an exponential growth in the size of datasets. Therefore, high-dimensional data may also refer to those whose data sizes are much greater than the numbers of variables (i.e., n>>p). This project aims at developing an efficient screening methodology and highly accurate estimation/prediction techniques for high-dimensional computer experiments. In the first part, we plan to develop a new methodology that can effectively identify active factors, with linear/nonlinear effects, for the case of p>>n. This methodology is expected to perform well and easily implemented with little computational burden. In the second part, we study subdata selection through polynomial chaos expansions when n>>p. The proposed methods would cover several common scenarios. Theoretical properties and efficient algorithms are to be provided. To the best of our knowledge, all relevant research to date, for either p>>n or n>>p, has yet to be fully satisfactory. This project tries to fulfill these gaps and devotes to the theory and application that can be easily applied to real-world situations.
    Relation: 財團法人國家實驗研究院科技政策研究與資訊中心
    Appears in Collections:[統計研究所] 研究計畫

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML49View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明