About: k-means clustering   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Class, within Data Space : covidontheweb.inria.fr associated with source document(s)

AttributesValues
type
label
  • k-means clustering
subClassOf
described by
term editor
  • James Malone
  • Philippe Rocca-Serra
  • Elisabetta Manduchi
definition
  • A k-means clustering is a data transformation which achieves a class discovery or partitioning objective, which takes as input a collection of objects (represented as points in multidimensional space) and which partitions them into a specified number k of clusters. The algorithm attempts to find the centers of natural clusters in the data. The most common form of the algorithm starts by partitioning the input points into k initial sets, either at random or using some heuristic data. It then calculates the mean point, or centroid, of each set. It constructs a new partition by associating each point with the closest centroid. Then the centroids are recalculated for the new clusters, and the algorithm repeated by alternate applications of these two steps until convergence, which is obtained when the points no longer switch clusters (or alternatively centroids are no longer changed).
definition source
  • WEB: http://en.wikipedia.org/wiki/K-means
editor preferred term
  • k-means clustering
has curation status
is type of
is topic of
is hasBody of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software