Some approaches to analogical mapping with structure-sensitive distributed representations
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- Fast similarity search for graphs by edit distance
- Binary vectors for fast distance and similarity estimation
- A binding procedure for distributed binary data representations
- Formation of similarity-reflecting binary vectors with random binary projections
- The latent relation mapping engine: algorithm and experiments
- Randomized projective methods for the construction of binary sparse vector representations
- scientific article; zbMATH DE number 1946961 (Why is no real title available?)
- Structured temporal representation in time series classification with ROCKETs and hyperdimensional computing
- Vector data transformation using random binary matrices
- Estimation of vectors similarity by their randomized binary projections
This page was built for publication: Some approaches to analogical mapping with structure-sensitive distributed representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4661882)