{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-1000"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-1000","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Small Sample Methods for the Analysis of Clustered Binary Data","abstract":"There are several solutions for analysis of clustered binary data. However, the two most common tools in use today, generalized estimating equations and random effects or mixed models, rely heavily on asymptotic theory. However, in many situations, such as small or sparse samples, asymptotic assumptions may not be met. For this reason we explore the utility of the quadratic exponential model and conditional analysis to estimate the effect size of a trend parameter in small sample and sparse data settings. Further we explore the computational efficiency of two methods for conducting conditional analysis, the network algorithm and Markov chain Monte Carlo. Our findings indicate that conditional estimates do indeed outperform their unconditional maximum likelihood counterparts. The network algorithm remains the fastest tool for generating the required conditional distribution. However, for large samples, the Markov chain Monte Carlo approach accurately estimates the conditional distribution and is more efficient than the network algorithm.","abstract_html":"There are several solutions for analysis of clustered binary data. However, the two most common tools in use today, generalized estimating equations and random effects or mixed models, rely heavily on asymptotic theory. However, in many situations, such as small or sparse samples, asymptotic assumptions may not be met. For this reason we explore the utility of the quadratic exponential model and conditional analysis to estimate the effect size of a trend parameter in small sample and sparse data settings. Further we explore the computational efficiency of two methods for conducting conditional analysis, the network algorithm and Markov chain Monte Carlo. Our findings indicate that conditional estimates do indeed outperform their unconditional maximum likelihood counterparts. The network algorithm remains the fastest tool for generating the required conditional distribution. However, for large samples, the Markov chain Monte Carlo approach accurately estimates the conditional distribution and is more efficient than the network algorithm.","abstract_has_math":false,"creators":["Cook, Lawrence J."],"institution":"Hosted by Utah State University Libraries","degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Christopher C. Corcoran","D. Richard Cutler","John R. Stevens"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:45:59Z","subjects":["Statistics","Statistics and Probability"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/5380-5e11"],"render_values":[{"text":"https://doi.org/10.26076/5380-5e11","href":"https://doi.org/10.26076/5380-5e11","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/1","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/1","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-1000","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Christopher C. Corcoran","D. Richard Cutler","John R. Stevens"]},{"key":"dc:creator","label":"Author","values":["Cook, Lawrence J."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-03-24T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2008-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Statistics","Statistics and Probability"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/1"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/5380-5e11"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["There are several solutions for analysis of clustered binary data. However, the two most common tools in use today, generalized estimating equations and random effects or mixed models, rely heavily on asymptotic theory. However, in many situations, such as small or sparse samples, asymptotic assumptions may not be met. For this reason we explore the utility of the quadratic exponential model and conditional analysis to estimate the effect size of a trend parameter in small sample and sparse data settings. Further we explore the computational efficiency of two methods for conducting conditional analysis, the network algorithm and Markov chain Monte Carlo. Our findings indicate that conditional estimates do indeed outperform their unconditional maximum likelihood counterparts. The network algorithm remains the fastest tool for generating the required conditional distribution. However, for large samples, the Markov chain Monte Carlo approach accurately estimates the conditional distribution and is more efficient than the network algorithm."]},{"key":"dc:title","label":"Title","values":["Small Sample Methods for the Analysis of Clustered Binary Data"]}]}],"canonical_facts":{"dc:contributor":["Christopher C. Corcoran","D. Richard Cutler","John R. Stevens"],"dc:creator":["Cook, Lawrence J."],"dc:date.available":["2010-03-24T07:00:00Z"],"dc:date.created":["2008-05-01T07:00:00Z"],"dc:description.abstract":["There are several solutions for analysis of clustered binary data. However, the two most common tools in use today, generalized estimating equations and random effects or mixed models, rely heavily on asymptotic theory. However, in many situations, such as small or sparse samples, asymptotic assumptions may not be met. For this reason we explore the utility of the quadratic exponential model and conditional analysis to estimate the effect size of a trend parameter in small sample and sparse data settings. Further we explore the computational efficiency of two methods for conducting conditional analysis, the network algorithm and Markov chain Monte Carlo. Our findings indicate that conditional estimates do indeed outperform their unconditional maximum likelihood counterparts. The network algorithm remains the fastest tool for generating the required conditional distribution. However, for large samples, the Markov chain Monte Carlo approach accurately estimates the conditional distribution and is more efficient than the network algorithm."],"dc:identifier":["https://digitalcommons.usu.edu/etd/1"],"dc:identifier.doi":["https://doi.org/10.26076/5380-5e11"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["Statistics","Statistics and Probability"],"dc:title":["Small Sample Methods for the Analysis of Clustered Binary Data"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-11-19T08:45:59Z"}