Active exploration for learning rankings from clickthrough data

No abstract is available for this paper.

• Publication year

  2007

• Venue

  Knowledge Discovery and Data Mining

• Publication date

  2007-08-12

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1281192.1281254
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Bayesian locally optimal design of knockout tournaments

  2008cited by this paper
• Evaluating the accuracy of implicit feedback from clicks and query reformulations in Web search

  2007cited by this paper
• TrueSkill™: A Bayesian Skill Rating System

  2007cited by this paper
• Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs

  2006cited by this paper
• Loss Function Based Ranking in Two-Stage, Hierarchical Models.

  2006cited by this paper
• TrueSkillTM: A Bayesian Skill Rating System

  2006cited by this paper
• Learning user interaction models for predicting web search result preferences

  2006cited by this paper
• Minimal test collections for retrieval evaluation

  2006cited by this paper
• Preference learning with Gaussian processes

  2005cited by this paper
• Adaptive Paired Comparison Design

  2005cited by this paper
• Learning to rank using gradient descent

  2005influential reference
• Extensions of Gaussian Processes for Ranking : Semi-supervised and Active Learning

  2005cited by this paper
• The Predictive Power of Noisy Elimination Tournaments

  2005cited by this paper
• Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results

  2005cited by this paper
• Query chains: learning to rank from implicit feedback

  2005cited by this paper
• Active Sampling for Class Probability Estimation and Ranking

  2004cited by this paper
• Active learning of label ranking functions

  2004cited by this paper
• An Active Learning Approach to Efficiently Ranking Retrieval An Active Learning Approach to Efficiently Ranking Retrieval Engines Engines

  2003cited by this paper
• MM algorithms for generalized Bradley-Terry models

  2003cited by this paper
• Log-Linear Models for Label Ranking

  2003cited by this paper
• Overview of the TREC-2001 Web track

  2002influential reference
• Optimizing search engines using clickthrough data

  2002cited by this paper
• Large Margin Rank Boundaries for Ordinal Regression

  2000cited by this paper
• Making Rational Decisions Using Adaptive Utility Elicitation

  2000cited by this paper
• Parameter Estimation in Large Dynamic Paired Comparison Experiments

  1999cited by this paper
• Optimum polynomial retrieval functions based on the probability ranking principle

  1989cited by this paper
• The method of paired comparisons

  1966cited by this paper
• RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS THE METHOD OF PAIRED COMPARISONS

  1952cited by this paper
• RANK ANALYSIS OF INCOMPLETE BLOCK DESIGNS

  1952cited by this paper
• Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons

  1952cited by this paper
• [Online Information Services]: Web-based services General Terms

  year unknowncited by this paper

• Comparing social preferences: incompleteness and intransitivity

  2025cites this paper
• Sequential Manipulation Against Rank Aggregation: Theory and Algorithm

  2024cites this paper
• Towards Group-aware Search Success

  2024cites this paper
• Likelihood Ratio Tests in Random Graph Models with Increasing Dimensions

  2023cites this paper
• Recall, Robustness, and Lexicographic Evaluation

  2023cites this paper
• Recall as a Measure of Ranking Robustness

  2023cites this paper
• PrefGen: Preference Guided Image Generation with Relative Attributes

  2023cites this paper
• PAC Top-k Identification under SST in Limited Rounds

  2022cites this paper
• Joint Multisided Exposure Fairness for Recommendation

  2022cites this paper
• Detecting Abrupt Changes in Sequential Pairwise Comparison Data

  2022cites this paper
• Learning Modulo Theories for constructive preference elicitation

  2021cites this paper
• Nonparametric Estimation in the Dynamic Bradley-Terry Model

  2020cites this paper
• Credibility assessment of good abandonment results in mobile search

  2020cites this paper
• Evaluating Stochastic Rankings with Expected Exposure

  2020cites this paper
• Iterative learning to rank from explicit relevance feedback

  2020cites this paper
• ePubWU Institutional Repository

  2019cites this paper
• ePubWU Institutional Repository

  2019cites this paper
• Evaluating Preference Collection Methods for Interactive Ranking Analytics

  2019cites this paper
• Relevance feedback and sparsity handling methods for temporal data (Zamansal veriler için ilgililik geri bildirimi ve seyreklik ele alma metotları)

  2018cites this paper
• Efficient Online Learning under Bandit Feedback

  2018cites this paper
• Diverse Relevance Feedback for Time Series with Autoencoder Based Summarizations

  2018cites this paper
• Learning from ranking data : theory and methods

  2018cites this paper
• The Limits of Maxing, Ranking, and Preference Learning

  2018cites this paper
• As you like it: Localization via paired comparisons

  2018cites this paper
• An ant-colony based approach for real-time implicit collaborative information seeking

  2017cites this paper
• The Impact of Linkage Methods in Hierarchical Clustering for Active Learning to Rank

  2017cites this paper
• Learning Online Trends for Interactive Query Auto-Completion

  2017cites this paper
• Maximum Selection and Ranking under Noisy Comparisons

  2017cites this paper
• Online Learning of Optimally Diverse Rankings

  2017cites this paper
• The geometry of random paired comparisons

  2017cites this paper
• Analysis on Digital Image Re-Ranking Algorithm based on Multi-feature Fusion

  2017cites this paper
• Efficient Selection of Pairwise Comparisons for Computing Top-heavy Rankings

  2017cites this paper
• Latent ranking analysis using pairwise comparisons in crowdsourcing platforms

  2017cites this paper
