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 profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_35 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3005703968 / rank | |||
Normal rank | |||
Revision as of 21:38, 19 March 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
