Hard Clustering Algorithm
(Redirected from hard clustering)
Jump to navigation
Jump to search
A Hard Clustering Algorithm is a clustering algorithm that can be implemented into a hard clustering system (to solve a hard clustering task.
- AKA: Crisp-boundary Clustering Task.
- Context:
- It can be solved by a Hard Clustering System (that implements a Hard Clustering Algorithm).
- …
- Counter-Example(s):
- See: More Than One, Cluster.
References
2011
- http://en.wikipedia.org/wiki/Fuzzy_clustering
- QUOTE: … In hard clustering, data is divided into distinct clusters, where each data element belongs to exactly one cluster. In fuzzy clustering (also referred to as soft clustering), data elements can belong to more than one cluster, and associated with each element is a set of membership levels. These indicate the strength of the association between that data element and a particular cluster. Fuzzy clustering is a process of assigning these membership levels, and then using them to assign data elements to one or more clusters.