首页> 外文会议>International Conference on Advances in Semantic Processing >News Curation Service using Semantic Graph Matching
【24h】

News Curation Service using Semantic Graph Matching

机译:使用语义图匹配的新闻策策

获取原文

摘要

In recent years, "News Curation Services" that recommend news articles on the Internet to users are getting attention. In this paper, we propose a news curation service that collects and recommends "news articles" that users feel interested by using semantic relationships between terms in the articles. We define "interested" news articles as articles that users have curiosity and serendipity. The semantic relations between events terms are represented by Linked Data. We create News Articles Linked Data (candidates for recommendation to users) and User's preferences Linked Data (users' preferences). In order to recommend news articles to users, we first search common subgraphs between two kinds of Linked Data. The experiment showed that the curiosity score is 3.30 (min:0, max:4), and the serendipity score is 2.93 in our approach, although a baseline method showed the curiosity score is 3.03, and the serendipity score is 2.79. Thus, we confirmed that our approach is more effective than the baseline method.
机译:近年来,“新闻策展服务”推荐关于互联网的新闻文章给用户受到关注。在本文中,我们提出了一项新闻策展服务,收集和推荐“新闻文章”,用户感到兴趣的是在文章中使用术语之间的语义关系。我们将“兴趣”的新闻文章定义为用户有好奇心和偶然性的文章。事件术语之间的语义关系由链接数据表示。我们创建新闻文章链接数据(向用户推荐的候选人)和用户的首选项链接数据(用户的首选项)。要向用户推荐新闻文章,我们首先在两种链接数据之间搜索常见的子图。实验表明,奇异评分为3.30(min:0,最大:4),并且在我们的方法中,Serencity得分为2.93,尽管基线方法显示了效力得分为3.03,但偶数评分为2.79。因此,我们确认我们的方法比基线方法更有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号