Finding optimal alternatives based on efficient comparative preference inference
| dc.check.embargoformat | Not applicable | en |
| dc.check.info | No embargo required | en |
| dc.check.opt-out | Not applicable | en |
| dc.check.reason | No embargo required | en |
| dc.check.type | No Embargo Required | |
| dc.contributor.advisor | Wilson, Nic | en |
| dc.contributor.author | Trabelsi, Walid | |
| dc.contributor.funder | Science Foundation Ireland | en |
| dc.date.accessioned | 2013-05-13T12:07:15Z | |
| dc.date.available | 2013-05-13T12:07:15Z | |
| dc.date.issued | 2013 | |
| dc.date.submitted | 2013 | |
| dc.description.abstract | Choosing the right or the best option is often a demanding and challenging task for the user (e.g., a customer in an online retailer) when there are many available alternatives. In fact, the user rarely knows which offering will provide the highest value. To reduce the complexity of the choice process, automated recommender systems generate personalized recommendations. These recommendations take into account the preferences collected from the user in an explicit (e.g., letting users express their opinion about items) or implicit (e.g., studying some behavioral features) way. Such systems are widespread; research indicates that they increase the customers' satisfaction and lead to higher sales. Preference handling is one of the core issues in the design of every recommender system. This kind of system often aims at guiding users in a personalized way to interesting or useful options in a large space of possible options. Therefore, it is important for them to catch and model the user's preferences as accurately as possible. In this thesis, we develop a comparative preference-based user model to represent the user's preferences in conversational recommender systems. This type of user model allows the recommender system to capture several preference nuances from the user's feedback. We show that, when applied to conversational recommender systems, the comparative preference-based model is able to guide the user towards the best option while the system is interacting with her. We empirically test and validate the suitability and the practical computational aspects of the comparative preference-based user model and the related preference relations by comparing them to a sum of weights-based user model and the related preference relations. Product configuration, scheduling a meeting and the construction of autonomous agents are among several artificial intelligence tasks that involve a process of constrained optimization, that is, optimization of behavior or options subject to given constraints with regards to a set of preferences. When solving a constrained optimization problem, pruning techniques, such as the branch and bound technique, point at directing the search towards the best assignments, thus allowing the bounding functions to prune more branches in the search tree. Several constrained optimization problems may exhibit dominance relations. These dominance relations can be particularly useful in constrained optimization problems as they can instigate new ways (rules) of pruning non optimal solutions. Such pruning methods can achieve dramatic reductions in the search space while looking for optimal solutions. A number of constrained optimization problems can model the user's preferences using the comparative preferences. In this thesis, we develop a set of pruning rules used in the branch and bound technique to efficiently solve this kind of optimization problem. More specifically, we show how to generate newly defined pruning rules from a dominance algorithm that refers to a set of comparative preferences. These rules include pruning approaches (and combinations of them) which can drastically prune the search space. They mainly reduce the number of (expensive) pairwise comparisons performed during the search while guiding constrained optimization algorithms to find optimal solutions. Our experimental results show that the pruning rules that we have developed and their different combinations have varying impact on the performance of the branch and bound technique. | en |
| dc.description.sponsorship | Science Foundation Ireland (08/PI/I1912) | en |
| dc.description.status | Not peer reviewed | en |
| dc.description.version | Accepted Version | |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Trabelsi, W. 2013. Finding optimal alternatives based on efficient comparative preference inference. PhD Thesis, University College Cork. | en |
| dc.identifier.endpage | 198 | |
| dc.identifier.uri | https://hdl.handle.net/10468/1113 | |
| dc.language.iso | en | en |
| dc.publisher | University College Cork | en |
| dc.rights | © 2013. Walid Trabelsi | en |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/ | en |
| dc.subject | Preferences | en |
| dc.subject | Constraint optimization | en |
| dc.subject | Recommender systems | en |
| dc.subject.lcsh | Constraint programming (Computer science). | en |
| dc.subject.lcsh | Human-computer interaction. | en |
| dc.thesis.opt-out | false | * |
| dc.title | Finding optimal alternatives based on efficient comparative preference inference | en |
| dc.type | Doctoral thesis | en |
| dc.type.qualificationlevel | Doctoral | en |
| dc.type.qualificationname | PhD (Science) | en |
| ucc.workflow.supervisor | n.wilson@4c.ucc.ie | * |
Files
Original bundle
1 - 2 of 2
Loading...
- Name:
- Abstract.pdf
- Size:
- 93.36 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 5.62 KB
- Format:
- Item-specific license agreed upon to submission
- Description: