Exact Tests via Complete Enumeration: A Distributed Computing Approach

Michaelides, Danius T. (1997) Exact Tests via Complete Enumeration: A Distributed Computing Approach University of Southampton, : University of Southampton, Doctoral Thesis .


[img] PDF thesis.pdf - Other
Download (749kB)
[img] Postscript thesis.ps - Other
Download (1MB)


The analysis of categorical data often leads to the analysis of a contingency table. For large samples, asymptotic approximations are sufficient when calculating p-values, but for small samples the tests can be unreliable. In these situations an exact test should be considered. This bases the test on the exact distribution of the test statistic. Sampling techniques can be used to estimate the distribution. Alternatively, the distribution can be found by complete enumeration. A new algorithm is developed that enables a model to be defined by a model matrix, and all tables that satisfy the model are found. This provides a more efficient enumeration mechanism for complex models and extends the range of models that can be tested. The technique can lead to large calculations and a distributed version of the algorithm is developed that enables a number of machines to work efficiently on the same problem.

Item Type: Thesis (Doctoral)
Additional Information: Address: Southampton, UK
Organisations: University of Southampton, Web & Internet Science
ePrint ID: 250749
Date :
Date Event
Date Deposited: 16 Sep 1999
Last Modified: 18 Apr 2017 00:10
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/250749

Actions (login required)

View Item View Item