博碩士論文 107225005 完整後設資料紀錄

DC 欄位 語言
DC.contributor統計研究所zh_TW
DC.creator鄧麗華zh_TW
DC.creatorLi-Hua Dengen_US
dc.date.accessioned2020-7-15T07:39:07Z
dc.date.available2020-7-15T07:39:07Z
dc.date.issued2020
dc.identifier.urihttp://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=107225005
dc.contributor.department統計研究所zh_TW
DC.description國立中央大學zh_TW
DC.descriptionNational Central Universityen_US
dc.description.abstract生物醫學研究領域中,當新的藥物出現時,欲了解新的藥物與舊的藥物是否具有相同的治療效果或不同程度的不良影響,常會使用成對設計。若在多個疾病與成對設計下,則使用多重成對設計,但多重成對設計引入的相關性使模型配適變得困難。 本文提出利用強韌概似函數方法來來分析多重成對的二元資料。此強韌檢定法是將多個成對且獨立的伯努利概似函數強韌化,並得到強韌分數檢定統計量。本文利用模擬與實例分析比較強韌分數檢定、Lui and Chang (2013) 提出的修正華德 (Modified Wald) 檢定統計量及 Klingenberg and Agresti (2006) 提出的Multivariate extensions of McNemar’s test。zh_TW
dc.description.abstractIn medical research, when a new drug is proposed, in order to understand whether the new drug and placebo have the same treatment/adverse effects or different extent of adverse event, we use the matched-pair design. If the patient has multiple outcomes, we have the matched-pair design with multiple endpoints. The within-pair and between endpoints correlations make likelihood inference extremely difficult. In this thesis, we propose a robust likelihood approach to analyzing paired multiple binary endpoints data. We use simulation and real data analysis to demonstrate the merit of our new parametric robust technique. We also make comparison with to the Modified Wald’s test procedure proposed by Lui and Chang (2013) and the multivariate extensions of McNemar’s test statistic proposed by Klingenberg and Agresti (2006).en_US
DC.subject多重觀測值zh_TW
DC.subject成對設計zh_TW
DC.subject強韌分數檢定zh_TW
DC.subjectMultiple endpointsen_US
DC.subjectpaired designsen_US
DC.subjectrobust score testen_US
DC.title成對多重二項反應變數的強韌概似分析zh_TW
dc.language.isozh-TWzh-TW
DC.titleAnalysis of paired multiple binary endpoints data - a robust likelihood approachen_US
DC.type博碩士論文zh_TW
DC.typethesisen_US
DC.publisherNational Central Universityen_US

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明