|
% E = {A,B,…,R} and F represent events |
|
% S represents a sample |
For each E in S
|
% Analysis done for each combination |
F ← E union {X = 0} |
% Select control combinations, X = 0 |
f0[E] ← count(F) |
% Count of Controls |
Y0[E] ← sum(y(F))/count(F) |
% Prob Y for Controls |
For each E in S
|
% Analysis done for each combination |
F ← E union {X = 1} |
% Select Case combinations, X = 1 |
f1[E] ← count(F) |
% Count of Cases |
Y1[E] ← sum(y(F))/count(F) |
% Prob Y for Cases |
For each E in f0 |
% Weights for Control combinations |
if E in f1 |
|
then w0[E] ← f1[E]/f0[E] |
% Matched |
else w0[E] ← 0 |
% Not matched |
For each E in f1 |
% Weights for Case combinations |
if E in f0 |
|
then w1[E] ← 1 |
% Matched |
else w1[E] ← 0 |
% Not matched |