Sciweavers

540 search results - page 25 / 108
» Ranking with Uncertain Scores
Sort
View
WWW
2006
ACM
16 years 14 days ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
ECML
2003
Springer
15 years 5 months ago
Pairwise Preference Learning and Ranking
We consider supervised learning of a ranking function, which is a mapping from instances to total orders over a set of labels (options). The training information consists of exampl...
Johannes Fürnkranz, Eyke Hüllermeier
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 2 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
ECIR
2007
Springer
15 years 1 months ago
Results Merging Algorithm Using Multiple Regression Models
: This paper describes a new algorithm for merging the results of remote collections in a distributed information retrieval environment. The algorithm makes use only of the ranks o...
Georgios Paltoglou, Michail Salampasis, Maria Satr...
ECML
2007
Springer
15 years 6 months ago
A Simple Lexicographic Ranker and Probability Estimator
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
Peter A. Flach, Edson Takashi Matsubara