• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE International Conference on Tools with Artificial Intelligence >Improving Navigation in Critique Graphs
【24h】

Improving Navigation in Critique Graphs

机译：改进批判图中的导航

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

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.
机译：引入了批判图作为一种分析会话推荐系统行为的设备。对话式推荐器允许用户使用诸​​如“我想要与此产品类似的产品，但价格更便宜”之类的评论来评论推荐的产品。批判图是有向多重图，其中的节点表示产品，一对产品之间的有向边表示用户如何通过调整特定的产品功能将其从一个产品移动到另一个产品。已经表明，批判图不是对称的：如果用户批判产品pi并向其显示产品pj，则以相反的方式来批判产品pj不一定会返回产品pi。此外，可能无法从给定产品开始获取目录中的所有产品，或者由于某种特定的批评而导致某些产品变得不可及。后一个点非常不令人满意，因为用户会认为仅通过批阅就可以浏览整个目录。在文献中已经提出了许多解决这个问题的方法。在本文中，我们提出了一种直接利用批判图的新颖方法。具体而言，无法到达是批判图具有多个强连接组件的结果。我们展示了批注图如何以较小的方式修改，从而修改了给定目录的批注的语义，从而使所有产品始终可用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号