Maximize K-Clustering Spacing: Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
* [[Clustering_Concepts#Clustering_Algorithms|Clustering Concepts]] | * [[Clustering_Concepts#Clustering_Algorithms|Clustering Concepts]] | ||
=Overview= | =Overview= | ||
This is a greedy algorithm that aims to maximize | This is a greedy algorithm that aims to maximize [[Clustering_Concepts#Spacing_of_a_K-Clustering|spacing]] between any two clusters. By spacing between two clusters we mean the minimum distance between any two separated points, which belong to two distinct clusters: | ||
<font size=-1> | |||
min<sub>separated p, q</sub>d(p,q) | |||
</font> | |||
"Good" clustering means that all of the separated points should be as far apart as possible. | |||
=Algorithm= | =Algorithm= | ||
=Correctness Proof= | =Correctness Proof= | ||
Revision as of 21:04, 23 October 2021
External
Internal
Overview
This is a greedy algorithm that aims to maximize spacing between any two clusters. By spacing between two clusters we mean the minimum distance between any two separated points, which belong to two distinct clusters:
minseparated p, qd(p,q)
"Good" clustering means that all of the separated points should be as far apart as possible.