To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Classification and recall with binary hyperdimensional computing: Tradeoffs in choice of density and nmapping characteristics
Department of Computer Science Electrical and Space Engineering, Luleå University of Technology, Luleå, Sweden.ORCID iD: 0000-0002-6032-6155
Department of Information Technology and Electrical Engineering, ETH Zürich, Zürich, Switzerland.ORCID iD: 0000-0003-3141-4970
Department of Neural Information Processing Technologies, International Research and Training Center for Information Technologies and Systems, Kiev, Ukraine.
Department of Computer Science Electrical and Space Engineering, Luleå University of Technology, Luleå, Sweden.ORCID iD: 0000-0003-0069-640X
Show others and affiliations
2018 (English)In: IEEE Transactions on Neural Networks and Learning Systems, ISSN 2162-237X, E-ISSN 2162-2388, Vol. 29, no 12, p. 5880-5898Article in journal (Refereed) Published
Abstract [en]

Hyperdimensional (HD) computing is a promising paradigm for future intelligent electronic appliances operating at low power. This paper discusses tradeoffs of selecting parameters of binary HD representations when applied to pattern recognition tasks. Particular design choices include density of representations and strategies for mapping data from the original representation. It is demonstrated that for the considered pattern recognition tasks (using synthetic and real-world data) both sparse and dense representations behave nearly identically. This paper also discusses implementation peculiarities which may favor one type of representations over the other. Finally, the capacity of representations of various densities is discussed.

Place, publisher, year, edition, pages
IEEE, 2018. Vol. 29, no 12, p. 5880-5898
Keywords [en]
Associative memory (AM), gesture recognition, hyperdimensional (HD) computing, pattern recognition, sparse distributed representation (SDR), vector symbolic architectures (VSAs)
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-116377DOI: 10.1109/tnnls.2018.2814400ISI: 000451230100008OAI: oai:DiVA.org:oru-116377DiVA, id: diva2:1901688
Funder
Swedish Research Council, 2015-04677Stiftelsen Seth M. Kempes Minnes Stipendiefond
Note

This work was supported in part by the Swedish Research Council under Grant 2015-04677 and in part by Systems on Nanoscale Information fabriCs, one of the six SRC STARnet Centers, sponsored by MARCO and DARPA. The work of D. Kleyko was supported by Stiftelsen Seth M Kempes Stipendiefond for his research visit to UC Berkeley.

Available from: 2024-09-30 Created: 2024-09-30 Last updated: 2024-10-01Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Kleyko, Denis

Search in DiVA

By author/editor
Kleyko, DenisRahimi, AbbasOsipov, EvgenyRabaey, Jan M.
In the same journal
IEEE Transactions on Neural Networks and Learning Systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 92 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf