On the strengths of the self-updating process clustering algorithm
We introduce a simple, intuitive and yet powerful algorithm for clustering analysis. This algorithm is an iterative process on the sample space, which arises as an extension of the iteratively generated correlation matrices. It allows for both time-varying and time-invariant operators, therefore can be considered more general than the blurring mean-shift algorithm in which operators are time-invariant. The algorithm stands from the viewpoint of data points and simulates the process how data points move and perform self-clustering, therefore is named Self-Updating Process (SUP). It is particularly competitive for (i) data with noise, (ii) data with large number of clusters and (iii) unbalanced data. When noise is present in the data, the algorithm is able to isolate noisy points while performing clustering simultaneously. Simulation studies and real data applications are presented to demonstrate the performance of SUP.