Canonical PSO Based k-Means Clustering Approach for Real Datasets
Lopamudra Dey, Sanjay Chakraborty

TL;DR
This paper introduces a Canonical PSO based K-means clustering algorithm, evaluates various clustering indices, and compares its performance on real datasets to determine the most effective clustering method.
Contribution
The paper proposes a novel Canonical PSO based K-means algorithm and analyzes its effectiveness using multiple validity indices on real datasets.
Findings
Canonical PSO improves clustering performance over traditional methods
Different indices influence the evaluation of cluster quality
The proposed method outperforms other clustering algorithms in certain datasets
Abstract
"Clustering" the significance and application of this technique is spread over various fields. Clustering is an unsupervised process in data mining, that is why the proper evaluation of the results and measuring the compactness and separability of the clusters are important issues.The procedure of evaluating the results of a clustering algorithm is known as cluster validity measure. Different types of indexes are used to solve different types of problems and indices selection depends on the kind of available data.This paper first proposes Canonical PSO based K-means clustering algorithm and also analyses some important clustering indices (intercluster, intracluster) and then evaluates the effects of those indices on real-time air pollution database,wholesale customer, wine, and vehicle datasets using typical K-means, Canonical PSO based K-means, simple PSO based K-means,DBSCAN, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Clustering Algorithms Research · Data Stream Mining Techniques · Data Mining Algorithms and Applications
