|
==See also==
* [[Nearest neighbor search|Approximate nearest neighbor search]]<ref>Muja, Marius. "[https://open.library.ubc.ca/collections/ubctheses/24/items/1.0052198 Scalable nearest neighbour methods for high dimensional data]." (2013).</ref>
* [[Associative neural memories]]<ref>Hassoun, Mohamad H. Associative neural memories. Oxford University Press, Inc., 1993.</ref>
* [[Autoassociative memory]]
* [[Binary spatter codes]]<ref>Kanerva, Pentti. [https://link.springer.com/chapter/10.1007/3-540-61510-5_146 "Binary spatter-coding of ordered K-tuples."] Artificial Neural Networks—ICANN 96. Springer Berlin Heidelberg, 1996. 869-873.</ref>
* [[Cerebellar model articulation controller|Associative-memory models of the cerebellum]]
* [[Content-addressable memory]]
* [[Correlation-matrix memories]]<ref>Kohonen, Teuvo. "[http://www.latp2016.org/documents/Mizraji/Kohonen%201972.pdf Correlation matrix memories]." Computers, IEEE Transactions on 100.4 (1972): 353-359.</ref>
* [[Types of artificial neural networks#Dynamic memory networks]]
* [[Feedforward neural network]]
* [[Hierarchical temporal memory]]
* [[Holographic associative memory]]
* [[Holographic reduced representation]]<ref>Plate, Tony A. "Holographic Reduced Representation: Distributed representation for cognitive structures." (2003).</ref><ref name="kanerva10k">Kanerva, Pentti. "[http://redwood.berkeley.edu/vs265/Kanerva-allerton2014.pdf Computing with 10,000-bit words]." Proc. 52nd Annual Allerton Conference on Communication, Control, and Computing. 2014.</ref>
* [[Low-density parity-check code]]
* [[Locality-sensitive hashing]]
* [[Random-access memory]] (as a special case of SDM)<ref name="psu"/>
* [[Random indexing]]
* [[Recursive auto-associative memory|Recursive auto-associative memory (RAAM)]]<ref>{{cite journal | last1 = Pollack | first1 = Jordan B | year = 1990 | title = Recursive distributed representations | journal = Artificial Intelligence | volume = 46 | issue = 1| pages = 77–105 | doi=10.1016/0004-3702(90)90005-k}}</ref>
* [[Self-organizing map]]
* [[Semantic folding]]<ref>{{cite arXiv|eprint=1511.08855|title=Semantic Folding Theory And its Application in Semantic Fingerprinting|last=De Sousa Webber|first=Francisco|date=2015|class=cs.AI}}</ref>
* [[Semantic hashing]]<ref>Salakhutdinov, Ruslan, and Geoffrey Hinton. "[http://www.utstat.toronto.edu/~rsalakhu/papers/semantic_final.pdf Semantic hashing]." RBM 500.3 (2007): 500.</ref>
* [[Semantic memory]]
* [[Semantic network]]
* [[Semantic pointer architecture]]<ref>Eliasmith, Chris, et al. "[http://clm.utexas.edu/compjclub/papers/Eliasmith2012.pdf A large-scale model of the functioning brain]." science 338.6111 (2012): 1202-1205.</ref>
* [[Sequence memory]]<ref>{{cite journal | last1 = Hawkins | first1 = Jeff | last2 = George | first2 = Dileep | last3 = Niemasik | first3 = Jamie | year = 2009 | title = Sequence memory for prediction, inference and behaviour | journal = Philosophical Transactions of the Royal Society B: Biological Sciences | volume = 364 | issue = 1521| pages = 1203–1209 | doi=10.1098/rstb.2008.0322| pmc = 2666719 | pmid=19528001}}</ref>
* [[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]]<ref>Graves, Alex, Greg Wayne, and Ivo Danihelka. "Neural Turing Machines." arXiv preprint {{arXiv|1410.5401}} (2014).</ref>
* 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 symbolic architecture]]<ref>{{cite journal | last1 = Rachkovskij | first1 = Dmitri A. | last2 = Kussul | first2 = Ernst M. | year = 2001 | title = Binding and normalization of binary sparse distributed representations by context-dependent thinning | url = http://cogprints.org/1240/1/cdt-1sp.pdf| journal = Neural Computation | volume = 13 | issue = 2| pages = 411–452 | doi=10.1162/089976601300014592| s2cid = 585366 }}</ref>
* [[Vector space model]]
* [[Virtual memory]]
| 