A Fast Spatial Pool Learning Algorithm of Hierarchical Temporal Memory Based on Minicolumn’s Self-Nomination

<div>The training time overhead of two algorithms. Each column in the graph represents the training time overhead of the dataset after a round of training with different code lengths. (a) The results trained by SPL. (b) The results trained by SPL_SN.</div>

Computational Intelligence and Neuroscience

fig6

Figure 6

Figure 6: A Fast Spatial Pool Learning Algorithm of Hierarchical Temporal Memory Based on Minicolumn’s Self-Nomination 