Results 281 to 290 of about 13,396 (303)
Some of the next articles are maybe not open access.
2011
At the heart of many effective approaches to the core information retrieval problem-identifying relevant content-lies the following three-fold strategy: obtaining content based matches, inferring additional ranking criteria and constraints, and combining all of the above so as to arrive at a single ranking of retrieval units.
Hofmann, K., Whiteson, S., de Rijke, M.
openaire +3 more sources
At the heart of many effective approaches to the core information retrieval problem-identifying relevant content-lies the following three-fold strategy: obtaining content based matches, inferring additional ranking criteria and constraints, and combining all of the above so as to arrive at a single ranking of retrieval units.
Hofmann, K., Whiteson, S., de Rijke, M.
openaire +3 more sources
Different Rankers on Different Subcollections
2015Recent work has shown that when documents in a TREC ad hoc collection are partitioned, different rankers will perform optimally on different partitions. This result suggests that choosing different highly effective rankers for each partition and merging the results, should be able to improve overall effectiveness.
Jones, Timothy +4 more
openaire +2 more sources
Multilabel Ranking with Inconsistent Rankers
2014 IEEE Conference on Computer Vision and Pattern Recognition, 2014While most existing multilabel ranking methods assume the availability of a single objective label ranking for each instance in the training set, this paper deals with a more common case where subjective inconsistent rankings from multiple rankers are associated with each instance.
Xin Geng, Longrun Luo
openaire +1 more source
Contrasting Neural Click Models and Pointwise IPS Rankers
2023Inverse-propensity scoring and neural click models are two popular methods for learning rankers from user clicks that are affected by position bias. Despite their prevalence, the two methodologies are rarely directly compared on equal footing. In this work, we focus on the pointwise learning setting to compare the theoretical differences of both ...
Philipp Hager +2 more
openaire +2 more sources
Optimizing Base Rankers Using Clicks
2014We study the problem of optimizing an individual base ranker using clicks. Surprisingly, while there has been considerable attention for using clicks to optimize linear combinations of base rankers, the problem of optimizing an individual base ranker using clicks has been ignored.
Anne Schuth +3 more
openaire +1 more source
Learning a Fast Bipartite Ranker for Text Documents Using Lexicographical Rankers and ROC Curves
2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR), 2017The design of powerful learning methods for addressing huge amounts of unstructured data, such as text documents, is a fundamental problem within the document analysis and recognition community. In this work, we propose FlexRank, a specially designed bipartite ranking algorithm for text documents using lexicographical ordering. FlexRank is based on the
Lucas de Souza Rodrigues +2 more
openaire +1 more source
Active query selection for learning rankers
Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, 2012Methods that reduce the amount of labeled data needed for training have focused more on selecting which documents to label than on which queries should be labeled. One exception to this (Long et al. 2010) uses expected loss optimization (ELO) to estimate which queries should be selected but is limited to rankers that predict absolute graded relevance ...
Mustafa Bilgic, Paul N. Bennett
openaire +1 more source
Who Ranks the University Rankers?
Science, 2007Everyone would like to score well in an academic beauty contest. But is it really possible to assess an institution9s worth?
openaire +1 more source
LEARning Next gEneration Rankers (LEARNER 2017)
Proceedings of the ACM SIGIR International Conference on Theory of Information Retrieval, 2017The aim of LEARNER@ICTIR2017 is to investigate new solutions for LtR. In details, we identify some research areas related to LtR which are of actual interest and which have not been fully explored yet. We solicit the submission of position papers on novel LtR algorithms, on evaluation of LtR algorithms, on dataset creation and curation, and on domain ...
Ferro, Nicola +3 more
openaire +5 more sources
This report documents the design and implementation of the Exo-Habitability-Ranker, a web application that ranks known exoplanets by a computed habitability score using the TOPSIS method. We detail data ingestion from the NASA Exoplanet Archive, preprocessing steps including feature selection and normalization, implementation of the TOPSIS algorithm ...
openaire +1 more source
openaire +1 more source