Hard clustering

From Machinelearning
Revision as of 14:34, 15 April 2020 by Sebastian (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Hard clustering is a type of clustering which consists in grouping the data items such that each item is only assigned to one cluster.[1]

Algorithms

Some hard clustering algorithms are:

  • K-means: A famous hard clustering algorithm whereby the data items are clustered into K clusters such that each item only blogs to one cluster.[1]

References