On Soft Learning Vector Quantization Based on Reformulation

نویسندگان

  • Jian Yu
  • Pengwei Hao
چکیده

The complex admissibility conditions for reformulated function in Karayiannis model is obtained based on the three axioms of radial basis function neural network. In this paper, we present an easier understandable assumption about vector quantization and radial basis function neural network. Under this assumption, we have obtained a simple but equivalent criterion for admissible reformulation function in Karayiannis model. We have also discovered that Karayiannis model for vector quantization has a trivial fixed point. Such results are useful for developing new vector quantization algorithms.

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

ثبت نام

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

منابع مشابه

An axiomatic approach to soft learning vector quantization and clustering

This paper presents an axiomatic approach to soft learning vector quantization (LVQ) and clustering based on reformulation. The reformulation of the fuzzy c-means (FCM) algorithm provides the basis for reformulating entropy-constrained fuzzy clustering (ECFC) algorithms. This analysis indicates that minimization of admissible reformulation functions using gradient descent leads to a broad varie...

متن کامل

Soft learning vector quantization and clustering algorithms based on ordered weighted aggregation operators

This paper presents the development and investigates the properties of ordered weighted learning vector quantization (LVQ) and clustering algorithms. These algorithms are developed by using gradient descent to minimize reformulation functions based on aggregation operators. An axiomatic approach provides conditions for selecting aggregation operators that lead to admissible reformulation functi...

متن کامل

Soft learning vector quantization and clustering algorithms based on non-Euclidean norms: multinorm algorithms

This paper presents the development of soft clustering and learning vector quantization (LVQ) algorithms that rely on multiple weighted norms to measure the distance between the feature vectors and their prototypes. Clustering and LVQ are formulated in this paper as the minimization of a reformulation function that employs distinct weighted norms to measure the distance between each of the prot...

متن کامل

Post - Clustering Soft Vector Quantization with Inverse Power - Function Distribution , and Application on Discrete HMM - Based Machine Learning

In this paper, we introduce a soft vector quantization scheme with inverse power-function distribution, and analytically derive an upper bound of the resulting quantization noise energy in comparison to that of typical (hard-deciding) vector quantization. We also discuss the positive impact of this kind of soft vector quantization on the performance of machine-learning systems that include one ...

متن کامل

Analysis of Robust Soft Learning Vector Quantization and an application to Facial Expression Recognition

Learning Vector Quantization (LVQ) [1] is a popular method for multiclass classification. Several variants of LVQ have been developed recently, of which Robust Soft Learning Vector Quantization (RSLVQ) [2] is a promising one. Although LVQ methods have an intuitive design with clear updating rules, their dynamics are not yet well understood. In simulations within a controlled environment RSLVQ p...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2004