Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case (Q5122317): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3232636 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5617409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The planar \(k\)-means problem is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cluster Analysis and Mathematical Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3241581 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal quantization by matrix searching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5611319 / rank | |||
Normal rank | |||
Latest revision as of 15:36, 23 July 2024
scientific article; zbMATH DE number 7250773
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case |
scientific article; zbMATH DE number 7250773 |
Statements
Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case (English)
0 references
22 September 2020
0 references
\(K\)-Means
0 references
one-dimensional case
0 references
parameterized approach
0 references
linear-time algorithm
0 references
