Sciweavers

1804 search results - page 31 / 361
» Ranking for data repairs
Sort
View
EDBTW
2006
Springer
15 years 3 months ago
Preference-Driven Querying of Inconsistent Relational Databases
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowsk...
SMI
2010
IEEE
173views Image Analysis» more  SMI 2010»
14 years 10 months ago
Point Cloud Skeletons via Laplacian Based Contraction
—We present an algorithm for curve skeleton extraction via Laplacian-based contraction. Our algorithm can be applied to surfaces with boundaries, polygon soups, and point clouds....
Junjie Cao, Andrea Tagliasacchi, Matt Olson, Hao Z...
ECIR
1998
Springer
15 years 1 months ago
Independence of Contributing Retrieval Strategies in Data Fusion for Effective Information Retrieval
: In information retrieval, data fusion is a technique for combining the outputs of more than one retrieval strategy which rank documents for retrieval. One of the observations oft...
Alan F. Smeaton
IDA
2005
Springer
15 years 5 months ago
Learning Label Preferences: Ranking Error Versus Position Error
We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by...
Eyke Hüllermeier, Johannes Fürnkranz
AI
2008
Springer
14 years 12 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...