Random Kernel Perceptron on ATTiny2313 Microcontroller

نویسندگان

  • Nemanja Djuric
  • Slobodan Vucetic
چکیده

Kernel Perceptron is very simple and efficient online classification algorithm. However, it requires increasingly large computational resources with data stream size and is not applicable on large-scale problems or on resource-limited computational devices. In this paper we describe implementation of Kernel Perceptron on ATTiny2313 microcontroller, one of the most primitive computational devices with only 128B of data memory and 2kB of program memory. ATTyny2313 is a representative of devices that are popular in embedded systems and sensor networks due to their low cost and low power consumption. Implementation on microcontrollers is possible thanks to two properties of Kernel Perceptrons: (1) availability of budgeted Kernel Perceptron algorithms that bound the model size, and (2) relatively simple calculations required to perform online learning and provide predictions. Since ATTiny2313 is the fixedpoint controller that supports floating-point operations through software which introduces significant computational overhead, we considered implementation of basic Kernel Perceptron operations through fixed-point arithmetic. In this paper, we present a new approach to approximate one of the most used kernel functions, the RBF kernel, on fixed-point microcontrollers. We conducted simulations of the resulting budgeted Kernel Perceptron on several datasets and the results show that accurate Kernel Perceptrons can be trained using ATTiny2313. The success of our implementation opens the doors for implementing powerful online learning algorithms on the most resource-constrained computational devices.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Kernel Perceptrons on Noisy Data and Random Projections

In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classification noise. Our proposed approach relies on the combination of the technique of random or deterministic projections with a classification noise tolerant perceptron learning algorithm that assumes distributions defined ...

متن کامل

Learning Kernel Perceptrons on Noisy Data Using Random Projections

In this paper, we address the issue of learning nonlinearly separable concepts with a kernel classifier in the situation where the data at hand are altered by a uniform classification noise. Our proposed approach relies on the combination of the technique of random or deterministic projections with a classification noise tolerant perceptron learning algorithm that assumes distributions defined ...

متن کامل

The Digital Kernel Perceptron

In this paper, we show that a kernel-based perceptron can be efficiently implemented in digital hardware using very few components. Despite its simplicity, the experimental results on standard data sets show remarkable performance in terms of generalization error. Introduction: A practical way to build non-linear

متن کامل

EEG machine learning with Higuchi fractal dimension and Sample Entropy as features for successful detection of depression

Reliable diagnosis of depressive disorder is essential for both optimal treatment and prevention of fatal outcomes. In this study, we aimed to elucidate the effectiveness of two non-linear measures, Higuchi’s Fractal Dimension (HFD) and Sample Entropy (SampEn), in detecting depressive disorders when applied on EEG. HFD and SampEn of EEG signals were used as features for seven machine learning a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010