A non-Bayesian preference elicitation approach for noisy decision models
dc.contributor.advisor | Wilson, Nic | |
dc.contributor.advisor | Prestwich, Steve | |
dc.contributor.author | Pourkhajouei, Samira | |
dc.contributor.funder | Science Foundation Ireland | |
dc.contributor.funder | Insight SFI Research Centre for Data Analytics | |
dc.date.accessioned | 2025-10-01T15:05:35Z | |
dc.date.available | 2025-10-01T15:05:35Z | |
dc.date.issued | 2025 | |
dc.date.submitted | 2025 | |
dc.description.abstract | Interactive preference elicitation plays a crucial role in multi-criteria decisionmaking (MCDM) and recommender systems, particularly when user preferences are uncertain or noisy. Traditional Bayesian approaches offer a principled way to handle such uncertainty by representing preferences as probabilistic models, updating them iteratively based on user responses. However, these methods often entail high computational costs and require prior assumptions on preference distributions, making them less feasible for real-time applications. This thesis introduces a non-Bayesian framework for interactive preference elicitation under noisy user responses, offering a computationally efficient alternative to probabilistic approaches. Instead of relying on prior distributions, our method identifies and refines a set of plausible preference models by evaluating their consistency with observed user responses. The framework incrementally selects targeted queries that maximize information gain while remaining robust to response inconsistencies, allowing for an effective tradeoff between query efficiency and recommendation accuracy. We propose a novel query selection strategy that prioritizes alternatives based on their potential optimality across multiple preference models, reducing the number of interactions required to identify the user’s most preferred alternative. To ensure scalability, our method operates on a finite approximation of the preference space, allowing for efficient real-time decision-making. Empirical evaluations demonstrate the effectiveness of the proposed approach, showing that it achieves high accuracy in identifying user preferences while significantly reducing computational costs compared to Bayesian and minimax regret-based methods. The results suggest that this non-Bayesian framework is well-suited for interactive decision-support systems, personalized recommendations, and real-time MCDM applications, offering a practical balance between efficiency, adaptability, and robustness to noise. | en |
dc.description.status | Not peer reviewed | en |
dc.description.version | Accepted Version | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.citation | Pourkhajouei, S. 2025. A non-Bayesian preference elicitation approach for noisy decision models. MSc Thesis, University College Cork. | |
dc.identifier.endpage | 96 | |
dc.identifier.uri | https://hdl.handle.net/10468/17935 | |
dc.language.iso | en | en |
dc.publisher | University College Cork | en |
dc.relation.project | info:eu-repo/grantAgreement/SFI/Research Centres Programme::Phase 2/12/RC/2289_P2/IE/INSIGHT_Phase 2 / | |
dc.rights | © 2025, Samira Pourkhajouei. | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject | Preference elicitation | |
dc.subject | Preference learning | |
dc.subject | Decision-making | |
dc.subject | User preference models | |
dc.title | A non-Bayesian preference elicitation approach for noisy decision models | |
dc.type | Masters thesis (Research) | en |
dc.type.qualificationlevel | Masters | en |
dc.type.qualificationname | MSc - Master of Science | en |
Files
Original bundle
1 - 2 of 2
Loading...
- Name:
- PourkhajoueiS_MSc2025.pdf
- Size:
- 697.14 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full Text E-thesis
Loading...
- Name:
- 3. 120224105 - Samira Pourkhajouei - Submission for Examination Form.pdf
- Size:
- 1.27 MB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 5.2 KB
- Format:
- Item-specific license agreed upon to submission
- Description: