Content deleted Content added
link died |
→Related models: fixed broken anchor, removed since the same as another entry, changed to a see also section |
||
Line 267:
*An Implementation in C done at the Research Institute for Advanced Computer Science at NASA Ames<ref>{{Cite web|url=https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19870017134.pdf|title=Two Demonstrators and a Simulator for a Sparse Distributed Memory|last=Brown|first=Robert L.|date=June 1987|website=NASA Technical Reports Archive}}</ref>
==
* [[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>
Line 275:
* [[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>
* [[
* [[Feedforward neural network]]
* [[Hierarchical temporal memory]]
Line 283 ⟶ 282:
* [[Low-density parity-check code]]
* [[Locality-sensitive hashing]]
* [[Types of artificial neural networks#Memory networks]]
* [[Memory-prediction framework]]
* [[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]]
|