In computing, frecency is any heuristic that combines the frequency and recency into a single measure.

Heuristic

In its simplest form, the frequency and recency rating can be added to form a frecency rating. The ratings can be found by sorting items by most recent and most frequent respectively. A decayed calculation using logarithms can also be used.[1]

Examples

Some web browsers use frecency to predict the likelihood of revisiting a given web page[2] or reusing a given HTTP cache entry[3]

"Frecency is a score given to each unique URI in Places, encompassing bookmarks, history and tags. This score is determined by the amount of revisitation, the type of those visits, how recent they were, and whether the URI was bookmarked or tagged."[4]

Frecency can be computed from a list of use dates, either as pro-actively while a user browses the web or as needed.[4] Some frecency measures can also be computed in a rolling manner without storing such a list.[1]

The ZFS filesystem uses this concept in its adaptive replacement cache (ARC) cache with a most recently used (MRU) and most frequently used (MFU) list.

References

  1. 1 2 Jesse Ruderman and Justin Lebar (2012-11-10). "A new frecency algorithm based on exponential decay". wiki.mozilla.org. Retrieved 2014-05-22.
  2. ↑ Edwards, Nathan (August 2008). "Firefox 3: A Browser Odyssey". Maximum PC. pp. 50–52.
  3. ↑ Honza Bambas (2014-05-19). "New Firefox HTTP cache now enabled on Nightly builds". Retrieved 2014-05-22.
  4. 1 2 "The Places frecency algorithm | MDN". Developer.mozilla.org. 2011-11-03. Archived from the original on August 16, 2014. Retrieved 2013-10-17.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.