<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Preference elicitation with argument-based machine learning</dc:title><dc:creator>Grabnar,	Jure	(Avtor)
	</dc:creator><dc:creator>Guid,	Matej	(Mentor)
	</dc:creator><dc:subject>knowledge acquisition</dc:subject><dc:subject>preference elicitation</dc:subject><dc:subject>argument-based machine learning</dc:subject><dc:subject>convolutional neural networks</dc:subject><dc:subject>weakly supervised object localization</dc:subject><dc:subject>transfer learning</dc:subject><dc:subject>online dating</dc:subject><dc:description>We have developed a novel method for determining people's preferences based on their explanations of visual data. To this end, we have extended the existing framework for argument-based machine learning (ABML), which includes argument-based rule learning and an interactive knowledge refinement loop, with a recommendation engine and a pipeline based on convolutional neural networks to obtain interpretable data from images. We have developed an interactive application inspired by ABML to determine users' dating preferences. To enable a user to argue and explain his preferences based on image data, we introduced a novel approach where the user explains his preferences by drawing rectangles to select a part of the image he likes or dislikes. The ABML knowledge refinement loop allows the user to focus on the most critical parts of the current knowledge base and helps the user to adequately explain selected relevant examples - in our case, images.

We have shown experimentally that the new approach to preference elicitation
allows successful preference elicitation when it comes to dating. All users
found the final selection of images useful, and the selection of images that the
user is likely to prefer gradually improved during the interaction. The
identified preferences of each user of the application are presented as a
rule-based model that helps to quickly find images according to the user's
taste. We have shown that this rule model is easy to interpret. All participants
found that most of the rules in the final model matched their preferences.

The beauty of our approach to preference elicitation is that, at least in principle, we can address any domain that can be represented by images, where people can explain which parts of the image they like or dislike, provided that it is possible to obtain meaningful attributes from images.</dc:description><dc:date>2020</dc:date><dc:date>2020-11-18 10:16:56</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>122047</dc:identifier><dc:identifier>VisID: 25164</dc:identifier><dc:identifier>COBISS_ID: 40090883</dc:identifier><dc:language>sl</dc:language></metadata>
