Abstract: We describe our participation in the TREC 2006 Genomics track, in which our main focus was on query expansion. We hypothesized that applying query expansion techniques would help us both to identify and retrieve synonymous terms, and to cope with ambiguity. To this end, we developed several collection-specific as well as web-based strategies. We also performed post-submission experiments, in which we compare various retrieval engines, such as Lucene, Indri, and Lemur, using a simple baseline topicset. When indexing entire paragraphs as pseudodocuments, we find that Lemur is able to achieve the highest document-, passage-, and aspect-level scores, using the KL-divergence method and its default settings. Additionally, we index the c...
This paper describes the techniques we applied for the two tasks of the TREC Genomics track, i.e., a...
Paper presented at the 2006 IEEE International Conference on Systems, Man, and Cybernetics, Taipei,...
Abstract. We propose and evaluate a query expansion mechanism that supports searching and browsing i...
Abstract: We describe our participation in the TREC 2006 Genomics track, in which our main focus was...
Query Expansion is commonly used in Information Retrieval to overcome vocabulary mismatch issues, su...
Our Genomics experiments mainly focus on addressing three major problems in biomedical information ...
This report describes the experiments we have conducted on the ad hoc retrieval task of Genomics tra...
This paper describes our experiments on TREC 2007 Genomics Track which is concerned with question an...
Abstract Query Expansion is a widely used technique that augments a query with synonymous and relate...
This paper describes the methods we used for the Ad Hoc task of TREC Genomics Track. Synonym dictio...
which were detected only some days before the submission deadline, we were not able to submit runs f...
the Genomics and Robust tracks. We also submitted passageretrieval runs for the QA track. For the Ge...
The tremendously huge volume of biomedical literature, scientists' specific information needs, long ...
For our first participation to the TREC evaluation campaign, our efforts concentrated on the genomic...
Introduction University of Tampere submitted runs for Genomics Track ad hoc retrieval task. The fir...
This paper describes the techniques we applied for the two tasks of the TREC Genomics track, i.e., a...
Paper presented at the 2006 IEEE International Conference on Systems, Man, and Cybernetics, Taipei,...
Abstract. We propose and evaluate a query expansion mechanism that supports searching and browsing i...
Abstract: We describe our participation in the TREC 2006 Genomics track, in which our main focus was...
Query Expansion is commonly used in Information Retrieval to overcome vocabulary mismatch issues, su...
Our Genomics experiments mainly focus on addressing three major problems in biomedical information ...
This report describes the experiments we have conducted on the ad hoc retrieval task of Genomics tra...
This paper describes our experiments on TREC 2007 Genomics Track which is concerned with question an...
Abstract Query Expansion is a widely used technique that augments a query with synonymous and relate...
This paper describes the methods we used for the Ad Hoc task of TREC Genomics Track. Synonym dictio...
which were detected only some days before the submission deadline, we were not able to submit runs f...
the Genomics and Robust tracks. We also submitted passageretrieval runs for the QA track. For the Ge...
The tremendously huge volume of biomedical literature, scientists' specific information needs, long ...
For our first participation to the TREC evaluation campaign, our efforts concentrated on the genomic...
Introduction University of Tampere submitted runs for Genomics Track ad hoc retrieval task. The fir...
This paper describes the techniques we applied for the two tasks of the TREC Genomics track, i.e., a...
Paper presented at the 2006 IEEE International Conference on Systems, Man, and Cybernetics, Taipei,...
Abstract. We propose and evaluate a query expansion mechanism that supports searching and browsing i...