Improving navigation in critique graphs

Show simple item record

dc.contributor.author Genc, Begum
dc.contributor.author O'Sullivan, Barry
dc.date.accessioned 2018-03-26T10:30:37Z
dc.date.available 2018-03-26T10:30:37Z
dc.date.issued 2016-11
dc.identifier.citation Genc, B. and O'Sullivan, B. (2016) 'Improving navigation in critique graphs', 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI), San Jose, CA, USA, 6-8 November. doi:10.1109/ICTAI.2016.0030 en
dc.identifier.startpage 134 en
dc.identifier.endpage 141 en
dc.identifier.uri http://hdl.handle.net/10468/5691
dc.identifier.doi 10.1109/ICTAI.2016.0030
dc.description.abstract Critique graphs were introduced as a device for analysing the behaviour of conversational recommender systems. A conversational recommender allows a user to critique a recommended product with statements such as "I'd like a similar product to this one, but cheaper". A critique graph is a directed multigraph in which the nodes represent products, and a directed edge between a pair of products represents how a user can move from one product to another by tweaking a particular product feature. It has been shown that critique graphs are not symmetric: if a user critiques a product pi and is presented with product pj, critiquing product pj in the opposite manner does not necessarily return product pi. Furthermore, it might not be possible to reach all products in a catalogue starting from a given product, or as a consequence of a particular critique some products become unreachable. This latter point is quite unsatisfactory since a user would assume that it is possible to explore the full catalogue by critiquing alone. A number of approaches to overcoming this problem have been proposed in the literature. In this paper we propose a novel approach that exploits the critique graph directly. Specifically, the unreachability is a consequence of a critique graph having more than one strongly connected component. We show how the critique graph can be modified in a minor way, thereby modifying the semantics of critiquing for a given catalogue, so that all products are always reachable. en
dc.description.uri http://www.ictai2016.com/ en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher Institute of Electrical and Electronics Engineers (IEEE) en
dc.relation.ispartof 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI)
dc.rights © 2016, IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. en
dc.subject Strongly connected components en
dc.subject Recommender systems en
dc.subject Critique graphs en
dc.subject Semantics en
dc.subject Recommender systems en
dc.subject Navigation en
dc.subject Data analysis en
dc.subject Computer science en
dc.subject Compounds en
dc.subject Standards en
dc.title Improving navigation in critique graphs en
dc.type Conference item en
dc.internal.authorcontactother Barry O'Sullivan, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: b.osullivan@cs.ucc.ie en
dc.internal.availability Full text available en
dc.date.updated 2018-03-13T12:45:29Z
dc.description.version Accepted Version en
dc.internal.rssid 429397924
dc.contributor.funder Science Foundation Ireland en
dc.description.status Not peer reviewed en
dc.internal.copyrightchecked Yes en
dc.internal.licenseacceptance Yes en
dc.internal.conferencelocation San Jose, CA, USA en
dc.internal.IRISemailaddress b.osullivan@cs.ucc.ie en
dc.relation.project info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/ en


Files in this item

This item appears in the following Collection(s)

Show simple item record

This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement