A Novel Minimum Spanning Tree Clustering Algorithm Based on Density Core

Algorithm 1

Natural neighbor searching algorithm (NaN-searching).

	Input: (the dataset)
	Output: (the natural characteristic value), (natural neighbors)
(1)	Initial ;
(2)	create a KD-tree from the dataset ;
(3)	while do
(4)	for each object in d
(5)	find the neighbor of using
(6)	;
(7)	;
(8)	;
(9)	end for
(10)	;
(11)	;
(12)	ifthen
(13)	break;
(14)	end if
(15)	;
(16)	end while
(17)	;
(18)	for each object in do
(19)	;
(20)	end for
(21)	Return ,