A dynamic niching clustering algorithm based on individual-connectedness and its application to colo

A dynamic niching clustering algorithm based on individual-connectedness and its application to color image segmentation

Abstract
Automatically evolve the optimal number of clusters as well as the cluster centers of data set based on the proposed adaptive compact k-distance neighborhood algorithm.

---

Notations

$X$: The dataset. Where $X=\{x_1,x_2,\dots,x_n\}$, $x_i\in \mathbb{R}^d$.

$N_K(x)$: The $K$-NN set of object $x$.

Adaptive compact k-distance neighborhood algorithm

1. Evaluate each object $x$’s neighbor-based density factor by
   

   $$\begin{equation} NDF(x)=\frac{\left|\{y| x\in N_K(y)\}\right|}{|N_K(x)|} \end{equation}$$
   And for each $x \in X$, compute the optimal $K$ using MANOVA(multivariate analysis of variance).

2. When $NDF(x)\geq 1$, call $x$ a dense point, and denote $O=\{x| NDF(x)\geq 1\}$ .

3. Build the graph $G=(O, E)$, where $E=\{\langle x, y\rangle| x \in O \cap N_K(y), y \in O \cap N_K(x)\}$.

4. Clustering $O$ by the connectedness in $G$, and the elements of $X-O$ are assigned by the principle of proximity.

Pit

There is a pit that I can’t understand the procedure that find the optimal cluster number and cluster centers by GA(Genetic Algorithm).