A fast \(k\)-means clustering algorithm using cluster center displacement (Q2270719): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.patcog.2009.02.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057536593 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Image restoration of compressed image using classified vector quantization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Artifact reduction of JPEG coded images using mean-removed classified vector quantization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast VQ codebook generation algorithm using codeword displacement / rank | |||
Normal rank | |||
Latest revision as of 20:55, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast \(k\)-means clustering algorithm using cluster center displacement |
scientific article |
Statements
A fast \(k\)-means clustering algorithm using cluster center displacement (English)
0 references
29 July 2009
0 references
\(k\)-means clustering
0 references
nearest-neighbor search
0 references
knowledge discovery
0 references
