CHI '95 ProceedingsTopIndexes
Short PapersTOC

A MODEL OF OPTIMAL EXPLORATION AND DECISION MAKING IN NOVEL INTERFACES

Bob Rehder, Clayton Lewis, Bob Terwilliger, Peter Polson, John Rieman

Institute of Cognitive Science
University of Colorado, Boulder, CO 80309-0344
rehder@horton.colorado.edu

© ACM

Abstract

Users attempting to interact with an application for the first time are confronted with the problem of determing which command to execute in order to accomplish their goals. A "rational analysis" was conducted in order to determine how users ought to behave when faced with this decision problem. The resulting model is able to account at a qualitative level for a number of behaviors that users actually exhibit when trying to use a new application.

Keywords:

User models, exploratory behavior.

Introduction

We address how users with experience with a general type of interface but not with a specific application program initially explore that program's interface. Recent studies conducted by Rieman [1] and Franzke [2] have investigated how experienced Apple Macintosh users attempt to graph data with unfamiliar (to them) applications such as Cricket Graph and Excel. We are attempting to account for behaviors leading up to the execution of the first application command, such as the following.
(1) Sometimes subjects simply select the first command that looks good.
(2) Frequently, however, they will skip over good-looking commands in order to look at the contents of other menus.
(3) Often times subjects will not only look through all the menus once, but will do so several times.
(4) On subsequent scans through the interface, subjects appear to slow down in order to study the commands more closely.

Below we propose a model of first command choice that is intended to explain some of these effects. Our style of explanation is to conduct a "rational analysis", following Anderson [3]. That is, we try to understand subject behavior as optimal adaptations to the task.

ASSUMPTIONS OF THE MODEL

Our first assumption is that at any one time the user is positioned on one command (the "current" command), and is able to see the name, or label, of only that command. When the user moves to a new command, the old label disappears, and the label of the new command appears.

Our second assumption is that users encode an estimate of the relevance of a command given its label, where by "relevance" we mean how likely it is that the command is the one required to carry out the current task. The estimated relevance of the ith command is referred to as Ri. The set of relevances for all commands in the interface is referred to as R. Our third assumption is that users come with prior experiences concerning the usefulness of a command's relevance estimate as a predictor for determining whether the command is the correct one for accomplishing the task. From all the times in the past when a correct command was selected, the user may form what we will call a "signal" probability distribution (denoted P(Ri|S)) which indicates how relevant correct commands are likely to appear. From all the times in the past when an incorrect command was selected, the user may form what we will call a "noise" probability distribution (denoted P(Ri|N)) which indicates how relevant incorrect commands are likely to appear. Our use of the terms "signal" and "noise" are borrowed from signal detection theory, as we have been viewing the correct command as the signal that must be detected against a background of noise (incorrect commands).


Figure 1. Example signal and noise distributions.

Figure 1 presents an example of signal and noise distributions, in which relevance is treated as a discrete variable ranging from 1 to 7. The signal distribution indicates that correct commands most often come with a relevance of 5, but sometimes as high as 7 and as low as 3. The noise distribution indicates that incorrect commands most often come with a relevance of 3, but sometimes as high as 5 and as low as 1. The overlapping signal and noise distributions is a way of indicating that the label is not a foolproof indicator of the usefulness of a command. Once again we appeal to the analogy with signal detection theory: If one adopts a low threshold then incorrect commands will often be chosen, but if one adopts a high threshold then correct commands will often be overlooked. Our final assumption is that the user knows the number of commands in the interface, which we refer to as K.

THE MODEL

Assume that the user has made one pass over the interface, and so has encoded the relevance of all the commands. We do not assume that the user has memorized the location of the commands. We frame the decision facing the user as a choice between (1) executing the current command, and (2) scanning through the remaining commands in the hope of finding a better option. If the scan alternative is chosen, the decision cycle repeats on the next command encountered.

Employing the Anderson decision making framework [3], the next action that one chooses should be the one with the greatest expected value. In our case, this will reduce to choosing the action (scanning or executing) with the least expected cost of finding the correct command.

Calculating costs.

For purposes of expressing the cost functions we will adopt a simplified decision strategy (only when projecting into the future for determining potential future costs) that assumes that the user scans through the commands until he or she finds the most relevant looking command, and then executes it. If this turns out to be the incorrect command the user will undo it, scan until the second most relevant looking command is found, execute it, and so on. The cost function for scanning becomes,
    
