Search process evaluation for a hierarchical menu system by Markov chains

Hideaki Takagi; Muneo Kitajima; Tetsuo Yamamoto; Yongbing Zhang

doi:10.1117/12.434312

24 July 2001 Search process evaluation for a hierarchical menu system by Markov chains

Hideaki Takagi, Muneo Kitajima, Tetsuo Yamamoto, Yongbing Zhang

Proceedings Volume 4523, Internet Performance and Control of Network Systems II; (2001) https://doi.org/10.1117/12.434312
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States

Abstract

When computers are used to execute tasks, it is often necessary for the user to locate a target item in a menu or a list. For example, users of word processors and spreadsheet applications select appropriate commands in a hierarchical menu to display dialog boxes and edit file or table attributes. To locate the desired information on the World Wide Web, users select the most appropriate candidate out of those presented by a search engine, and proceed through a series of hyperlinks that appear to be related to the task. This paper applies a cognitive model of the user's item selection process to the task of target search in a hierarchical menu system that contains one or more of the following four operations: (1) item selection on the basis of similarity to the task, (2) consideration in various ways of the selection history when making the next selection, (3) backtracking when an appropriate item is not present among those selectable at a given point in time, and (4) abandoning the task unachieved. We model this selection process with Markov chains. We calculate the probability that task goals are achieved and the average number of selections to make until the task goals are achieved. Finally we use these results to propose a method of evaluating the structures of hierarchical menus and links on a website.

Citation Download Citation

Hideaki Takagi, Muneo Kitajima, Tetsuo Yamamoto, and Yongbing Zhang "Search process evaluation for a hierarchical menu system by Markov chains", Proc. SPIE 4523, Internet Performance and Control of Network Systems II, (24 July 2001); https://doi.org/10.1117/12.434312

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available