An Effective Clustering Algorithm Using Adaptive Neighborhood and Border Peeling Method

Algorithm 1

Natural neighbor searching algorithm.

 Input: A set of points

 Output: NaN_Num (x_i)

 T =  (X) //Create a k − d tree T from dataset X

 r = 1, flag = 0, NaN_Edge = ,

 While flag = = 0 do

  For all do

   If

    then

    End If

  End For

  If all ()

      flag = 1

  End If

   r = r + 1

 End While

  = r − 1

 Return: NaN_Num (x_i)_l