Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case (Q5122317): Difference between revisions

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

instance of

scholarly article

0 references

title

Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case (English)

0 references

published in

Lecture Notes in Computer Science

0 references

publication date

22 September 2020

0 references

zbMATH Keywords

\(K\)-Means

0 references

one-dimensional case

0 references

parameterized approach

0 references

linear-time algorithm

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-40616-5_35

0 references

cites work

Q3232636

0 references

Q5617409

0 references

NP-hardness of Euclidean sum-of-squares clustering

0 references

The planar \(k\)-means problem is NP-hard

0 references

Cluster Analysis and Mathematical Programming

0 references

Q3241581

0 references

Optimal quantization by matrix searching

0 references

Q5611319

0 references

Identifiers

DOI

10.1007/978-3-030-40616-5_35

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5122317

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-40616-5_35
+Normal rank
@@ Property / OpenAlex ID @@
+W3005703968
@@ Property / OpenAlex ID: W3005703968 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3232636
@@ Property / cites work: Q3232636 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5617409
@@ Property / cites work: Q5617409 / rank @@
+Normal rank
@@ Property / cites work @@
+NP-hardness of Euclidean sum-of-squares clustering
+Normal rank
@@ Property / cites work @@
+The planar \(k\)-means problem is NP-hard
@@ Property / cites work: The planar \(k\)-means problem is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster Analysis and Mathematical Programming
@@ Property / cites work: Cluster Analysis and Mathematical Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal quantization by matrix searching
@@ Property / cites work: Optimal quantization by matrix searching / rank @@
+Normal rank
@@ Property / cites work @@
+Q5611319
@@ Property / cites work: Q5611319 / rank @@
+Normal rank