Recursive Partitional Clustering Algorithm

A Partitional Clustering Algorithm is a clustering algorithm that partitions all of the data records immediately and then iteratively adjust them.

• AKA: Partitioning Relocation Clustering Algorithm, Partitioning Clustering Algorithm.
• Context:
  • It can involve the relocation of a Centroid.
• Example(s):
  • A k-Means Clustering Algorithm.
  • A k-Medoid Clustering Algorithm.
• Counter-Example(s):
  • any Hierarchical Clustering Algorithm.
• See: Set Partition, Equivalence Relation.

---

---

References

• (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Cluster_analysis#Hierarchical_clustering
  • Partitional algorithms typically determine all clusters at once, but can also be used as divisive algorithms in the hierarchical clustering.

---