Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification (Q2654244): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Least squares quantization in PCM / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5617409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4935997 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3093255 / rank | |||
Normal rank | |||
Latest revision as of 08:47, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification |
scientific article |
Statements
Two-level \(k\)-means clustering algorithm for \(k\)-\(\tau \) relationship establishment and linear-time classification (English)
0 references
15 January 2010
0 references
clustering
0 references
\(k\)-means
0 references
classification
0 references
linear-time complexity
0 references
support vector machines
0 references
\(k\)-nearest neighbor classifier
0 references
