.png){kind=icon}
返回
RANKING DOCUMENTS IN THESAURUS-BASED BOOLEAN RETRIEVAL-SYSTEMS
.png){kind=icon}
OA
AI
DOI：10.1016/0306-4573(94)90025-6.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we investigate document ranking methods in thesaurus-based boolean retrieval systems, and propose a new thesaurus-based ranking algorithm called the Extended Relevance (E-Relevance) algorithm. The E-Relevance algorithm integrates the extended boolean model and the thesaurus-based relevance algorithm. Since the E-Relevance algorithm has all the desirable properties of the extended boolean model, it avoids the various problems of previous thesaurus-based ranking algorithms. The E-Relevance algorithm also ranks documents effectively by using term dependence information from the thesaurus. We have shown through performance comparison that the proposed algorithm achieves higher retrieval effectiveness than the others proposed earlier.
Keyword:
INFORMATION RETRIEVAL
BOOLEAN RETRIEVAL SYSTEM
RANKING ALGORITHM
THESAURUS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
6.9
论文数:
5.2K
被引数:
1.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容