• Online Learning of Optimally Diverse Rankings

  2017cites this paper
• Bandits multi-armés avec rétroaction partielle

  2017cites this paper
• Click-based Hot Fixes for Underperforming Torso Queries

  2016cites this paper
• Learning to rank with click-through features in a reinforcement learning framework

  2016cites this paper
• Localizing users and items from paired comparisons

  2016cites this paper
• Worst Practices for Designing Production Information Access Systems

  2016cites this paper
• Compression-Based Selective Sampling for Learning to Rank

  2016cites this paper
• Passive and Active Ranking from Pairwise Comparisons

  2016cites this paper
• Binary stable embedding via paired comparisons

  2016cites this paper
• Online training of concept detectors for image retrieval using streaming clickthrough data

  2016cites this paper
• Structured Stochastic Bandits

  2016cites this paper
• Institutional Repository

  2016cites this paper
• Personalization in online services measurement, analysis, and implications

  2016cites this paper
• Progressive Comparison for Ranking Estimation

  2016cites this paper
• Implications of Computational Cognitive Models for Information Retrieval

  2016cites this paper
• Utility-based Dueling Bandits as a Partial Monitoring Game

  2015cites this paper
• On the Complexity of Evaluating Order Queries with the Crowd

  2015cites this paper
• Learning to Rank

  2015cites this paper
• A Case Study of User Behavior in Information Retrieval

  2015cites this paper
• A Relative Exponential Weighing Algorithm for Adversarial Utility-based Dueling Bandits

  2015cites this paper
• Learning Modulo Theories for preference elicitation in hybrid domains

  2015cites this paper
• pubmed.mineR: An R package with text-mining algorithms to analyse PubMed abstracts

  2015cites this paper
• Interactive Learning of Pattern Rankings

  2014cites this paper
• Hi-Tech: динамика взаимодействий науки и образования

  2014cites this paper
• Optimally selecting and combining assessment and assessor types for information retrieval evaluation

  2014cites this paper
• Top-k and Clustering with Noisy Comparisons

  2014cites this paper
• Condensing Information: from Supervised to Crowdsourced Learning

  2014cites this paper
• A Two‐stage active learning method for learning to rank

  2014cites this paper
• Improving ranking of webpages using user behaviour, a Genetic algorithm approach

  2014cites this paper
• Learning to Rank Using Implicit Feedback and Active Exploration

  2014influential citation
• Latent Ranking Analysis Using Pairwise Comparisons

  2014cites this paper
• Robust ordinal regression in preference learning and ranking

  2013cites this paper
• A Learning Approach to SQL Query Results Ranking Using Skyline and Users' Current Navigational Behavior

  2013cites this paper
• Active Preference Learning for Ranking Patterns

  2013cites this paper
• Enriching Documents with Examples: A Corpus Mining Approach

  2013cites this paper
• Mining search and browse logs for web search

  2013cites this paper
• Learning a Concept Based Ranking Model with User Feedback

  2013cites this paper
• The "Human Sensor: " Bridging Between Human Data and Services

  2013cites this paper
• Integrating User Preferences Into Distance Metrics

  2013cites this paper
• Incorporating user preferences into click models

  2013cites this paper
• Annotation for free: video tagging by mining user search behavior

  2013cites this paper
• A document rating system for preference judgements

  2013cites this paper
• Active evaluation of ranking functions based on graded relevance

  2012cites this paper
• A VERTICAL META SEARCH ENGINE WITH QUERY EXPANSION USING ARTIFICIAL RELEVANCE FEEDBACK MECHANISM

  2012cites this paper
• ClickRank: Learning Session-Context Models to Enrich Web Search Ranking

  2012cites this paper
• A Mouse-Trajectory Based Model for Predicting Query-URL Relevance

  2012cites this paper
• Ranking Popular Items By Naive Bayes Algorithm

  2012cites this paper
• Analysis of Instant Search Query Logs ( Full Version )

  2012cites this paper
• Aprendizado ativo para ordenação de resultados

  2012cites this paper
• An Online Learning Framework for Refining Recency Search Results with User Click Feedback

  2012cites this paper
• Active Exploration to Improve Learning Rate from Click through Data.

  2012influential citation
• A penny for your thoughts ? The value of information in recommendation systems

  2011cites this paper
• Balancing Exploration and Exploitation in Learning to Rank Online

  2011cites this paper
• Discovering missing click-through query language information for web search

  2011cites this paper
• Diversity in ranking via resistive graph centers

  2011cites this paper
• Beat the Mean Bandit

  2011cites this paper
• Improving local search ranking through external logs

  2011cites this paper
• Active Learning of Combinatorial Features for Interactive Optimization

  2011cites this paper
• Evaluating new search engine configurations with pre-existing judgments and clicks

  2011influential citation
• Detecting duplicate web documents using clickthrough data

  2011cites this paper
• Discovering and using implicit data for information retrieval

  2011cites this paper
• Enriching Query Flow Graphs with Click Information

  2011cites this paper
• Active learning to maximize accuracy vs. effort in interactive information retrieval

  2011cites this paper
• A task level metric for measuring web search satisfaction and its application on improving relevance estimation

  2011cites this paper
• New Learning Frameworks for Information Retrieval

  2011cites this paper
• Smoothing Click Counts for Aggregated Vertical Search

  2011cites this paper
• Detecting Multilingual and Multi-Regional Query Intent in Web Search

  2011cites this paper