Estimation of Vectors Similarity by Their Randomized Binary Projections

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Cybernetics and Systems Analysis

• Publication date

  2015-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s10559-015-9774-1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Holographic Graph Neuron: A Bioinspired Architecture for Pattern Processing

  2015cited by this paper
• Generating Symbolic Traces in the Insertion Modeling System

  2015cited by this paper
• Encoding Sequential Information in Semantic Space Models: Comparing Holographic Reduced Representation and Random Permutation

  2015cited by this paper
• Reasoning with vectors: A continuous model for fast robust inference

  2015influential reference
• Formation of Similarity-Reflecting Binary Vectors with Random Binary Projections

  2015influential reference
• Training Neural Networks for classification using the Extended Kalman Filter: A comparative study

  2014cited by this paper
• On Bidirectional Transitions between Localist and Distributed Representations: The Case of Common Substrings Search Using Vector Symbolic Architecture

  2014cited by this paper
• Analogical Mapping with Sparse Distributed Memory: A Simple Model that Learns to Generalize from Examples

  2014cited by this paper
• Vector space architecture for emergent interoperability of systems by learning from demonstration

  2014cited by this paper
• Concept Learning in Neuromorphic Vision Systems: What Can We Learn from Insects?

  2014cited by this paper
• Modeling Dependencies in Multiple Parallel Data Streams with Hyperdimensional Computing

  2014cited by this paper
• Sparsey™: event recognition via deep hierarchical sparse distributed codes

  2014cited by this paper
• Vector Data Transformation Using Random Binary Matrices

  2014cited by this paper
• Building a world model with structure-sensitive sparse binary distributed representations

  2013cited by this paper
• Using Cortically-Inspired Algorithms for Analogical Learning and Reasoning

  2013cited by this paper
• Parallel approaches to machine learning - A comprehensive survey

  2013cited by this paper
• Representing Objects, Relations, and Sequences

  2013cited by this paper
• Theory of Interaction, Insertion Modeling, and Cognitive Architectures

  2013cited by this paper
• Analogical mapping and inference with binary spatter codes and sparse distributed memory

  2013cited by this paper
• Task-driven Greedy Learning of Feature Hashing Functions

  2013cited by this paper
• Orthogonality and Orthography: Introducing Measured Distance into Semantic Space

  2013cited by this paper
• Direct Method for Training Feed-Forward Neural Networks Using Batch Extended Kalman Filter for Multi-Step-Ahead Predictions

  2013cited by this paper
• LIMSI: Learning Semantic Similarity by Selecting Random Word Subsets

  2012cited by this paper
• Quantum Computation via Sparse Distributed Representation

  2012cited by this paper
• SIMILARITY‐BASED RETRIEVAL WITH STRUCTURE‐SENSITIVE SPARSE BINARY DISTRIBUTED REPRESENTATIONS

  2012cited by this paper
• Real, Complex, and Binary Semantic Vectors

  2012cited by this paper
• A randomized method for solving discrete ill-posed problems

  2012cited by this paper
• Randomized projective methods for the construction of binary sparse vector representations

  2012cited by this paper
• Grid Technologies for Satellite Data Processing and Management Within International Disaster Monitoring Projects

  2011cited by this paper
• High-performance Intelligent Computations for Environmental and Disaster Monitoring

  2011cited by this paper
• On the absolute constants in the Berry-Esseen-type inequalities

  2011cited by this paper
• Dimension Reduction: A Guided Tour

  2010cited by this paper
• Memory Capacities for Synaptic and Structural Plasticity

  2010cited by this paper
• A distributed basis for analogical mapping

  2009cited by this paper
• An improvement of the Berry–Esseen inequality with applications to Poisson and mixed Poisson random sums

  2009cited by this paper
• Semantic approach to knowledge processing

  2008cited by this paper
• Dimensionality Reduction: A Comparative Review

  2008cited by this paper
• Very sparse random projections

  2006cited by this paper
• Time of searching for similar binary vectors in associative memory

  2006cited by this paper
• Deductive rules in holographic reduced representation

  2006cited by this paper
• Preprocessing of matrix QCM sensors data for the classification by means of neural network

  2005cited by this paper
• The Random Projection Method

  2005cited by this paper
• Averaging on Riemannian manifolds and unsupervised learning using neural associative memory

  2005cited by this paper
• Some approaches to analogical mapping with structure-sensitive distributed representations

  2004cited by this paper
• Low-Distortion Embeddings of Finite Metric Spaces

  2004cited by this paper
• Computing with large random patterns

  2001cited by this paper
• Representation and Processing of Structures with Binary Sparse Distributed Codes

  2001cited by this paper
• Quality and efficiency of retrieval for Willshaw-like autoassociative networks: III. Willshaw–Potts model

  1997cited by this paper

• Classification using hyperdimensional computing: a review with comparative analysis

  2025cites this paper
• The transformative potential of vector symbolic architecture for cognitive processing at the network edge

  2024cites this paper
• On Design Choices in Similarity-Preserving Sparse Randomized Embeddings

  2024cites this paper
• Semantic vector space mapping in edge of network multi-domain operations

  2023cites this paper
• Future Generation Computer Systems

  2023cites this paper
• Trustable service discovery for highly dynamic decentralized workflows

  2022cites this paper
• Energy efficient spiking neural network neuromorphic processing to enable decentralised service workflow composition in support of multi-domain operations

  2022cites this paper
• Streaming Encoding Algorithms for Scalable Hyperdimensional Computing

  2022cites this paper
• Expansion of Information in the Binary Autoencoder With Random Binary Weights

  2021cites this paper
• Shift-Equivariant Similarity-Preserving Hypervector Representations of Sequences

  2021cites this paper
• Energy efficient 'in memory' computing to enable decentralised service workflow composition in support of multi-domain operations

  2021cites this paper
• Binary autoencoder with random binary weights

  2020cites this paper
• Neural Distributed Representations of Vector Data in Intelligent Information Technologies

  2018cites this paper
• Binary Vectors for Fast Distance and Similarity Estimation

  2017influential citation
• Информатика и информационные технологии NEURAL DISTRIBUTED AUTOASSOCIATIVE MEMORIES: A SURVEY

  2017cites this paper
• Neural Distributed Autoassociative Memories: A Survey

  2017cites this paper