274 search results - page 7 / 55 » Ranking with Uncertain Labels |
172
click to vote
ICML
2009
IEEE
16 years 22 days ago
2009
IEEE
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...
153
click to vote
ECML
2006
Springer
15 years 9 months ago
2006
Springer
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...
145
click to vote
COLING
2010
15 years 28 days ago
2010
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...
166
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
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...
258
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
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...