Cscan	=	KCmove/2 +  		(1)    
			[1-P(Hbest(1)|R)]*(Cundo+KCmove/2 +    
				[1-P(Hbest(2)|R)]*(Cundo+KCmove/2 +    
					etc.))   
where Hi is the hypothesis that the ith command is the correct one, P(Hi|R) is the probability of Hi given what we know about the relevance of all the labels (R), Cmove is the cost of moving to the next command, Cundo is the cost of undoing the execution of an incorrect command, and best(i) returns the ith most-relevant command.

Equation 1. Equation 1 and remainder of paragraph as image (for clarity)

If instead of scanning we execute the current command and it is the correct command, then we incur no costs. If it is the incorrect command (with probability 1-P(Hcur|R)), then we undo the effects of executing the current command and then scan through the remaining K-1 commands.

    
Cexecute	=	[1-P(Hcur|R)]*(Cundo+KCmove/2+	(2)    
			[1-P(Hbest2(1)|R)]*(Cundo+KCmove/2+    
				[1-P(Hbest2(2)|R)]*(Cundo+ KCmove/2+    
					etc.)))   
where best2(i) returns the ith most-relevant command, not including the current one.

Equation 2. Equation 2 and paragraph in which it occurs (for clarify)

Calculating P(Hi|R). Equations 1 and 2 require that an expression for P(Hi|R) be found. According to Bayes' law, P(Hi|R)=[P(R|Hi)/P(R)]¥P(Hi). If Hi is true, the ith command comes from the signal distribution and the rest are noise, so P(R|Hi)=P(Ri|S)¥Pj=1..K,_i[P(Rj|N)]. Because the hypotheses are mutually exclusive and exhaustive, P(R)=Si=1..K [P(R|Hi)P(Hi)]. Because the hypotheses are equally likely to be true a priori, P(Hi)=1/K.

Preceding Paragraph as Image (for clarity)

EXAMPLE

Suppose an application has three commands, with relevance R1=4, R2=3, and R3=5. Assume the first command (R1=4) is the current command, the signal and noise distributions of Figure 1, Cmove=1, and Cundo=4. Under these assumptions Cscan=3.6 and Cexecute=4.7, so the rational choice is to scan rather than execute. However, if we were to assume Cmove=3 instead, then we have Cscan=7.8 and Cexecute=7.2, then the rational choice changes to execute as a result of the greater cost of moving relative to undoing mistakes. Leaving Cmove=1 and changing R3 to 4, we have Cscan=5.4 and Cexecute=3.9, and the rational choice again changes to execute, as a result of the lack of any command that appears more relevant than the current one.

DISCUSSION

The model is able to account for the execute versus scan decisions that users make by taking into account the other commands in the interface, and the relative costs of moving versus undoing the execution of a wrong command. The model in its general form (see Footnote 1) is capable of explaining phenomena (1) and (2) that we outlined in the introduction by in addition making reasonable guesses as to what will be encountered in the interface before any commands have been observed.

However, the model predicts that a command will always be chosen no later than on the second pass, which is clearly at odds with phenomenon (3). One possibility is that users do not remember the relevance of all the labels that were scanned over during the first pass, so that there is a still a great deal of uncertainty over what might appear in the interface. The model could be enhanced to include a parameter that determined the probability of encoding the relevance of a command. The model also does not predict phenomenon (4), the fact that people seem to slow down as they make successive passes over the interface. We speculate that users are spending more time considering a command in order to semantically elaborate the command label more deeply, and to perform more extensive envisionments of what effect the command might have.

Acknowledgments

Support has been provided by NSF grant IRI 9116640.

References

1. Rieman, J. (In preparation). A field study of exploratory learning strategies. Ph.D. Dissertation, University of Colorado.
2. Franzke, M. (In preparation). Exploration, learning, and retention of display-based systems. Ph.D. Dissertation, University of Colorado.
3. Anderson, J.R. (1990). The adaptive character of thought. Hillsdale, NJ: Erlbaum

FOOTNOTE:

The model can be generalized to include the case where none, or only some, of the labels have been observed by basing it on reasonable expectations of what labels should appear in the interface. These expectations can be formed from the signal and noise distributions. Space limitations prohibit us from presenting the model in its general form here. Return to text.