POCS-based Clustering Algorithm
Official implementation of the Projection Onto Convex Set (POCS)-based clustering algorithm.
Introduction
-
Main authors: Le-Anh Tran, Dong-Chul Park
-
Abstract:
This paper proposes a data clustering algorithm that is inspired by the prominent convergence property of the Projection onto Convex Sets (POCS) method, termed the POCS-based clustering algorithm. For disjoint convex sets, the form of simultaneous projections of the POCS method can result in a minimum mean square error solution. Relying on this important property, the proposed POCS-based clustering algorithm treats each data point as a convex set and simultaneously projects the cluster prototypes onto respective member data points, the projections are convexly combined via adaptive weight values in order to minimize a predefined objective function for data clustering purposes. The performance of the proposed POCS-based clustering algorithm has been verified through a large scale of experiments and data sets. The experimental results have shown that the proposed POCS-based algorithm is competitive in terms of both effectiveness and efficiency against some of the prevailing clustering approaches such as the K-means/K-Means++ and Fuzzy C-Means (FCM) algorithms. Based on extensive comparisons and analyses, we can confirm the validity of the proposed POCS-based clustering algorithm for practical purposes.
Usage
Installation
pip install pocs-based-clustering
Function
from pocs_cluster_analysis import pocs_clustering
centroids, labels = pocs_clustering(input_data, num_clusters, num_iterations)
Citation
Please cite our works if you utilize any data from this work for your study.
@inproceedings{tran2022pocs,
title={POCS-based Clustering Algorithm},
author={Tran, Le-Anh and Deberneh, Henock M and Do, Truong-Dong and Nguyen, Thanh-Dat and Le, My-Ha and Park, Dong-Chul},
booktitle={2022 International Workshop on Intelligent Systems (IWIS)},
pages={1--6},
year={2022},
organization={IEEE}
}
@article{tran2024cluster,
title={Cluster Analysis via Projection onto Convex Sets},
author={Tran, Le-Anh and Kwon, Daehyun and Deberneh, Henock Mamo and Park, Dong-Chul},
journal={Intelligent Data Analysis},
year={2024},
publisher={IOS Press}
}
Have fun!
LA Tran
Metadata
Release files for pocs-based-clustering 1.3.1
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | |
|---|---|---|---|
| pocs_based_clustering-1.3.1.tar.gz | 9.4 kB | Details |
Built distribution (wheel)
| File | Interpreter | ABI | Platform | Reset |
|---|---|---|---|---|
| pocs_based_clustering-1.3.1-py3-none-any.whl | Python 3 | none | any | Details |
Total release size: 19.5 kB
Release files / pocs_based_clustering-1.3.1.tar.gz
| Download URL | pocs_based_clustering-1.3.1.tar.gz |
|---|---|
| Size | 9.4 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
343814255ad7fcd9a167b9c4d105dde981c93134b0e8ae2cf4bfe777b87fcdd8
|
|
BLAKE2b-256 checksum How to use checksums |
cb18f5b1cc712a54f947af5c1548e32b18b392948d8a0486e57827ff363e4d08
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/4.0.2 CPython/3.7.9
|
Release files / pocs_based_clustering-1.3.1-py3-none-any.whl
| Download URL | pocs_based_clustering-1.3.1-py3-none-any.whl |
|---|---|
| Size | 10.1 kB |
| Tags | Python 3 |
|
SHA-256 checksum How to use checksums |
c4752b0b0199f5383549b898fc5504e53dc60b045a44a02fe76e8a5028f408f4
|
|
BLAKE2b-256 checksum How to use checksums |
7344d0672647bd62ca36e8d1eea043a46d5ad8250947ba45bf91b614bbfbcca2
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
No |
| Uploaded via |
twine/4.0.2 CPython/3.7.9
|