A Robust Competitive Clustering Algorithm With Applications in Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM Computing Surveys (CSUR)
Clustering by Scale-Space Filtering
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Modified Version of the K-Means Algorithm with a Distance Based on Cluster Symmetry
IEEE Transactions on Pattern Analysis and Machine Intelligence
Information Retrieval
Journal of Global Optimization
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Faster and more robust point symmetry-based K-means algorithm
Pattern Recognition
GAPS: A clustering method using a new point symmetry-based distance measure
Pattern Recognition
An overview of clustering methods
Intelligent Data Analysis
A Point Symmetry-Based Clustering Technique for Automatic Evolution of Clusters
IEEE Transactions on Knowledge and Data Engineering
Advances in Differential Evolution
Advances in Differential Evolution
Differential evolution and particle swarm optimisation in partitional clustering
Computational Statistics & Data Analysis
A weighted sum validity function for clustering with a hybrid niching genetic algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Automatic Clustering Using an Improved Differential Evolution Algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Clustering is a core problem in data mining and machine learning though it is widely applied in many fields. Recently, it is very popular to use the evolutionary algorithm to solve the problem. This paper proposes an automatic clustering differential evolution (DE) technique for the problem. This approach can be characterized by (i) proposing a modified point symmetry-based cluster validity index (CVI) as a measure of the validity of the corresponding partitioning, (ii) using the Kd-tree based nearest neighbor search to reduce the complexity of finding the closest symmetric point, and (iii) employing a new representation to represent an individual. Experiments conducted on 6 artificial data sets of diverse complexities indicate that this approach is suitable for both the symmetrical intra-clusters and the symmetrical inter-clusters. In addition, it is able to find the optimal number of clusters of the data. Furthermore, based on the comparison with the original point symmetry-based CVI, this proposed point symmetry-based CVI shows better performance in terms of the F-measure and the number of clusters found.