Unsupervised object ranking using not even weak experts

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many problems, like feature selection, involve evaluating objects while ignoring the relevant underlying properties that determine their true value. Generally, an heuristic evaluating device (e.g. filter, wrapper, etc) is then used with no guarantee on the result. We show in this paper how a set of experts (evaluation function of the objects), not even necessarily weakly positively correlated with the unknown ideal expert, can be used to dramatically improve the accuracy of the selection of positive objects, or of the resulting ranking. Experimental results obtained on both synthetic and real data confirm the validity of the approach. General lessons and possible extensions are discussed. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Cornuéjols, A., & Martin, C. (2011). Unsupervised object ranking using not even weak experts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7062 LNCS, pp. 608–616). https://doi.org/10.1007/978-3-642-24955-6_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free