降低列聯表維數之可行性探討

大體上來說,高維列聯表通常比較不容易分析,因此我們考慮將某柴暫不列入探討之因子的次數相加,以便降低列聯表的維數。但是降低列聯表維數的過程必需相當慎重,以確保合併的過程不致影響到所欲探討之因子間的相關性。本文就 "sun-to-zero" 及 "set-to-zero" 兩種不同的對數線性模式參數之限制式,分別探討簡易合併(collapsibility)、嚴格合併(strict collapsibility)及強固合併(strong collapsibility)之充要條件,並舉例說明及印證這些條件。 === A lower-dimensional con...

Full description

Bibliographic Details
Main Author: 賴芬秀
Language:中文
Published: 國立政治大學
Subjects:
Online Access:http://thesis.lib.nccu.edu.tw/cgi-bin/cdrfb3/gsweb.cgi?o=dstdcdr&i=sid=%22B2002002097%22.
id ndltd-CHENGCHI-B2002002097
record_format oai_dc
spelling ndltd-CHENGCHI-B20020020972013-01-07T19:22:23Z 降低列聯表維數之可行性探討 賴芬秀 簡易合併 嚴格合併 強固合併 Collapsibility Strict collapsibility Strong collapsibility Sum-to-zero constraints Set-to-zero constraints 大體上來說,高維列聯表通常比較不容易分析,因此我們考慮將某柴暫不列入探討之因子的次數相加,以便降低列聯表的維數。但是降低列聯表維數的過程必需相當慎重,以確保合併的過程不致影響到所欲探討之因子間的相關性。本文就 "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. 國立政治大學 http://thesis.lib.nccu.edu.tw/cgi-bin/cdrfb3/gsweb.cgi?o=dstdcdr&i=sid=%22B2002002097%22. text 中文 Copyright © nccu library on behalf of the copyright holders
collection NDLTD
language 中文
sources NDLTD
topic 簡易合併
嚴格合併
強固合併
Collapsibility
Strict collapsibility
Strong collapsibility
Sum-to-zero constraints
Set-to-zero constraints
spellingShingle 簡易合併
嚴格合併
強固合併
Collapsibility
Strict collapsibility
Strong collapsibility
Sum-to-zero constraints
Set-to-zero constraints
賴芬秀
降低列聯表維數之可行性探討
description 大體上來說,高維列聯表通常比較不容易分析,因此我們考慮將某柴暫不列入探討之因子的次數相加,以便降低列聯表的維數。但是降低列聯表維數的過程必需相當慎重,以確保合併的過程不致影響到所欲探討之因子間的相關性。本文就 "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.
author 賴芬秀
author_facet 賴芬秀
author_sort 賴芬秀
title 降低列聯表維數之可行性探討
title_short 降低列聯表維數之可行性探討
title_full 降低列聯表維數之可行性探討
title_fullStr 降低列聯表維數之可行性探討
title_full_unstemmed 降低列聯表維數之可行性探討
title_sort 降低列聯表維數之可行性探討
publisher 國立政治大學
url http://thesis.lib.nccu.edu.tw/cgi-bin/cdrfb3/gsweb.cgi?o=dstdcdr&i=sid=%22B2002002097%22.
work_keys_str_mv AT làifēnxiù jiàngdīlièliánbiǎowéishùzhīkěxíngxìngtàntǎo
_version_ 1716458082975875072