File:Recall approximation.jpg
Size of this preview: 800 × 500 pixels.
Original file (1,920 × 1,200 pixels, file size: 334 KB, MIME type: image/jpeg)
Approximating the Recall[] matrix with the best-fit function to compute default recall in conditions of data scarcity. The approximation procedure uses a hill-climbing algorithm with parameters A, B, C, D displayed in the picture. Least squares deviation is obtained to asses the progress. The circles represent the Recall[] matrix at a chosen difficulty level. Their size corresponds with repetition cases investigated. The red surface is the best fit of the studied function to the Recall[] data.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 13:32, 26 April 2016 | | 1,920 × 1,200 (334 KB) | SuperMemoHelp (talk | contribs) | Approximating the Recall[] matrix with the best-fit function to compute default recall in conditions of data scarcity. The approximation procedure uses a hill-climbing algorithm with parameters A, B, C, D displayed in the picture. Least squares deviation |
You cannot overwrite this file.
File usage
The following page uses this file:
