Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/1096042999

The hardness of k-means clustering

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

Open All Close All

type

http://www.w3.org/1999/02/22-rdf-syntax-ns#type

about

http://schema.org/about

creator

http://schema.org/creator

http://worldcat.org/entity/person/id/2630506676

description

http://schema.org/description

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

name

http://schema.org/name

"The hardness of k-means clustering"@en

workExample

http://schema.org/workExample

http://www.worldcat.org/oclc/781857994