{"id":{"repo_id":"marshall","oai_identifier":"oai:mds.marshall.edu:etd-2169"},"canonical_url":"https://search.ndltd.org/etd/marshall/oai:mds.marshall.edu:etd-2169","repository":{"repo_id":"marshall","name":"Marshall University","base_url":"https://mds.marshall.edu/do/oai/"},"display":{"title":"Preference Probability Based on Ranks - A New Approach Using Logistic Regression with Zero Intercept","abstract":"Many probability models have been proposed to describe rankings. One of these is the BradleyTerry model, which is based on observed pairwise preferences. For this study, we reverse the case and propose a new approach for estimating pairwise preference probabilities based on observed rankings. The new approach uses logistic regression with zero intercept as the statistical model that fits this situation. In order to implement the model, we first estimate the parameter using maximum likelihood estimation. Then we evaluate this estimation using numerical approximation procedures. We consider three such procedures: bisection method, Newton-Raphson method, and improved Newton’s method. Using simulated data, we compare the three procedures based on the number of iterations required for convergence, as well as CPU time. We identify the improved Newton’s method as the fastest of the three methods.","abstract_html":"Many probability models have been proposed to describe rankings. One of these is the BradleyTerry model, which is based on observed pairwise preferences. For this study, we reverse the case and propose a new approach for estimating pairwise preference probabilities based on observed rankings. The new approach uses logistic regression with zero intercept as the statistical model that fits this situation. In order to implement the model, we first estimate the parameter using maximum likelihood estimation. Then we evaluate this estimation using numerical approximation procedures. We consider three such procedures: bisection method, Newton-Raphson method, and improved Newton’s method. Using simulated data, we compare the three procedures based on the number of iterations required for convergence, as well as CPU time. We identify the improved Newton’s method as the fastest of the three methods.","abstract_has_math":false,"creators":["Agboola, Oluwagbenga David"],"institution":null,"degree_name":"Mathematics","degree_level":"Thesis","degree_discipline":"College of Science","degree_department":null,"school":null,"contributors":["Dr. Laura Adkins, Committee Chairperson","Dr. Scott Sarra","Dr. Raid Al-Aqtash"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-21T19:57:03Z","subjects":["Physical Sciences and Mathematics","Probability","Statistics and Probability","Logistic regression","Preference probability"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://mds.marshall.edu/etd/1166","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://mds.marshall.edu/etd/1166","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://mds.marshall.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Amds.marshall.edu%3Aetd-2169","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Laura Adkins, Committee Chairperson","Dr. Scott Sarra","Dr. Raid Al-Aqtash"]},{"key":"dc:creator","label":"Author","values":["Agboola, Oluwagbenga David"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2019-06-13T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2018-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["College of Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Mathematics"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Physical Sciences and Mathematics","Probability","Statistics and Probability","Logistic regression","Preference probability"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://mds.marshall.edu/etd/1166"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Many probability models have been proposed to describe rankings. One of these is the BradleyTerry model, which is based on observed pairwise preferences. For this study, we reverse the case and propose a new approach for estimating pairwise preference probabilities based on observed rankings. The new approach uses logistic regression with zero intercept as the statistical model that fits this situation. In order to implement the model, we first estimate the parameter using maximum likelihood estimation. Then we evaluate this estimation using numerical approximation procedures. We consider three such procedures: bisection method, Newton-Raphson method, and improved Newton’s method. Using simulated data, we compare the three procedures based on the number of iterations required for convergence, as well as CPU time. We identify the improved Newton’s method as the fastest of the three methods."]},{"key":"dc:title","label":"Title","values":["Preference Probability Based on Ranks - A New Approach Using Logistic Regression with Zero Intercept"]}]}],"canonical_facts":{"dc:contributor":["Dr. Laura Adkins, Committee Chairperson","Dr. Scott Sarra","Dr. Raid Al-Aqtash"],"dc:creator":["Agboola, Oluwagbenga David"],"dc:date.available":["2019-06-13T07:00:00Z"],"dc:date.created":["2018-01-01T08:00:00Z"],"dc:description.abstract":["Many probability models have been proposed to describe rankings. One of these is the BradleyTerry model, which is based on observed pairwise preferences. For this study, we reverse the case and propose a new approach for estimating pairwise preference probabilities based on observed rankings. The new approach uses logistic regression with zero intercept as the statistical model that fits this situation. In order to implement the model, we first estimate the parameter using maximum likelihood estimation. Then we evaluate this estimation using numerical approximation procedures. We consider three such procedures: bisection method, Newton-Raphson method, and improved Newton’s method. Using simulated data, we compare the three procedures based on the number of iterations required for convergence, as well as CPU time. We identify the improved Newton’s method as the fastest of the three methods."],"dc:identifier":["https://mds.marshall.edu/etd/1166"],"dc:subject":["Physical Sciences and Mathematics","Probability","Statistics and Probability","Logistic regression","Preference probability"],"dc:title":["Preference Probability Based on Ranks - A New Approach Using Logistic Regression with Zero Intercept"],"thesis:degree_discipline":["College of Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Mathematics"]},"updated_at":"2026-11-21T19:57:03Z"}