A Fast Clustering Algorithm for Data with a Few Labeled Instances

Algorithm 1

The FPC algorithm for unsupervised learning [1].

Algorithm: FPC

Input: The input data , and the number of clusters.

Output: The partition of .

;

Randomly select an instance from ;

;

while ()

 ;

 ;

end while

Let be the partition by assigning each instance of to

its nearest neighbor in (if , the nearest neighbor of

in is itself);

return   ;