A Fast Incremental Clustering Algorithm.

Clustering has played a very important role in data mining. In this paper, a fast incremental clustering algorithm is proposed by changing the radius threshold value dynamically. The algorithm restricts the number of the final clusters and reads the original dataset only once. At the same time an inter-cluster dissimilarity measure taking into account the frequency information of the attribute values is introduced. It can be used for the categorical data. The experimental results on the mushroom dataset show that the proposed algorithm is feasible and effective. It can be used for the large-scale data set. [ABSTRACT FROM AUTHOR]