Sciweavers

274 search results - page 7 / 55
» Ranking with Uncertain Labels
Sort
View
ICML
2009
IEEE
14 years 3 months ago
Decision tree and instance-based learning for label ranking
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
Weiwei Cheng, Jens C. Huhn, Eyke Hüllermeier
ECML
2006
Springer
14 years 17 days ago
A Selective Sampling Strategy for Label Ranking
Abstract. We propose a novel active learning strategy based on the compression framework of [9] for label ranking functions which, given an input instance, predict a total order ov...
Massih-Reza Amini, Nicolas Usunier, Françoi...
COLING
2010
13 years 3 months ago
The Role of Queries in Ranking Labeled Instances Extracted from Text
A weakly supervised method uses anonymized search queries to induce a ranking among class labels extracted from unstructured text for various instances. The accuracy of the extrac...
Marius Pasca
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 1 months ago
MashRank: Towards uncertainty-aware and rank-aware mashups
Mashups are situational applications that build data flows to link the contents of multiple Web sources. Often times, ranking the results of a mashup is handled in a materializethe...
Mohamed A. Soliman, Mina Saleeb, Ihab F. Ilyas
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 9 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...