Sciweavers

119 search results - page 17 / 24
» Comparing the sensitivity of information retrieval metrics
Sort
View
ICML
1997
IEEE
15 years 10 months ago
A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization
The Rocchio relevance feedback algorithm is one of the most popular and widely applied learning methods from information retrieval. Here, a probabilistic analysis of this algorith...
Thorsten Joachims
AUSAI
2009
Springer
15 years 27 days ago
Adapting Spectral Co-clustering to Documents and Terms Using Latent Semantic Analysis
Abstract. Spectral co-clustering is a generic method of computing coclusters of relational data, such as sets of documents and their terms. Latent semantic analysis is a method of ...
Laurence A. F. Park, Christopher Leckie, Kotagiri ...
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
14 years 11 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
15 years 11 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
ICPR
2000
IEEE
15 years 10 months ago
Optimal Color Composition Matching of Images
Color features are among the most important features used in image database retrieval, especially in cases where no additional semantic information is available. Due to its compac...
Jianying Hu, Aleksandra Mojsilovic