SuperMemo 18 HelpAll articles

File : Recall approximation.jpg

Original file (1,920 × 1,200 pixels, file size: 334 KB, MIME type: image/jpeg)

Figure: 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.

The following page uses this file: