Beyond Simpson's paradox: A descriptive approach
β Scribed by Yamaoka, Kazue
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 644 KB
- Volume
- 12
- Category
- Article
- ISSN
- 8755-0024
No coin nor oath required. For personal study only.
β¦ Synopsis
In considering the strength of association of particular variables, we cannot ignore the effects of confounding factors that cause Simpson's paradox. Many methods for adjusting these effects have been proposed, and a great deal of effort has been devoted to statistical tests. Apart from the statistical tests, the aim of the present study is to examine the strength of association of two categorical variables without reference to any explicit confounding factors. In other words, our aim is to specify the conditions under which Simpson's paradox does not occur, where the idea of classifying the original universe into groups is adopted. Let us begin by focusing our attention on a 2 x 2 contingency table (cross-classification table) and considering the association of X with Y , where X and Y denote dichotomous variables with classes A and B for X and classes + andfor Y . To examine the strength of association between these variables, the index k = q / p is used, where p denotes the proportion of A+ in A and q denotes that of B + in B. Using the maximum and minimum values of the index k obtained by numerical calculation, the strength of association is examined. The results are discussed and examples given. KEY WORDS contingency table; Simpson's paradox; confounding factor; strength of association; numerical calculation 'extraneous' factors that may affect the relationship studied. The distortions include estimates that can result when the effects of extraneous variables become involved in the exposure-disease relationship under study have traditionally been referred to as 'confounding factors'.j The misleading effects of confounding factors have been illustrated by Weinberg4 Therefore, in
π SIMILAR VOLUMES
This paper gives some new logical characterizations of the class of rudimentary languages in the scope of descriptive complexity. These characterizations are based on a logic introduced by Parigot and Pelz to characterize Petri Net languages, and generalized quantiΓΏers of comparison of cardinality.
We devise a method to generate descriptive classification rules of shape contours by using inductive learning. The classification rules are represented in the form of logic programs. We first transform input objects from pixel representation into predicate representation. The transformation consists