Redundancy-Based Trust in Question-Answering Systems

被引：0

作者：

Atkinson, John ^{[1
]}

Maurelia, Alvaro ^{[2
]}

机构：

[1] Univ Adolfo Ibanez, Fac Sci & Engn, Santiago, Region Metropol, Chile

[2] TecNova, Santiago, Region Metropol, Chile

来源：

COMPUTER | 2017年 / 50卷 / 01期

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

By combining user preferences, redundancy analysis, and trust-network inference, the proposed trust model can augment candidate answers with information about target sources on the basis of connections with other web users and sources. Experiments show that the model is more effective overall than trust analyses based on inference alone.

引用

页码：58 / 65

页数：8

共 13 条

[1] [Anonymous], VLDB
[2] Constantine PG, 2007, LECT NOTES COMPUT SC, V4863, P82
[3] Cruchet S., 2009, P ANN S AM MED INF A
[4] A proof markup language for Semantic Web services
da Silva, PP
McGuinness, DL
Fikes, R
[J]. INFORMATION SYSTEMS, 2006, 31 (4-5) : 381 - 395
[5] Named Entity Recognition in Query
Guo, Jiafeng
Xu, Gu
Cheng, Xueqi
Li, Hang
[J]. PROCEEDINGS 32ND ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2009, : 267 - 274
[6] Gupta M., 2011, ACM SIGKDD Explorations Newsletter, V13, P54, DOI DOI 10.1145/2031331.2031341
[7] Gupta Manish., 2011, Proceedings of the 20th international conference companion on World wide web, P53
[8] Shin: Generalized Trust Propagation with Limited Evidence
Hang, Chung-Wei
Zhang, Zhe
Singh, Munindar P.
[J]. COMPUTER, 2013, 46 (03) : 78 - 85
[9] Knap T., 2011, P 8 ACM INT C UB INT, P252
[10] Knap T. T., 2010, QDB, P1

← 1 2 →