Sciweavers

5643 search results - page 74 / 1129
» Retrieval Evaluation in Practice
Sort
View
JCDL
2006
ACM
71views Education» more  JCDL 2006»
15 years 3 months ago
Using controlled query generation to evaluate blind relevance feedback algorithms
Currently in document retrieval there are many algorithms each with different strengths and weakness. There is some difficulty, however, in evaluating the impact of the test quer...
Chris Jordan, Carolyn R. Watters, Qigang Gao
CIKM
2009
Springer
15 years 4 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
CLEF
2011
Springer
13 years 9 months ago
Towards a Living Lab for Information Retrieval Research and Development - A Proposal for a Living Lab for Product Search Tasks
Abstract. The notion of having a “living lab” to undertaken evaluations has been proposed by a number of proponents within the field of Information Retrieval (IR). However, wh...
Leif Azzopardi, Krisztian Balog
WEA
2005
Springer
138views Algorithms» more  WEA 2005»
15 years 3 months ago
A Practical Minimal Perfect Hashing Method
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Zi...
AAAI
2004
14 years 11 months ago
The Practice of Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
Meinolf Sellmann