Sciweavers

25 search results - page 4 / 5
» Theoretical benchmarks of XML retrieval
Sort
View
IR
2010
13 years 4 months ago
Gradient descent optimization of smoothed information retrieval metrics
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
Olivier Chapelle, Mingrui Wu
FLAIRS
2000
13 years 7 months ago
Fundamental Properties of the Core Matching Functions for Information Retrieval
Traditional benchmarking methods for information retrieval (IR) are based on experimental performance evaluation. Although the metrics precision and recall can measure the perform...
Dawei Song, Kam-Fai Wong, Peter Bruza, Chun Hung C...
ISMIR
2001
Springer
100views Music» more  ISMIR 2001»
13 years 10 months ago
Efficient Multidimensional Searching Routines
The problem of Music Information Retrieval can often be formalized as “searching for multidimensional trajectories”. It is well known that string-matching techniques provide r...
Josh Reiss
SIGIR
2004
ACM
13 years 11 months ago
Belief revision for adaptive information retrieval
Applying Belief Revision logic to model adaptive information retrieval is appealing since it provides a rigorous theoretical foundation to model partiality and uncertainty inheren...
Raymond Y. K. Lau, Peter Bruza, Dawei Song
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 3 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl