Hyperdimensional Computing: An Introduction to Computing in Distributed Representation with High-Dimensional Random Vectors
The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270 · cited 1×
“The best-known of these models is the Hopfield net [3].”
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
Landauer, T. K., & Dumais, S. T. (1997) · Psychological Review · doi:10.1037/0033-295x.104.2.211 · Cited by 6,282
Advances in Neural Information Processing Systems 5
Zemel, R. S., Williams, C. K. I., & Mozer, M. C. (1993) · Cited by 1,896
Kanerva, P. (1988) · Medical Entomology and Zoology · Cited by 976
Self-citationSmolensky, P. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90007-m · Cited by 959
Parallel models of associative memory
Hinton, G. E., & Anderson, J. A. (1981) · CERN Document Server (European Organization for Nuclear Research) · Cited by 927
Kohonen, T. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5008975 · Cited by 885
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
Proceedings of the fourteenth annual conference of the cognitive science society
Shillcock, R. C., Lindsey, G. L., Levy, J., & Nick Chater, A. (1992) · Cited by 675
Representing word meaning and order information in a composite holographic lexicon.
Jones, M. N., & Mewhort, D. J. K. (2007) · Psychological Review · doi:10.1037/0033-295x.114.1.1 · Cited by 613
A simple neural network generating an interactive memory
Anderson, J. A. (1972) · Mathematical Biosciences · doi:10.1016/0025-5564(72)90075-2 · Cited by 553
Random indexing of text samples for latent semantic analysis
Kanerva, P., Kristoferson, J., & Holst, A. (2000) · eScholarship (California Digital Library) · Cited by 488
Self-citationDimensionality reduction by random mapping: fast similarity computation for clustering
Kaski, S. (2002) · 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227) · doi:10.1109/ijcnn.1998.682302 · Cited by 388
Mapping part-whole hierarchies into connectionist networks
Hinton, G. E. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90004-j · Cited by 310
Neural Assemblies: An Alternative Approach to Artificial Intelligence
Palm, G. (1982) · MPG.PuRe (Max Planck Society) · Cited by 301
(1982) · Studies of Brain Function · doi:10.1007/978-3-642-81792-2 · Cited by 267
Algorithmic applications of low-distortion geometric embeddings
Indyk, P. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959878 · Cited by 253
Widdows, D. (2004) · Cited by 245
Schütze, H. (1992) · neural information processing systems · Cited by 205
Associative neural memories : theory and implementation
Hassoun, M. H. (1993) · Oxford University Press eBooks · Cited by 179
Permutations as a means to encode order in word space
Sahlgren, M., Holst, A., & Kanerva, P. (2008) · DiVA (Digitala Vetenskapliga Arkivet) · Cited by 167
Self-citationBinary spatter-coding of ordered K-tuples
Kanerva, P. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61510-5_146 · Cited by 129
Self-citationBinding and Normalization of Binary Sparse Distributed Representations by Context-Dependent Thinning
Rachkovskij, D. A., & Kussul, E. M. (2001) · Neural Computation · doi:10.1162/089976601300014592 · Cited by 119
Plate, T. A. (1991) · Cited by 103
Cited by
The future of electronics based on memristive systems
Zidan, M. A., Strachan, J. P., & Lu, W. D. (2018) · Nature Electronics · doi:10.1038/s41928-017-0006-8 · Cited by 2,138
Graves, A., Wayne, G., & Danihelka, I. (2014) · arXiv · doi:10.48550/arxiv.1410.5401 · Cited by 1,058
“In response to this criticism, neural network researchers including Hinton (Hinton, 1986), Smolensky (Smolensky, 1990), Touretzky (Touretzky, 1990), Pollack (Pollack, 1990), Plate (Plate, 2003), and Kanerva (Kanerva, 2009) investigated specific mechanisms that could support both variable-binding and variable-length”
BackgroundComposition in Distributional Models of Semantics
Mitchell, J., & Lapata, M. (2010) · Cognitive Science · doi:10.1111/j.1551-6709.2010.01106.x · Cited by 960
A wearable biosensing system with in-sensor adaptive machine learning for hand gesture recognition
Moin, A., Zhou, A., Rahimi, A., Menon, A., Benatti, S., Alexandrov, G., Tamakloe, S., Ting, J., Yamamoto, N., Khan, Y., et al. (2020) · Nature Electronics · doi:10.1038/s41928-020-00510-8 · Cited by 680
Linking Connectivity, Dynamics, and Computations in Low-Rank Recurrent Neural Networks
Mastrogiuseppe, F., & Ostojic, S. (2018) · Neuron · doi:10.1016/j.neuron.2018.07.003 · Cited by 391
Metadata
- Authors
- Kanerva, P.
- Venue
- Cognitive Computation
- Published
- 2009-01-28
- Volume
- 1
- Issue
- 2
- Pages
- 139-159
- ISSN
- 1866-9956 (ISSN-L)
- 1866-9964
- OpenAlex
- W2070862086
- Cited by
- 970
- References
- 25
- FWCI
- 14.10
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.