An Extension to Basis-Hypervectors for Learning from Circular Data in Hyperdimensional Computing

05/16/2022
by   Igor Nunes, et al.
0

Hyperdimensional Computing (HDC) is a computation framework based on properties of high-dimensional random spaces. It is particularly useful for machine learning in resource-constrained environments, such as embedded systems and IoT, as it achieves a good balance between accuracy, efficiency and robustness. The mapping of information to the hyperspace, named encoding, is the most important stage in HDC. At its heart are basis-hypervectors, responsible for representing the smallest units of meaningful information. In this work we present a detailed study on basis-hypervector sets, which leads to practical contributions to HDC in general: 1) we propose an improvement for level-hypervectors, used to encode real numbers; 2) we introduce a method to learn from circular data, an important type of information never before addressed in machine learning with HDC. Empirical results indicate that these contributions lead to considerably more accurate models for both classification and regression with circular data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/10/2021

An Optimal Algorithm for Strict Circular Seriation

We study the problem of circular seriation, where we are given a matrix ...
research
09/21/2019

An algorithm and new bounds for the circular flow number of snarks

It is well-known that the circular flow number of a bridgeless cubic gra...
research
07/18/2019

A study of multivalent q-starlike functions connected with circular domain

In the present article, our aim is to examine some useful problems inclu...
research
05/16/2022

GraphHD: Efficient graph classification using hyperdimensional computing

Hyperdimensional Computing (HDC) developed by Kanerva is a computational...
research
04/09/2019

Testing isomorphism of circular-arc graphs -- Hsu's approach revisited

Circular-arc graphs are intersection graphs of arcs on the circle. The a...
research
12/28/2020

A circular version of Gödel's T and its abstraction complexity

Circular and non-wellfounded proofs have become an increasingly popular ...
research
05/06/2021

Machine Collaboration

We propose a new ensemble framework for supervised learning, named machi...

Please sign up or login with your details

Forgot password? Click here to reset