Show simple item record

dc.contributor.advisorZilles, Sandra
dc.contributor.authorAli, Abu Mohammad Hammad
dc.date.accessioned2019-11-21T17:43:41Z
dc.date.available2019-11-21T17:43:41Z
dc.date.issued2019-04
dc.identifier.urihttp://hdl.handle.net/10294/9023
dc.descriptionA Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science, University of Regina. vi, 91 p.en_US
dc.description.abstractPreference modeling has been studied extensively in the literature, and has applications in recommender systems and automated decision-making. The eventual objective of working with preference models is to be able to reason about preferences over objects, often referred to as outcomes. In most of the literature, each outcome is described as an assignment of values to a set of attributes. Representing and reasoning about preferences over outcomes calls for efficient preference models. In this thesis, we focus on one such model, Con- ditional Preference Networks (CP-nets). A CP-net is a graphical model that captures the preferences of an individual using a directed graph, with vertices representing attributes and edges representing dependency relations between attributes. Information about the preferential dependence/independence be- tween attributes can be leveraged to efficiently order outcomes without exhaus- tively comparing all attributes in a pair of outcomes. In most existing studies, it is assumed that each individual user has their unique CP-net representing their preferences. In this thesis, we propose an approach to aggregate the preferences of multiple users via a single CP-net, while minimizing disagree- ment with individual users. We assume that each user has their preferences represented via a separable CP-net, i.e., a CP-net without any edges between attributes. Our goal is to represent the preferences of a group of users using a single CP-net, referred to as a summary CP-net. We present two algorithms that assume all the input CP-nets are separable, with results on correctness and complexity for each algorithm. We also present a discussion on some important properties of CP-nets and the impact these have on our algorithms.en_US
dc.language.isoenen_US
dc.publisherFaculty of Graduate Studies and Research, University of Reginaen_US
dc.titleSummarizing Conditional Preference Networksen_US
dc.typeThesisen
dc.description.authorstatusStudenten
dc.description.peerreviewyesen
thesis.degree.nameMaster of Science (MSc)en_US
thesis.degree.levelMaster'sen
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorUniversity of Reginaen
thesis.degree.departmentDepartment of Computer Scienceen_US
dc.contributor.committeememberMouhoub, Malek
dc.contributor.committeememberHamilton, Howard
dc.contributor.externalexaminerHerman, Allen
dc.identifier.tcnumberTC-SRU-9023
dc.identifier.thesisurlhttps://ourspace.uregina.ca/bitstream/handle/10294/9023/Ali_AbuMohammad_MSC_CS_Fall2019.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record