Stephen Fitchett
ABSTRACT
We introduce AccessRank, an algorithm that predicts revisitations and reuse in many contexts, such as file accesses, website visits, window switches, and command lines. AccessRank uses many sources of input to generate its predictions, including recency, frequency, temporal clustering, and time of day. Simulations based on log records of real user interaction across a diverse range of applications show that AccessRank more accurately predicts upcoming accesses than other algorithms. The prediction lists generated by AccessRank are also shown to be more stable than other algorithms that have good predictive capability, which can be important for usability when items are presented in lists as users can rely on their spatial memory for target location. Finally, we present examples of how real world applications might use AccessRank.
- Alexander, J., Cockburn, A., Fitchett, S., Gutwin, C., and Greenberg, S. Revisiting read wear: analysis, design, and evaluation of a footprints scrollbar. In Proc. CHI '09 (2009), 1665--1674. Google Scholar
Digital Library
- Arcuri, M., Coon, T., Johnson, J., Manning, A., and van Tilburg, M. Adaptive menus, Sept. 19 2000. US Patent 6,121,968.Google Scholar
- Cockburn, A., Gutwin, C., and Greenberg, S. A predictive model of menu performance. In Proc CHI '07 (2007), 627--636. Google ScholarDigital Library
- Findlater, L., and McGrenere, J. A comparison of static, adaptive, and adaptable menus. In Proc. CHI '04 (2004), 89--96. Google ScholarDigital Library
- Findlater, L., Moffatt, K., McGrenere, J., and Dawson, J. Ephemeral adaptation: the use of gradual onset to improve menu selection performance. In CHI '09, ACM (2009), 1655--1664. Google ScholarDigital Library
- Greenberg, S. Using unix: Collected traces of 168 users. Tech. rep., Research Report 88/333/45, Department of Computer Science, University of Calgary, 1988.Google Scholar
- Greenberg, S., and Witten, I. Supporting command reuse: empirical foundations and principles. International Journal of Man-Machine Studies 39, 3 (1993), 353--390. Google ScholarDigital Library
- Greenberg, S., and Witten, I. Supporting command reuse: Mechanisms for reuse. International Journal of Man-Machine Studies 39, 3 (1993), 391--425. Google ScholarDigital Library
- Kaasten, S., and Greenberg, S. Integrating back, history and bookmarks in web browsers. In Proc. CHI '01 (2001), 379--380. Google ScholarDigital Library
- Lee, D., Choi, J., Kim, J.-H., Noh, S. H., Min, S. L., Cho, Y., and Kim, C. S. On the existence of a spectrum of policies that subsumes the least recently used (lru) and least frequently used (lfu) policies. SIGMETRICS Perform. Eval. Rev. 27, 1 (1999), 134--143. Google ScholarDigital Library
- Markov, A. The theory of algorithms. American Mathematical Society Translations (1960).Google Scholar
- Mozilla. The Places frecency algorithm. https://developer.mozilla.org/en/The_Places_frecency_algorithm, 2008.Google Scholar
- Tak, S. Understanding and Supporting Window Switching. PhD thesis, University of Canterbury, 2011.Google Scholar
- Tauscher, L., and Greenberg, S. How people revisit web pages: empirical findings and implications for the design of history systems. IJHCS 47 (1997), 97--138. Google ScholarDigital Library
- Webber, W., Moffat, A., and Zobel, J. A similarity measure for indefinite rankings. TOIS '10 (2010). Google ScholarDigital Library
Index Terms
- AccessRank: predicting what users will do next
Recommendations
Limits of Data Value Predictability
The predictability of data values is studied at a fundamental level. Two basic predictor models are defined: Computational predictors perform an operation on previous values to yield predicted next values. Examples we study are stride value prediction ...
The predictability of data values
MICRO 30: Proceedings of the 30th annual ACM/IEEE international symposium on MicroarchitectureThe predictability of data values is studied at a fundamental level. Two basic predictor models are defined: Computational predictors perform an operation on previous values to yield predicted next values. Examples we study are stride value prediction (...
Where the bugs are
ISSTA '04: Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysisThe ability to predict which files in a large software system are most likely to contain the largest numbers of faults in the next release can be a very valuable asset. To accomplish this, a negative binomial regression model using information from ...
Comments