A Modified Parallel Learning Vector Quantization Algorithm for Real-Time Hardware Applications

Date

2017-10-01

Author

Alkim, Erdem
AKLEYLEK, SEDAT
KILIÇ, ERDAL

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

232
views

0
downloads

In this study a modified learning vector quantization (LVQ) algorithm is proposed. For this purpose, relevance LVQ (RLVQ) algorithm is effciently combined with a reinforcement mechanism. In this mechanism, it is shown that the proposed algorithm is not affected constantly by both relevance-irrelevance input dimensions and the winning of the same neuron. Hardware design of the proposed scheme is also given to illustrate the performance of the algorithm. The proposed algorithm is compared to the corresponding ones with regard to success rate and running time.

Subject Keywords

FPGA, LVQ, GLVQ, Reinforcement mechanism

URI

https://hdl.handle.net/11511/66720

Journal

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS

DOI

https://doi.org/10.1142/s0218126617501560

Collections

Graduate School of Applied Mathematics, Article

Suggestions

OpenMETU
Core

A linear approximation for training Recurrent Random Neural Networks Halıcı, Uğur (1998-01-01) In this paper, a linear approximation for Gelenbe's Learning Algorithm developed for training Recurrent Random Neural Networks (RRNN) is proposed. Gelenbe's learning algorithm uses gradient descent of a quadratic error function in which the main computational effort is for obtaining the inverse of an n-by-n matrix. In this paper, the inverse of this matrix is approximated with a linear term and the efficiency of the approximated algorithm is examined when RRNN is trained as autoassociative memory.
A genetic algorithm for TSP with backhauls based on conventional heuristics Önder, İlter; Özdemirel, Nur Evin; Department of Information Systems (2007) A genetic algorithm using conventional heuristics as operators is considered in this study for the traveling salesman problem with backhauls (TSPB). Properties of a crossover operator (Nearest Neighbor Crossover, NNX) based on the nearest neighbor heuristic and the idea of using more than two parents are investigated in a series of experiments. Different parent selection and replacement strategies and generation of multiple children are tried as well. Conventional improvement heuristics are also used as mut...
A generative model for multi class object recognition and detection Ulusoy, İlkay (2006-01-01) In this study, a generative type probabilistic model is proposed for object recognition. This model is trained by weakly labelled images and performs classification and detection at the same time. When test on highly challenging data sets, the model performs good for both tasks (classification and detection).
A Probabilistic approach to sparse multi scale phase based stereo ULUSOY PARNAS, İLKAY; Halıcı, Uğur; HANCOCK, EDWIN (2004-04-30) In this study, a multi-scale phase based sparse disparity algorithm and a probabilistic model for matching are proposed. The disparity algorithm and the probabilistic approach are verified on various stereo image pairs.
A matheuristic for binary classification of data sets using hyperboxes Akbulut, Derya; İyigün, Cem; Özdemirel, Nur Evin (null; 2018-07-08) In this study, an optimization approach is proposed for the binary classification problem. A Mixed Integer Programming (MIP) model formulation is used to construct hyperboxes as classifiers, minimizing the number of misclassified and unclassified samples as well as overlapping of hyperboxes. The hyperboxes are determined by some lower and upper bounds on the feature values, and overlapping of these hyperboxes is allowed to keep a balance between misclassification and overfitting. A matheuristic, namely Iter...

Citation Formats

E. Alkim, S. AKLEYLEK, and E. KILIÇ, “A Modified Parallel Learning Vector Quantization Algorithm for Real-Time Hardware Applications,” JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, pp. 0–0, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66720.