Minimizing Time-to-Rank: A Learning and Recommendation Approach

by   Haoming Li, et al.

Consider the following problem faced by an online voting platform: A user is provided with a list of alternatives, and is asked to rank them in order of preference using only drag-and-drop operations. The platform's goal is to recommend an initial ranking that minimizes the time spent by the user in arriving at her desired ranking. We develop the first optimization framework to address this problem, and make theoretical as well as practical contributions. On the practical side, our experiments on Amazon Mechanical Turk provide two interesting insights about user behavior: First, that users' ranking strategies closely resemble selection or insertion sort, and second, that the time taken for a drag-and-drop operation depends linearly on the number of positions moved. These insights directly motivate our theoretical model of the optimization problem. We show that computing an optimal recommendation is NP-hard, and provide exact and approximation algorithms for a variety of special cases of the problem. Experimental evaluation on MTurk shows that, compared to a random recommendation strategy, the proposed approach reduces the (average) time-to-rank by up to 50


page 1

page 2

page 3

page 4


Exact-K Recommendation via Maximal Clique Optimization

This paper targets to a novel but practical recommendation problem named...

Alleviating the recommendation bias via rank aggregation

The primary goal of a recommender system is often known as "helping user...

Sample-Rank: Weak Multi-Objective Recommendations Using Rejection Sampling

Online food ordering marketplaces are multi-stakeholder systems where re...

A Joint Two-Phase Time-Sensitive Regularized Collaborative Ranking Model for Point of Interest Recommendation

The popularity of location-based social networks (LBSNs) has led to a tr...

Learning from User Interactions with Rankings: A Unification of the Field

Ranking systems form the basis for online search engines and recommendat...

Compressed Deep Networks: Goodbye SVD, Hello Robust Low-Rank Approximation

A common technique for compressing a neural network is to compute the k-...