Please use this identifier to cite or link to this item: http://hdl.handle.net/2067/49384
DC FieldValueLanguage
dc.contributor.authorDi Noia, Tommasoit
dc.contributor.authorDonini, Francesco Mariait
dc.contributor.authorJannach, Dietmarit
dc.contributor.authorNarducci, Fedelucioit
dc.contributor.authorPomo, Claudioit
dc.date.accessioned2023-03-21T22:15:47Z-
dc.date.available2023-03-21T22:15:47Z-
dc.date.issued2022it
dc.identifier.issn0020-0255it
dc.identifier.urihttp://hdl.handle.net/2067/49384-
dc.description.abstractRecommender systems help users find items of interest in situations of information overload in a personalized way, using needs and preferences of individual users. In conversational recommendation approaches, the system acquires needs and preferences in an interactive, multi-turn dialog. This is usually driven by incrementally asking users about their preferences about item features or individual items. A central research goal in this context is efficiency, evaluated concerning the number of required interactions until a satisfying item is found. Today, research on dialog efficiency is almost entirely empirical, aiming to demonstrate, for example, that one strategy for selecting questions to ask the user is better than another one in a given application. This work complements empirical research with a theoretical, domain-independent model of conversational recommendation. This model, designed to cover a range of application scenarios, allows us to investigate the efficiency of conversational approaches in a formal way, particularly concerning the computational complexity of devising optimal interaction strategies. An experimental evaluation empirically confirms our findings.it
dc.format.mediumSTAMPAit
dc.language.isoengit
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleConversational recommendation: Theoretical model and complexity analysisit
dc.typearticle*
dc.identifier.doi10.1016/j.ins.2022.07.169it
dc.identifier.scopus2-s2.0-85137886325it
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85137886325it
dc.relation.journalINFORMATION SCIENCESit
dc.relation.firstpage325it
dc.relation.lastpage347it
dc.relation.volume614it
dc.subject.scientificsectorING-INF/05it
dc.subject.ercsectorPE6it
dc.description.numberofauthors5it
dc.description.internationalit
dc.contributor.countryITAit
dc.contributor.countryAUTit
dc.type.refereeREF_1it
dc.type.miur262*
item.fulltextWith Fulltext-
item.openairetypearticle-
item.cerifentitytypePublications-
item.grantfulltextrestricted-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.journal.journalissn0020-0255-
crisitem.journal.anceE082783-
Appears in Collections:A1. Articolo in rivista
Files in This Item:
File Description SizeFormat Existing users please
CoRS_Formal_Framework_v4.pdfpreprint submitted to the journal494.35 kBAdobe PDF    Request a copy
Show simple item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
checked on Apr 17, 2024

Page view(s)

32
Last Week
0
Last month
1
checked on Apr 24, 2024

Download(s)

2
checked on Apr 24, 2024

Google ScholarTM

Check

Altmetric


This item is licensed under a Creative Commons License Creative Commons