1804 search results - page 60 / 361 » Ranking for data repairs |
ECML
2007
Springer
15 years 6 months ago
2007
Springer
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,...
ECIR
2010
Springer
15 years 1 months ago
2010
Springer
Ranking a set retrieval systems according to their retrieval effectiveness without relying on relevance judgments was first explored by Soboroff et al. [13]. Over the years, a numb...
CISS
2008
IEEE
2008
IEEE
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
15 years 6 months ago
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
SIGSOFT
2004
ACM
15 years 5 months ago
2004
ACM
Static program checking tools can find many serious bugs in software, but due to analysis limitations they also frequently emit false error reports. Such false positives can easi...
104
click to vote
DASFAA
2004
IEEE
15 years 3 months ago
2004
IEEE
The information on the World Wide Web is growing without bound. Users may have very diversified preferences in the pages they target through a search engine. It is therefore a chal...