Foraging-based Optimization of Menu Systems

05/04/2020
by   Niraj Ramesh Dayama, et al.
0

Computational design of menu systems has been solved in limited cases such as the linear menu (list) as an assignment task, where commands are assigned to menu positions while optimizing for for users selection performance and distance of associated items. We show that this approach falls short with larger, hierarchically organized menu systems, where one must also take into account how users navigate hierarchical structures. This paper presents a novel integer programming formulation that models hierarchical menus as a combination of the exact set covering problem and the assignment problem. It organizes commands into ordered groups of ordered groups via a novel objective function based on information foraging theory. It minimizes, on the one hand, the time required to select a command whose location is known from previous usage and, on the other, the time wasted in irrelevant parts of the menu while searching for commands whose location is not known. The convergence of these two factors yields usable, well-ordered command hierarchies from a single model. In generated menus, the lead (first) elements of a group or tab are good indicators of the remaining contents, thereby facilitating the search process. In a controlled usability evaluation, the performance of computationally designed menus was 25 faster than existing commercial designs with respect to selection time. The algorithm is efficient for large, representative instances of the problem. We further show applications in personalization and adaptation of menu systems.

READ FULL TEXT

page 12

page 19

page 26

page 27

research
03/01/2022

Ordered Submodularity and its Applications to Diversifying Recommendations

A fundamental task underlying many important optimization problems, from...
research
07/02/2020

A Minimum-Risk Dynamic Assignment Mechanism Along with an Approximation, Heuristics, and Extension from Single to Batch Assignments

In the classic linear assignment problem, items must be assigned to agen...
research
07/12/2022

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results

In this paper, we propose the Ordered Median Tree Location Problem (OMT)...
research
01/05/2023

Max-Min Diversification with Fairness Constraints: Exact and Approximation Algorithms

Diversity maximization aims to select a diverse and representative subse...
research
06/05/2020

The Baggage Belt Assignment Problem

We consider the problem of assigning flights to baggage belts in the bag...
research
03/29/2021

Pursuer Assignment and Control Strategies in Multi-agent Pursuit-Evasion Under Uncertainties

We consider a pursuit-evasion problem with a heterogeneous team of multi...

Please sign up or login with your details

Forgot password? Click here to reset