PHA: A fast potential-based hierarchical agglomerative clustering method

Authors:
Yonggang Lu;Yi Wan
Affiliations:
School of Information Science and Engineering, Lanzhou University, Lanzhou 730000, China;School of Information Science and Engineering, Lanzhou University, Lanzhou 730000, China
Venue:
Pattern Recognition
Year:
2013

Citing 10
Cited 0

Potential-Based Hierarchical Clustering

ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
Bayesian hierarchical clustering

ICML '05 Proceedings of the 22nd international conference on Machine learning
An overview of clustering methods

Intelligent Data Analysis
Efficient algorithms for accurate hierarchical clustering of huge datasets

Bioinformatics
A scalable framework for cluster ensembles

Pattern Recognition
Data clustering: 50 years beyond K-means

Pattern Recognition Letters
A novel hierarchical-clustering-combination scheme based on fuzzy-similarity relations

IEEE Transactions on Fuzzy Systems
Molecular dynamics-like data clustering approach

Pattern Recognition
Clustering by Sorting Potential Values (CSPV): A novel potential-based clustering method

Pattern Recognition
Survey of clustering algorithms

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

A novel potential-based hierarchical agglomerative (PHA) clustering method is proposed. In this method, we first construct a hypothetical potential field of all the data points, and show that this potential field is closely related to nonparametric estimation of the global probability density function of the data points. Then we propose a new similarity metric incorporating both the potential field which represents global data distribution information and the distance matrix which represents local data distribution information. Finally we develop another equivalent similarity metric based on an edge weighted tree of all the data points, which leads to a fast agglomerative clustering algorithm with time complexity O(N^2). The proposed PHA method is evaluated by comparing with six other typical agglomerative clustering methods on four synthetic data sets and two real data sets. Experiments show that it runs much faster than the other methods and produces the most satisfying results in most cases.