-
- Wang Jinfang
- Department of Mathematics and Informatics, Graduate School of Science, Chiba University
-
- Jing Ping
- Faculty of Science, China University of Mining and Technology
この論文をさがす
抄録
A concept of matchability of survey data is introduced based on decompositions of the joint probability density functions. This definition of matchability naturally leads to restrictions on the joint distributions in the form of various conditional independence relations. The concept of partial matchability is defined as the global matchability with respect to a subset of the underlying variables. The global matchability does not imply partial matchability and vice versa, which constitutes part of Simpson's paradox. A numerical experiment is carried out to show possible merits of algorithms based on partial matchability. We also show numerically that when the ideal assumption of matchability holds only approximately, estimation accuracy is still guaranteed to some extent. Extension to the problem of matching three files is also briefly discussed.
収録刊行物
-
- Journal of the Japanese Society of Computational Statistics
-
Journal of the Japanese Society of Computational Statistics 22 (1), 43-56, 2009
日本計算機統計学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390001204414948480
-
- NII論文ID
- 110007502778
-
- NII書誌ID
- AA10823693
-
- ISSN
- 18811337
- 09152350
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可