Snippet-based result merging in federated search

被引:2
作者
Garba, Adamu [1 ]
Wu, Shangli [1 ]
机构
[1] Jiangsu Univ, Sch Comp Sci & Commun Engn, Zhenjiang 212013, Peoples R China
关键词
Distributed information retrieval; federated search; result merging; term weighting scheme; snippet; uncooperative environment; COLLECTION SELECTION;
D O I
10.1177/01655515221144864
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In federated search, the central broker simultaneously forwards the search query to multiple resources. The returned results from those resources are then merged into a single ranked list. An autonomous resource in a federated search system usually does not provide scores for the retrieved documents; even if some of them do, scores from different resources are incomparable due to the heterogeneity in many aspects of those resource involved such as retrieval models and corpus statistics. Many results merging approaches have been proposed in the literature to deal with this problem. However, to the best of our knowledge, none of them has utilised snippets. This article proposes a snippet-based weighting scheme for the query terms involved. It quantifies the importance of each query term from two angles: the frequency of the term and the part in which the term occurs inside a snippet. Three parts - which are URL, title, and description - are given different weights. Experiments are conducted with the TREC 2013 FedWeb data set. The results show that the proposed methods consistently outperform several baseline models. We also find in many instances, a further small slight performance improvement is achievable by an extra measure of weighting each of the resources involved, which can be done in the phase of resource selection.
引用
收藏
页数:15
相关论文
共 35 条
  • [1] [Anonymous], 2013, OVERVIEW TREC 2013 F
  • [2] The FedLemur project: Federated search in the real world
    Avrahami, TT
    Yau, L
    Si, L
    Callan, J
    [J]. JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2006, 57 (03): : 347 - 358
  • [3] Bellogin A., 2013, P TEXT RETRIEVAL C
  • [4] Callan J, 2000, KLUW S INF, V7, P127
  • [5] Query-based sampling of text databases
    Callan, J
    Connell, M
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2001, 19 (02) : 97 - 130
  • [6] Clarke Charles L.A., 2008, P SIGIR 08, P659, DOI [DOI 10.1145/1390334, 10.1145/1390334.1390446, DOI 10.1145/1390334.1390446]
  • [7] Reciprocal Rank Fusion outperforms Condorcet and Individual Rank Learning Methods
    Cormack, Gordon V.
    Clarke, Charles L. A.
    Buettcher, Stefan
    [J]. PROCEEDINGS 32ND ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2009, : 758 - 759
  • [8] Craswell N., 1999, Proceedings of the Tenth Austrlasian Database Conference, P189
  • [9] Demeester T., 2014, OVERVIEW TREC 2014 F
  • [10] DiBuccio E, 2014, U PADUA TREC 2014 FE