一种基于权重矩阵的临近词检索问题解决框架  

Weigh Matrix Based Solution Framework for Term Proximity Information Retrieval

作　　者：乔亚男[1] 齐勇[1] 史椸[1] 侯迪[1] 王晓[2] 

机构地区：[1]西安交通大学电信学院计算机系,西安710049 [2]第四军医大学唐都医院,西安710038

出　　处：《计算机科学》2009年第7期197-201,共5页Computer Science

基　　金：863基金项目(2006AA01Z101);教育部博士点基金(20060698018);陕西省科技攻关项目(2006K04-G23)资助

摘　　要：传统的信息检索模型假设查询中的关键词之间是并列关系,但用户的需求往往应该被抽象为一系列的关键词组,组内的关键词间具有更为紧密的语义关系,这就是定义的临近词检索问题。提出了基于权重矩阵的临近词检索问题解决框架,该框架将文档和查询抽象化为文档的权重矩阵表示和查询权重矩阵,通过计算两个矩阵间的相似度来实现临近词检索。实验结果证明,针对临近词检索问题,传统的信息检索模型只是一种简化问题的解决方案,权重矩阵框架从理论上和形式上更加契合临近词检索问题,查准率得到了显著的提高。Tradional information retrieval models assume that keywords in queries are parallel, but the requirements of users should be abstracted to a series of keywords groups, and the sematic relations of keywords inside the group are closer than outside. This is ＂Term Proximity Information Retrieval＂ （TPIR） defined in this paper, and we presented a solution framework based on Weigh Matrix（WMSF）. WMSF abstractes documents and queries to Weigh Matrix Representation of Document and Query Weigh Matrix, and then implements the TPIR based on the caculating of similarity between them. Empirical results show that WMSF is appropriate for TPIR compared with traditional information retrieval models which simplify the TPIR problems actually.

关 键 词：信息检索 权重矩阵 向量空间模型 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术] TP183[自动化与计算机技术—计算机科学与技术]