Sparse distributed memory: Difference between revisions

Revision as of 22:33, 27 February 2023

Revision as of 22:35, 27 February 2023

Line 282:

* [[Types of artificial neural networks#Memory networks|Memory networks]]

* [[Memory-prediction framework]]

* [[Neural coding]]

* [[Random indexing]]

* [[Self-organizing map]]

Line 287 ⟶ 288:

* [[Semantic memory]]

* [[Semantic network]]

* [[Neural coding|Sparse coding]]<ref>Lee, Honglak, et al. "[http://papers.nips.cc/paper/2979-efficient-sparse-coding-algorithms.pdf Efficient sparse coding algorithms]." Advances in neural information processing systems. 2006.</ref>

* [[Hierarchical temporal memory#Sparse distributed representations|Sparse distributed representations]]

* [[Neural Turing machine]]

* [[Neural Turing machine]]<ref>Graves, Alex, Greg Wayne, and Ivo Danihelka. "Neural Turing Machines." arXiv preprint {{arXiv|1410.5401}} (2014).</ref>

* Stacked [[autoencoder]]s

* Stacked [[autoencoder]]s<ref>{{cite journal | last1 = Vincent | first1 = Pascal |display-authors=etal | year = 2010 | title = Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion | url = http://www.jmlr.org/papers/volume11/vincent10a/vincent10a.pdf| journal = The Journal of Machine Learning Research | volume = 11 | pages = 3371–3408 }}</ref>

* [[Vector space model]]