基于文档关系改进的向量空间模型  

Improved vector space model based on document relationships

作　　者：何丹丹 吴树芳[2] 徐建民 HE Dandan;WU Shufang;XU Jianmin(College of Cyberspace Security and Computer,Hebei University,Baoding 071002,China;School of Management,Hebei University,Baoding 071002,China)

机构地区：[1]河北大学网络空间安全与计算机学院,河北保定071002 [2]河北大学管理学院,河北保定071002

出　　处：《河北大学学报（自然科学版）》2020年第3期322-327,共6页Journal of Hebei University(Natural Science Edition)

基　　金：国家社科基金后期资助项目(17FTQ002)。

摘　　要：由于用户查询信息不足而导致传统向量空间模型检索结果不够准确,针对此问题,提出了一种基于文档关系改进的向量空间模型.改进模型将初始检索结果中排名靠前的高相关文档组成基准集,通过计算初始检索结果集中每篇文档与基准集的相似度,来修正原模型中文档与查询的相似度,实现对检索结果的重排序,从而实现对向量空间模型的改进.实验结果表明:与传统向量空间模型相比,改进模型使得相关文档排名更合理,在保证召回率的条件下提高了准确率.Due to insufficient user query information,the retrieval results of traditional vector space model are not accurate enough.To solve this problem,an improved vector space model based on document relationship is proposed.The improved model combines the related documents ranked first in the initial retrieval results into a benchmark set.By calculating the similarity between each document in the initial retrieval result set and the benchmark set,the similarity between documents and queries in the original model and reorder the retrieval results is corrected,thus improving the vector space model.The experimental results show that,compared with the traditional vector space model,the improved model makes the ranking of related documents more reasonable and improves the precision while ensuring the recall rate.

关 键 词：文档关系 向量空间模型 文档相似度 信息检索 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]