PsycEXTRA Dataset 2012
DOI: 10.1037/e557102013-030
|View full text |Cite
|
Sign up to set email alerts
|

Computationally Efficient Forgetting via Base-Level Activation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…This paper does not address the computational challenges associated with efficiently implementing these policies. Derbinsky and Laird (2012) present and evaluate algorithms for implementing forgetting via base-level activation.…”
Section: Discussionmentioning
confidence: 99%
“…This paper does not address the computational challenges associated with efficiently implementing these policies. Derbinsky and Laird (2012) present and evaluate algorithms for implementing forgetting via base-level activation.…”
Section: Discussionmentioning
confidence: 99%
“…Thus alternative solutions include tapping into existing methods for large-scale data management and improving the retrieval algorithms. Both avenues have been explored, the former by Soar and ACT-R, which used PostgreSQL relational database to load concepts and relations from WordNet [118,126], and the latter by the Companions architecture [165]. Alternatively, SPA supports a biologically plausible model of associative memory capable of representing over 100K concepts in WordNet using a network of spiking neurons [111].…”
Section: Global Memorymentioning
confidence: 99%