Walter C. Mankowski
ABSTRACT
While the collection of behavioral protocols has been common practice in human-computer interaction research for many years, the analysis of large protocol data sets is often extremely tedious and time-consuming, and automated analysis methods have been slow to develop. This paper proposes an automated method of protocol analysis to find canonical behaviors --- a small subset of protocols that is most representative of the full data set, providing a reasonable "big picture" view of the data with as few protocols as possible. The automated method takes advantage of recent algorithmic developments in computational vision, modifying them to allow for distance measures between behavioral protocols. The paper includes an application of the method to web-browsing protocols, showing how the canonical behaviors found by the method match well to sets of behaviors identified by expert human coders.
- Byrne, M. D., Anderson, J. A., Douglass, S.,&Matessa, M. (1999). Eye tracking the visual search of click-down menus. Proc. CHI 99, 402--409. Google Scholar
Digital Library
- Card, S., Moran, T.,&Newell, A. (1983). The psychology of human-computer interaction. Hillsdale, NJ: Erlbaum. Google ScholarDigital Library
- Card, S. K., Pirolli, P., Van Der Wege, M., Morrison, J. B., Reeder, R. W., Schraedley, P. K.,&Boshart, J. (2001). Information scent as a driver of web behavior graphs: Results of a protocol analysis method for web usability. Proc. CHI 2001, 498--505. Google ScholarDigital Library
- Chi, E. H., et al. (2003). The bloodhound project: automating discovery of web usability issues using the InfoScent simulator. Proc. CHI 2003, 505--512. Google ScholarDigital Library
- Cutrell, E.,&Guan, Z. (2007). What are you looking for? An eye-tracking study of information usage in web search. Proc. CHI 2007, 407--416. Google ScholarDigital Library
- Denton, T., Shokoufandeh, A., Novatnack, J.,&Nishino, K. (2008). Canonical subsets of image features. Computer Vision and Image Understanding, 112, 55--66. Google ScholarDigital Library
- Ericsson, K.A.,&Simon, H.A. (1984). Protocol analysis: Verbal reports as data. Cambridge, MA: MIT Press.Google Scholar
- Gary, M.R.,&Johnson, D.S. (1979). Computers and intractability: A guide to the theory of NP--completeness. San Francisco, CA: Freeman. Google ScholarDigital Library
- Hornof, A. J.,&Halverson, T. (2003). Cognitive strategies and eye movements for searching hierarchical computer displays. Proc. CHI 2003, 249--256. Google ScholarDigital Library
- Levenshtein, V. (1966). Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Daklady, 10, 707--710.Google Scholar
- Paganelli, L.,&Paternòò, F. (2002). Intelligent analysis of user interactions with web applications. Proc. CHI 2002, 111--118. Google ScholarDigital Library
- Pirolli, P., Fu, W.-T., Reeder, R.,&Card, S.K. (2002). A user-tracing architecture for modeling interaction with the World Wide Web. In Proc. AVI 2002. Google ScholarDigital Library
- Ritter, F.E.,&Larkin, J.H. (1994). Developing process models as summaries of HCI action sequences. Human-Computer Interaction, 9, 345--383. Google ScholarDigital Library
- Salvucci, D.D.,&Anderson, J.R. (2001). Automated eye-movement protocol analysis. Human-Computer Interaction, 16, 39--86. Google ScholarDigital Library
- Sanderson, P., Scott, J., Johnston, T., Mainzer, J., Watanabe, L.,&James, J. (1994). MacSHAPA and the enterprise of exploratory sequential data analysis (ESDA). International Journal of Human-Computer Studies, 41, 633--681. Google ScholarDigital Library
- Smith, J.B., Smith, D.K.,&Kuptsas, E. (1993). Automated protocol analysis. Human-Computer Interaction, 8, 101--145. Google ScholarDigital Library
- Taatgen, N. A.,&Lee, F. J. (2003). Production compilation: A simple mechanism to model complex skill acquisition. Human Factors, 45, 61--76.Google ScholarCross Ref
- Toh, K.C., Todd, M.J.,&Tutuncu, R. (1999). SDPT3: a Matlab package for semidefinite programming. Optimization Methods and Software, 11, 545--581.Google ScholarCross Ref
Index Terms
- Finding canonical behaviors in user protocols
Recommendations
Security analysis of efficient (Un-) fair non-repudiation protocols
AbstractAn approach to protocol analysis using asynchronous product automata (APA) and the simple homomorphism verification tool (SHVT) is demonstrated on several variants of the well known Zhou–Gollmann fair non-repudiation protocol and on two more ...
Finite-state analysis of two contract signing protocols
Optimistic contract signing protocols allow two parties to commit to a previously agreed upon contract, relying on a third party to abort or confirm the contract if needed. These protocols are relatively subtle, since there may be interactions between ...
On the security of fair non-repudiation protocols
Special issue on SC 2003We analyzed two non-repudiation protocols and found some new attacks on the fairness and termination property of these protocols. Our attacks are enabled by several inherent design weaknesses, which also apply to other non-repudiation protocols. To ...
Comments