Some approaches to analogical mapping with structure-sensitive distributed representations

DOI10.1080/09528130410001712862zbMath1083.68581OpenAlexW1971743472MaRDI QIDQ4661882

Dmitri Rachkovskij

Publication date: 30 March 2005

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528130410001712862

zbMATH Keywords

ReasoningAnalogyBindingBinary CodingAnalogical MappingAssociative-Projective Neural NetworksCodevectorConnectionist Symbol ProcessingDistributed RepresentationsRepresentation Of StructureSparse Coding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) General topics in artificial intelligence (68T01)

Related Items

Binary vectors for fast distance and similarity estimation, Fast similarity search for graphs by edit distance, Randomized projective methods for the construction of binary sparse vector representations, Vector data transformation using random binary matrices, Estimation of vectors similarity by their randomized binary projections, A binding procedure for distributed binary data representations, Formation of similarity-reflecting binary vectors with random binary projections

Cites Work

• The structure-mapping engine: Algorithm and examples
• Tensor product variable binding and the representation of symbolic structures in connectionist systems
• Binding and Normalization of Binary Sparse Distributed Representations by Context-Dependent Thinning