A heuristic hierarchical clustering based on multiple similarity measurements

Similarity is the core problem of clustering. Clustering algorithms that are based on a certain, fixed type of similarity are not sufficient to explore complicated structures. In this paper, a constructing method for multiple similarity is proposed to deal with complicated structures of data sets. Multiple similarity derives from the local modification of the initial similarity, based on the feedback information of elementary clusters. Combined with the proposed algorithm, the repeated modifications of local similarity measurement generate a hierarchical clustering result. Some synthetic and real data sets are employed to exhibit the superiority of the new clustering algorithm.

► Multiple similarity mechanism is proposed for clustering based on heuristic method.
► The similarity will be revised locally for each layer in the clustering process.
► No priors of types of data sets are needed, e.g., distribution, shape.
► The algorithm is superior in computing complexity, accuracy, and application field.