A Linked Data Browser with Recommendations

F. Durão, D. Bridge
{"title":"A Linked Data Browser with Recommendations","authors":"F. Durão, D. Bridge","doi":"10.1109/ICTAI.2018.00038","DOIUrl":null,"url":null,"abstract":"It is becoming more common to publish data in a way that accords with the Linked Data principles. In an effort to improve the human exploitation of this data, we propose a Linked Data browser that is enhanced with recommendation functionality. Based on a user profile, also represented as Linked Data, we propose a technique that we call LDRec that chooses in a personalized way which of the resources that lie within a certain neighbourhood in a Linked Data graph to recommend to the user. The recommendation technique, which is novel, is inspired by a collective classifier known as the Iterative Classification Algorithm. We evaluate LDRec using both an off-line experiment and a user trial. In the off-line experiment, we obtain higher hit rates than we obtain using a simpler classifier. In the user trial, comparing against the same simpler classifier, participants report significantly higher levels of overall satisfaction for LDRec.","PeriodicalId":254686,"journal":{"name":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2018.00038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It is becoming more common to publish data in a way that accords with the Linked Data principles. In an effort to improve the human exploitation of this data, we propose a Linked Data browser that is enhanced with recommendation functionality. Based on a user profile, also represented as Linked Data, we propose a technique that we call LDRec that chooses in a personalized way which of the resources that lie within a certain neighbourhood in a Linked Data graph to recommend to the user. The recommendation technique, which is novel, is inspired by a collective classifier known as the Iterative Classification Algorithm. We evaluate LDRec using both an off-line experiment and a user trial. In the off-line experiment, we obtain higher hit rates than we obtain using a simpler classifier. In the user trial, comparing against the same simpler classifier, participants report significantly higher levels of overall satisfaction for LDRec.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
带推荐的关联数据浏览器
以符合关联数据原则的方式发布数据正变得越来越普遍。为了改进人类对这些数据的利用,我们提出了一个增强了推荐功能的关联数据浏览器。基于用户配置文件(也表示为关联数据),我们提出了一种称为LDRec的技术,该技术以个性化的方式选择关联数据图中某个邻域内的资源,向用户推荐。推荐技术是一种新颖的技术,它的灵感来自于一种被称为迭代分类算法的集体分类器。我们使用离线实验和用户试验来评估LDRec。在离线实验中,我们比使用更简单的分类器获得更高的命中率。在用户试验中,与相同的简单分类器相比,参与者对LDRec的总体满意度显着提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
[Title page i] Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers Effective Ant Colony Optimization Solution for the Brazilian Family Health Team Scheduling Problem Exploiting Global Semantic Similarity Biterms for Short-Text Topic Discovery Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1