Revision as of 00:13, 18 August 2007 edit Pgan002 (talk \| contribs) Extended confirmed users 15,370 edits m →Intro ← Previous edit		Revision as of 00:14, 18 August 2007 edit undo Pgan002 (talk \| contribs) Extended confirmed users 15,370 edits m →Intro Next edit →
Line 4: 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 VC 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. == Training ==

Vector quantization: Difference between revisions