skip to content
The hardness of k-means clustering Preview this item
ClosePreview this item
Checking...

The hardness of k-means clustering

Author: Sanjoy Dasgupta
Publisher: [La Jolla, Calif.] : Dept. of Computer Science and Engineering, University of California, San Diego, [2008]
Series: Technical report (University of California, San Diego. Department of Computer Science and Engineering), no. CS08-916.
Edition/Format:   eBook : Document : English
Database:WorldCat
Summary:
We show that k-means clustering is an NP-hard optimization problem, even if k is fixed to 2.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Sanjoy Dasgupta
OCLC Number: 781857994
Description: 1 online resource (6 pages) : illustrations.
Details: System requirements: PostScript.
Series Title: Technical report (University of California, San Diego. Department of Computer Science and Engineering), no. CS08-916.
Responsibility: Sanjoy Dasgupta.

Abstract:

We show that k-means clustering is an NP-hard optimization problem, even if k is fixed to 2.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/781857994>
library:oclcnum"781857994"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/781857994>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:creator
schema:datePublished"2008"
schema:description"We show that k-means clustering is an NP-hard optimization problem, even if k is fixed to 2."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1096042999>
schema:inLanguage"en"
schema:name"The hardness of k-means clustering"@en
schema:publisher
schema:url<http://bibpurl.oclc.org/web/45757/CS2008-0916>
schema:url<http://csetechrep.ucsd.edu/Dienst/UI/2.0/Describe/ncstrl.ucsd_cse/CS2008-0916>
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.