Andere Kunden interessierten sich auch für
![Quantum Theories and Geometry]( "Quantum Theories and Geometry")
Quantum Theories and Geometry125,99 €![Exercises in Quantum Mechanics]( "Exercises in Quantum Mechanics")
Exercises in Quantum Mechanics125,99 €![Quantization of Singular Symplectic Quotients]( "Quantization of Singular Symplectic Quotients")
Quantization of Singular Symplectic Quotients106,99 €![Quantum Theory, Groups and Representations]( "Quantum Theory, Groups and Representations")
Quantum Theory, Groups and Representations60,99 €![Quantization on Nilpotent Lie Groups]( "Quantization on Nilpotent Lie Groups")
Quantization on Nilpotent Lie Groups38,99 €![Geometric Methods in Physics]( "Geometric Methods in Physics")
Geometric Methods in Physics74,99 €![Geometric Methods in Physics]( "Geometric Methods in Physics")
Geometric Methods in Physics110,99 €
High Quality Content by WIKIPEDIA articles! Vector quantization is a classical quantization technique from signal processing which allows the modeling of probability density functions by the distribution of prototype vectors. It was originally used for data compression. It works by dividing a large set of points (vectors) into groups having approximately the same number of points closest to them. Each group is represented by its centroid point, as in k-means and some other clustering algorithms. The density matching property of vector quantization is powerful, especially for identifying the density of large and high-dimensioned data. Since data points are represented by the index of their closest centroid, commonly occurring data have low error, and rare data high error. This is why VQ is suitable for lossy data compression. It can also be used for lossy data correction and density estimation. Vector quantization is based on the competitive learning paradigm, so it is closely related to the self-organizing map model.