| 摘要: |
| 分布式信息检索的文档集合划分方案的评价是一个困难的问题,目前还没有良好的评价标准.从文档集合划分问题本身出发,给出了两个划分模型来刻画文档集合划分问题,从而使这两个模型可以作为文档集合划分的有效评价指标.在此基础上,提出了一种类Huffman编码的模型快速求解算法,可以求出在给定查询测试集情况下的最优文档划分方案,该方案可以作为其他文档划分方案的参考.实验表明,两个文档划分模型可以成为有效的文档集合划分评价标准. |
| 关键词: 分布式信息检索 文档集合划分 Huffman编码 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Basic Research Program of China under Grant No.2004CB318109 (国家重点基础研究发展计划(973)) |
|
| Document Collection Partition Evaluation in Distributed Information Retrieval |
|
ZHANG Gang,TAN Jian-Long
|
| Abstract: |
| It is difficult to evaluate the document collection partition in distributed information retrieval. Recently, there is no clear evaluation criterion for the document collection partition problem. In this paper, two partition models are built to formulate the document collection partition problem from the essence of the problem itself and they can be used as the evaluation criterion of the document collection partition problem. A Huffman_encoding_like algorithm is introduced to compute the optimum partition solution given a test query set. The optimum partition solution is a good reference of other partition solution. The experimental results show that the two models are effective document collection partition evaluation criteria. |
| Key words: distributed information retrieval document collection partition Huffman code |
