The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).
If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.
Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.
BibTex Citation Data :
@article{JOIV934, author = {Mohammed Ahmed Jubair and Salama A. Mostafa and Aida Mustapha and Zirawani Baharum and Mohamad Aizi Salamat and Aldo Erianda}, title = {A Multi-Agent K-Means Algorithm for Improved Parallel Data Clustering}, journal = {JOIV : International Journal on Informatics Visualization}, volume = {6}, number = {1-2}, year = {2022}, keywords = {K-means; decision-making; clustering; multi-agent system.}, abstract = {Due to the rapid increase in data volumes, clustering algorithms are now finding applications in a variety of fields. However, existing clustering techniques have been deemed unsuccessful in managing large data volumes due to the issues of accuracy and high computational cost. As a result, this work offers a parallel clustering technique based on a combination of the K-means and Multi-Agent System algorithms (MAS). The proposed technique is known as Multi-K-means (MK-means). The main goal is to keep the dataset intact while boosting the accuracy of the clustering procedure. The cluster centers of each partition are calculated, combined, and then clustered. The performance of the suggested method's statistical significance was confirmed using the five datasets that served as testing and assessment methods for the proposed algorithm's efficacy. In terms of performance, the proposed MK-means algorithm is compared to the Clustering-based Genetic Algorithm (CGA), the Adaptive Biogeography Clustering-based Genetic Algorithm (ABCGA), and standard K-means algorithms. The results show that the MK-means algorithm outperforms other algorithms because it works by activating agents separately for clustering processes while each agent considers a separate group of features.}, issn = {2549-9904}, pages = {145--150}, doi = {10.30630/joiv.6.1-2.934}, url = {https://joiv.org/index.php/joiv/article/view/934} }
Refworks Citation Data :
@article{{JOIV}{934}, author = {Jubair, M., Mostafa, S., Mustapha, A., Baharum, Z., Salamat, M., Erianda, A.}, title = {A Multi-Agent K-Means Algorithm for Improved Parallel Data Clustering}, journal = {JOIV : International Journal on Informatics Visualization}, volume = {6}, number = {1-2}, year = {2022}, doi = {10.30630/joiv.6.1-2.934}, url = {} }Refbacks
- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
__________________________________________________________________________
JOIV : International Journal on Informatics Visualization
ISSN 2549-9610 (print) | 2549-9904 (online)
Organized by Department of Information Technology - Politeknik Negeri Padang, and Institute of Visual Informatics - UKM and Soft Computing and Data Mining Centre - UTHM
W : http://joiv.org
E : joiv@pnp.ac.id, hidra@pnp.ac.id, rahmat@pnp.ac.id
View JOIV Stats
is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.