PPT Slide
The BEST can be easily implemented in a hash table by measuring the distance in SDs to each replicate during the training process and storing this distance in the table. A new sample can be analyzed by simply looking up the SD in the direction of X, and dividing the Euclidean distance by this table entry.
Hash tables load the computation into the calibration step.