Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Elbio Renato Torres Abib

dblp:47/7848 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 62% Machine learning and data management · 38%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › ranking
learning to rank
0.112010
Improving quality of training data for learning to rank using click-through data · WSDM 2010
Machine learning and data management
training data quality
0.112010
Improving quality of training data for learning to rank using click-through data · WSDM 2010
Information retrieval › user behavior › search behavior
click model
0.012010
Improving quality of training data for learning to rank using click-through data · WSDM 2010
Information retrieval › query log analysis
clickthrough data
0.012010
Improving quality of training data for learning to rank using click-through data · WSDM 2010

Methods — techniques the papers use, named apart from their topics

sequential dependency model · 0.1full dependency model · 0.1
YearPublicationVenuePosition
2010 Improving quality of training data for learning to rank using click-through data
abstract
In information retrieval, relevance of documents with respect to queries is usually judged by humans, and used in evaluation and/or learning of ranking functions. Previous work has shown that certain level of noise in relevance judgments has little effect on evaluation, especially for comparison purposes. Recently learning to rank has become one of the major means to create ranking models in which the models are automatically learned from the data derived from a large number of relevance judgments. As far as we know, there was no previous work about quality of training data for learning to rank, and this paper tries to study the issue. Specifically, we address three problems. Firstly, we show that the quality of training data labeled by humans has critical impact on the performance of learning to rank algorithms. Secondly, we propose detecting relevance judgment errors using click-through data accumulated at a search engine. Two discriminative models, referred to as sequential dependency model and full dependency model, are proposed to make the detection. Both models consider the conditional dependency of relevance labels and thus are more powerful than the conditionally independent model previously proposed for other tasks. Finally, we verify that using training data in which the errors are detected and corrected by our method, we can improve the performance of learning to rank algorithms.
Jingfang Xu, Chuanliang Chen, Gu Xu, Hang Li 0001, Elbio Renato Torres Abib
WSDM5