摘要
传统的检索模型同时被不准确不完全的查询结果和不一致的文档相关性所困扰。基于这种现状,文章提出了一种基于向量空间模型个性化搜索算法,设计了一个能够可执行个性化搜索进程,以适应不同用户需求的检索系统。最后还给出了两种实现算法的比较。
The traditional retrieval models were worried by inexact incomplete search result and inconsistent document relativity. Based on such actuality; the vector space model based individuation search algorithm is put forward by this paper. A executable individuation retrieval process is designed to adapt search system for the requirements of vary users. In the end; the comparison for two different realization algorithms is given.
出处
《微电子学与计算机》
CSCD
北大核心
2003年第11期52-55,共4页
Microelectronics & Computer