基于链接数据的推荐系统特征选择中的模式总结

A. Ragone, Paolo Tomeo, Corrado Magarelli, T. D. Noia, M. Palmonari, A. Maurino, E. Sciascio
{"title":"基于链接数据的推荐系统特征选择中的模式总结","authors":"A. Ragone, Paolo Tomeo, Corrado Magarelli, T. D. Noia, M. Palmonari, A. Maurino, E. Sciascio","doi":"10.1145/3019612.3019837","DOIUrl":null,"url":null,"abstract":"Recommender systems are emerging as an interesting application scenario for Linked Data (LD). In fact, by exploiting the knowledge encoded in LD datasets, a new generation of semantics-aware recommendation engines have been developed in the last years. As Linked Data is often very rich and contains many information that may result irrelevant and noisy for a recommendation task, an initial step of feature selection is always required in order to select the most meaningful portion of the original dataset. Many approaches have been proposed in the literature for feature selection that exploit different statistical dimensions of the original data. In this paper we investigate the role of the semantics encoded in an ontological hierarchy when exploited to select the most relevant properties for a recommendation task. In particular, we compare an approach based on schema summarization with a \"classical\" one, i.e., Information Gain. We evaluated the performance of the two methods in terms of accuracy and aggregate diversity by setting up an experimental testbed relying on the Movielens dataset.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Schema-summarization in linked-data-based feature selection for recommender systems\",\"authors\":\"A. Ragone, Paolo Tomeo, Corrado Magarelli, T. D. Noia, M. Palmonari, A. Maurino, E. Sciascio\",\"doi\":\"10.1145/3019612.3019837\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recommender systems are emerging as an interesting application scenario for Linked Data (LD). In fact, by exploiting the knowledge encoded in LD datasets, a new generation of semantics-aware recommendation engines have been developed in the last years. As Linked Data is often very rich and contains many information that may result irrelevant and noisy for a recommendation task, an initial step of feature selection is always required in order to select the most meaningful portion of the original dataset. Many approaches have been proposed in the literature for feature selection that exploit different statistical dimensions of the original data. In this paper we investigate the role of the semantics encoded in an ontological hierarchy when exploited to select the most relevant properties for a recommendation task. In particular, we compare an approach based on schema summarization with a \\\"classical\\\" one, i.e., Information Gain. We evaluated the performance of the two methods in terms of accuracy and aggregate diversity by setting up an experimental testbed relying on the Movielens dataset.\",\"PeriodicalId\":20728,\"journal\":{\"name\":\"Proceedings of the Symposium on Applied Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Symposium on Applied Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3019612.3019837\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3019612.3019837","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

摘要

推荐系统正在成为关联数据(LD)的一个有趣的应用场景。事实上,通过利用编码在LD数据集中的知识,新一代的语义感知推荐引擎在过去几年中已经被开发出来。由于关联数据通常非常丰富,并且包含许多可能导致推荐任务不相关和有噪声的信息,因此总是需要进行特征选择的初始步骤,以便选择原始数据集中最有意义的部分。文献中提出了许多利用原始数据的不同统计维度进行特征选择的方法。在本文中,我们研究了本体层次结构中编码的语义在为推荐任务选择最相关属性时的作用。特别地,我们将基于模式总结的方法与“经典”方法(即信息增益)进行了比较。我们基于Movielens数据集建立了一个实验测试平台,从准确性和聚合多样性两方面对两种方法的性能进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Schema-summarization in linked-data-based feature selection for recommender systems
Recommender systems are emerging as an interesting application scenario for Linked Data (LD). In fact, by exploiting the knowledge encoded in LD datasets, a new generation of semantics-aware recommendation engines have been developed in the last years. As Linked Data is often very rich and contains many information that may result irrelevant and noisy for a recommendation task, an initial step of feature selection is always required in order to select the most meaningful portion of the original dataset. Many approaches have been proposed in the literature for feature selection that exploit different statistical dimensions of the original data. In this paper we investigate the role of the semantics encoded in an ontological hierarchy when exploited to select the most relevant properties for a recommendation task. In particular, we compare an approach based on schema summarization with a "classical" one, i.e., Information Gain. We evaluated the performance of the two methods in terms of accuracy and aggregate diversity by setting up an experimental testbed relying on the Movielens dataset.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信