Hard clustering: Difference between revisions
No edit summary |
No edit summary |
||
| Line 4: | Line 4: | ||
Some hard clustering algorithms are: | Some hard clustering algorithms are: | ||
* [[K-means clustering|K- | * [[K-means clustering|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.<ref name="sd"/> | ||
== References == | == References == | ||
Revision as of 15:06, 14 April 2020
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
- ↑ 1.0 1.1 Machine Learning Hard Vs Soft Clusteringmedium.com