Show simple item record

dc.contributor.authorMehta, Cyrus R.
dc.contributor.authorPatel, Nitin R.
dc.contributor.authorGray, Robert
dc.date.accessioned2010-09-21T09:23:10Z
dc.date.available2010-09-21T09:23:10Z
dc.date.copyright1985
dc.date.issued1985-09-21T09:23:10Z
dc.identifier.urihttp://hdl.handle.net/11718/8878
dc.descriptionJournal of the American Statistical Association, Vol. 80, No. 392, (December 1985), pp. 969-973en
dc.description.abstractA quadratic time network algorithm is providing for computing an exact confidence interval for the common odds ratio in several 2 X 2 independent contingency tables. The algorithm is shown to be a considerable improvement on an existing algorithm development by Thomas (1975), which relies on exhaustive enumeration. Problems that would formerly have consumed several CPU hours can now be solved in a few CPU seconds. The algorithm can easily handle sparse data sets where asymptotic results are suspect. The network approach, on which the algorithm is based, is also a powerful tool for exact statistical inference in other settings.
dc.language.isoenen
dc.subjectContingency Tablesen
dc.subjectCommon Oddsen
dc.subjectAlgorithmsen
dc.titleComputing an exact confidence interval for the common odds ratio in several 2x2 contingency tablesen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record