.png){kind=icon}
返回
Representation and processing of structures with binary sparse distributed codes
.png){kind=icon}
PRE
AI
DOI：10.1109/69.917565.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The schemes for compositional distributed representations include those allowing on-the-fly construction of fixed dimensionality codevectors to encode structures of various complexity. Similarity of such codevectors takes into account both structural and semantic similarity of represented structures, in this paper, we provide a comparative description of sparse binary distributed representation developed in the framework of the associative-projective neural network architecture and the more well-known holographic reduced representations of Plate and binary spatter codes of Kanerva. The key procedure in associative-projective neural networks is context-dependent thinning which binds codevectors and maintains their sparseness. The codevectors are stored in structured memory array which can be realized as distributed auto-associative memory. Examples of distributed representation of structured data are given. Fast estimation of the similarity of analogical episodes by the overlap of their codevectors is used in the modeling of analogical reasoning both for retrieval of analogs from memory and for analogical mapping.
Keyword:
sparse coding
binary coding
binding
representation of structure
hierarchical representation
nested representation
long-term memory
analogy
compositional distributed representations
connectionist symbol processing
analogical retrieval
analogical mapping
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
17O solid-state NMR spectroscopy of A2B2O7oxides: quantitative isotopic enrichment and spectral acquisition?.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAI分享收藏Testing learner reliance on caption supports in second language listening comprehension multimedia environmentsReCALL
ReCALLIF0
PREAI
分享收藏
查看更多内容