Skip to main content
Download PDF
- Main
The hardness of k-means clustering
Abstract
We show that k-means clustering is an NP-hard optimization problem, even if k is fixed to 2.
Pre-2018 CSE ID: CS2008-0916
Main Content
For improved accessibility of PDF content, download the file to your device.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%