Semantics-Based News Delivering Service

被引:1
作者
Yokoo, Ryohei [1 ]
Kawamura, Takahiro [1 ]
Ohsuga, Akihiko [1 ]
机构
[1] Univ Electrocommun, Grad Sch Informat Syst, Tokyo 1828585, Japan
关键词
Relation extraction; Linked Data; news delivering service;
D O I
10.1142/S1793351X1640016X
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a semantic computing application for a news delivering service collects and recommends news articles which user feels interested in based on semantic relations between terms in the articles. We define interested articles as the ones that users have curiosity and serendipity. The semantic relations between terms are represented by graphs of Linked Data. We first create News Articles Linked Data, which are news articles for recommendation to users and User's preferences Linked Data created from the users' preferred articles. Then, common subgraphs between two graphs are searched for the recommendation of news articles. The experiment showed that the curiosity score is 3.30 (min:0, max:4), and the serendipity score is 2.93 in our approach, but a baseline method indicated the curiosity score: 3.03 and the serendipity score: 2.79. Thus, we confirmed that our approach is more effective than the baseline method. In the future, we will deploy our semantic technology to practical use for automatically delivering information selected from a vast amount of news sources.
引用
收藏
页码:445 / 459
页数:15
相关论文
共 20 条
[1]  
Bunescu R., 2006, P EACL, V6, P9
[2]  
Capelle M., 2013, P 28 ANN ACM S APPL, P296
[3]  
Elahi N., 2013, P INT C INF INT WEB, P68
[4]  
Hoffart J., 2011, P 2011 C EMP METH NA, P782, DOI DOI 10.3115/V1/D11-1072
[5]  
Jntema W. I., 2010, P 2010 EDBT ICDT WOR
[6]  
Kaneko T, 2012, INT C PATT RECOG, P2792
[7]  
Khrouf H, 2013, P 7 ACM C RECOMMENDE, P185, DOI [10.1145/2507157.2507171, DOI 10.1145/2507157.2507171]
[8]  
Kudo T, CABOCHA YET ANOTHER
[9]  
Kudo T., MECAB YET ANOTHER PA
[10]  
Lafferty JD, 2001, ICML, P282