English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88657/118248 (75%)
Visitors : 23500739      Online Users : 213
RC Version 6.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
    政大機構典藏 > 商學院 > 統計學系 > 學位論文 >  Item 140.119/86502
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/86502

    Title: 降低列聯表維數之可行性探討
    Authors: 賴芬秀
    Contributors: 江振東
    Keywords: 簡易合併
    Strict collapsibility
    Strong collapsibility
    Sum-to-zero constraints
    Set-to-zero constraints
    Date: 1997
    Issue Date: 2016-04-27 11:24:17 (UTC+8)
    Abstract: 大體上來說,高維列聯表通常比較不容易分析,因此我們考慮將某柴暫不列入探討之因子的次數相加,以便降低列聯表的維數。但是降低列聯表維數的過程必需相當慎重,以確保合併的過程不致影響到所欲探討之因子間的相關性。本文就 "sun-to-zero" 及 "set-to-zero" 兩種不同的對數線性模式參數之限制式,分別探討簡易合併(collapsibility)、嚴格合併(strict collapsibility)及強固合併(strong collapsibility)之充要條件,並舉例說明及印證這些條件。
    A lower-dimensional contingency is usually easier to understand than a higher-dimensional one. Collapsing a larger table into a smaller one so that the associations among a set of factors can be easier to explain, however, should be exercised with care. In this study, definitions of collapsibility, strict collapsibility, and strong collapsibility are viewed. Distinctions among the three are compared. Necessary and sufficient condittions for these three types of collapsibility under conventional "set-to-zero" and "sum-to-zero" constraints are discussed and proved.
    Description: 碩士
    Source URI: http://thesis.lib.nccu.edu.tw/record/#B2002002097
    Data Type: thesis
    Appears in Collections:[統計學系] 學位論文

    Files in This Item:

    There are no files associated with this item.

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback