Fast Density Clustering Algorithm for Numerical Data and Categorical Data

Algorithm 1

Step 1. Suppose denotes a set of data objects.

Calculate the corresponding density set and distance

set . Initial set the center set and sort the

density in descending order as shown:

Step 2. Select the maximum density value , and .

Step 3. Find the corresponding data object according to.

Step 4. Get the distance value of data object , and

 If ()

 then

    and turn to step ;

 else if )

 then

    and turn to step ;

 else

   Turn to step .

Step 5. Output cluster centers set .