政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/98903
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 113451/144438 (79%)
造访人次 : 51326254      在线人数 : 840
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    政大機構典藏 > 理學院 > 應用數學系 > 學位論文 >  Item 140.119/98903


    请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/98903


    题名: 二維條件分配相容性問題之新解法
    A new approach to solve the compatibility issues for two-dimensional conditional distributions
    作者: 郭柏辛
    Kuo, Pohsin
    贡献者: 宋傳欽
    郭柏辛
    Kuo, Pohsin
    关键词: 條件機率分配
    相容性
    比值矩陣
    特徵向量法
    奇異值分解法
    最近似秩1矩陣法
    類Frobenius範數
    Lagrange乘數法
    高維度牛頓法
    最佳化法
    最近似聯合分配
    conditional probability distribution
    compatibility
    ratio matrix
    eigenvector approach
    singular value decomposition approach
    most nearly rank one matrix approach
    semi-Frobenius norm
    Lagrange multiplier method
    multivariate Newton`s method
    optimization method
    most nearly joint distribution
    日期: 2016
    上传时间: 2016-07-11 17:42:15 (UTC+8)
    摘要: 給定二元隨機向量(X,Y)之聯合機率分配,可容易得到其條件機率分配X|Y與Y|X;反之,給定條件機率分配X|Y與Y|X,是否能獲得對應的聯合機率分配呢?條件分配相容性研究的主要內容包括:(一)如何判斷給定的條件分配是否相容?(二)若相容,則如何找到聯合分配?(三)若不相容,則該如何找到最近似的聯合分配?

    根據比值矩陣法的理論,檢驗比值矩陣是否為秩1矩陣或者有擴張秩1矩陣,便可得知給定的條件分配是否相容。當比值矩陣的元素皆為正值時,本文運用線性代數中之奇異值分解定理,先發展出奇異值分解法來處理條件分配相容性問題;當比值矩陣的元素非皆為正值時,接續發展出最近似秩1矩陣法來解決相容性問題,而最近似秩1矩陣法可視為奇異值分解法的延伸。在發展最近似秩1矩陣法時,我們利用到類Frobenius範數的概念,並提出了三種求解過程(無限制條件法、Lagrange乘數法與高維度牛頓法)以及相關的演算法。本文詳細剖析了三種求解過程之數學流程,並輔以實際例子予以說明。

    當條件機率分配不相容時,我們通常可獲得兩組近似聯合分配。如何將它們做適當的組合,也是值得探討的問題。最後,針對等加權之組合方式、權重與總誤差成反比之組合方式以及特徵向量法之組合方式進行比較分析。
    Given a bivariate joint distribution of random vector (X,Y), we can easily derive the conditional probability distributions of X|Y and Y|X. Conversely, given conditional probability distributions of X|Y and Y|X, can we find the corresponding joint distribution? The compatibility issues of conditional distribution include: (a) how to determine whether they are compatible; (b) how to find the joint distribution if they are compatible; (c) how to find the most nearly joint distribution if they are incompatible.

    Using the theory of ratio matrix approach, we can determine the given conditional probability distributions are compatible or not by checking whether their corresponding ratio matrix or the extension matrix of this ratio matrix is rank one or not. When elements of the ratio matrix are all positive, this thesis uses the singular value decomposition theorem of linear algebra to develop the singular value decomposition approach to deal with the compatibility issues. When elements of the ratio matrix are not all positive, we provide the most nearly rank one matrix approach to solve the compatibility issues. This most nearly rank one matrix approach can be considered as the extension of singular value decomposition approach. To develop the most nearly rank one matrix approach, we use the concept of semi-Frobenius norm to provide three solving methods (unconstrained method, Lagrange multiplier method, and multivariate Newton`s method) with related algorithms. This thesis gives the mathematical procedure on these three solving methods in detail and uses examples to explain the compatibility issues.

    When the conditional distributions are incompatible, we usually have two nearly joint distributions. It would be worth of discussing the combination of these two nearly joint distributions. Hence, this thesis compares and analyzes the compatibility issues with three different weights, which are equal, inverse proportional to the total errors, and relating to eigenvectors.
    參考文獻: Arnold, B. C. and Press, S. J. (1989), Compatible conditional distributions. Journal of the American Statistical Association, 84, 152-156.
    Arnold, B. C., Castillo, E., and Sarabia, J. M. (2002), Exact and near compatibility of discrete conditional distributions. Computational Statistics \\& Data Analysis, 40, 231-252.
    Arnold, B. C., Castillo, E., and Sarabia, J. M. (2004), Compatibility of partial or complete conditional probability specifications. Journal of Statistical Planning and Inference, 123, 133-159.
    David Poole (2006), Linear algebra: a modern introduction. Brooks/Cole, Cengage Learning.
    Markovsky, Ivan (2011), Low rank approximation: algorithms, implementation, applications. Springer Science \\& Business Media.
    Song, C. C., Li, L. A., Chen, C. H., Jiang, T. J., and Kuo, K. L. (2010), Compatibility of finite discrete conditional distributions. Statistical Sinica, 20, 423-440.
    周志成(2016),奇異值分解,檢索日期:2016年6月3日,檢自:https://ccjou.wordpress.com/2009/09/01/
    周志成(2016),牛頓法,檢索日期:2016年6月3日,檢自:https://ccjou.wordpress.com/2013/07/08/
    顧仲航(2011),以特徵向量法解條件分配相容性問題,國立政治大學應用數學系碩士論文。
    描述: 碩士
    國立政治大學
    應用數學系
    102751014
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0102751014
    数据类型: thesis
    显示于类别:[應用數學系] 學位論文

    文件中的档案:

    档案 大小格式浏览次数
    101401.pdf1207KbAdobe PDF259检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