Key-Tree:一种增强目录索引接口有限查询能力的方法  

Key-Tree: An Approach for Enhancing Queriability of Form-Based Interface

作　　者：贺凡[1] 杨晓春[1] 于戈[1] 李琳[1] 石磊[1] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110004

出　　处：《计算机科学》2004年第10期126-130,共5页Computer Science

基　　金：国家自然科学基金(60163051)

摘　　要：限于目录索引接口的查询能力,为了优化采用这种接口的信息查询系统,讨论了通用的基于目录索引的信息查询系统,提出一种优化算法通过对查询条件和查询结果进行分析、提取,构造出相关文档的关键字树,并基于关键字树对查询进行重写,生成由关键字组成的新的查询序列,使用生成的关键字序列重新搜索文档,比较两次查询结果并对其进行优先级排序,输出优化后的查询结果。实验结果证明本文提出的查询优化方法能够获得具有更高查全率(re-call)和查准率(precision)的查询结果。Web users often post queries through form-based interfaces on the Web to retrieve data from the Web; however, answers to these queries are mostly computed according to keywords entered into different fields special in a query interface, and their precision and recall could be low. An enhancement in answering this type of queries can be achieved by considering closely related, previous queries submitted through the same interface, along with their answers. In this paper,we present an approach for enhancing the retrieval of other relevant answers to a form-based Web query using previous, relevant queries and their answers. Experimental results show that our query-rewriting approach achieves higher average for precision and recall.

关 键 词：目录索引 接口 查询结果 查询条件 文档 查询优化 关键字 能力 查准率 查全率 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论] TP392[自动化与计算机技术—计算机科学与技术]