DocumentCode
2387283
Title
Meaning of Pearson Residuals Linear Algebra View
Author
Tsumoto, Shusaku ; Hirano, Shoji
Author_Institution
Shimane Univ., Izumo
fYear
2007
fDate
2-4 Nov. 2007
Firstpage
465
Lastpage
465
Abstract
Marginal distributions play an central role in statistical analysis of a contingency table. However, when the number of partition becomes large, the contribution from marginal distributions decreases. This paper focuses on a formal analysis of marginal distributions in a contingency table. The main approach is to take the difference between two matrices with the same sample size and the same marginal distributions, which we call difference matrix. The important nature of the difference matrix is that the determinant is equal to 0: when the rank of a matrix is r, the difference between a original matrix and the expected matrix will become r - 1 at most. Since the sum of rows or columns of the will become zero, which means that the information of one rank corresponds to information on the frequency of a contingency matrix. Interestingly, if we take an expected matrix whose elements are the expected values based on marginal distributions, the difference between an original matrix and expected matrix can be represented by linear combination of determinants of 2 times 2 submatrices.
Keywords
linear algebra; statistical analysis; Pearson residuals; contingency matrix; contingency table; difference matrix; linear algebra; marginal distributions; statistical analysis; Biomedical informatics; Bismuth; Cities and towns; Data mining; Distributed computing; Frequency; Linear algebra; Matrix decomposition; Probability; Statistical analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing, 2007. GRC 2007. IEEE International Conference on
Conference_Location
Fremont, CA
Print_ISBN
978-0-7695-3032-1
Type
conf
DOI
10.1109/GrC.2007.126
Filename
4403143
Link To Document