Invasive Weed Optimization K-Means Performance Robust Operations (IWOKM PRO) in High-Dimensional Datasets

Authors

  • Ni Luh Gede Pivin Suwirmayanti Faculty of Engineering, Udayana University, Bali, Indonesia | Department of Computer System, Institut Teknologi and Bisnis STIKOM Bali, Indonesia
  • I. Ketut Gede Darma Putra Department of Information Technology, Faculty of Engineering, Udayana University, Bali, Indonesia
  • Made Sudarma Department of Electrical Engineering, Faculty of Engineering, Udayana University, Bali, Indonesia
  • I. Made Sukarsa Department of Information Technology, Faculty of Engineering, Udayana University, Bali, Indonesia
  • Emy Setyaningsih Department of Computer Systems Engineering, Universitas AKPRIND Indonesia, Yogyakarta, Indonesia
  • Ricky Aurelius Nurtanto Diaz Department of Computer Systems, Institut Teknologi and Bisnis STIKOM Bali, Bali, Indonesia
Volume: 15 | Issue: 4 | Pages: 24390-24395 | August 2025 | https://doi.org/10.48084/etasr.11112

Abstract

This study presents a novel clustering approach called Invasive Weed Optimization K-Means Performance Robust Operations (IWOKM PRO) to improve clustering performance on high-dimensional datasets. Unlike previous IWOKM implementations, IWOKM PRO focuses on optimizing parameter efficiency to conserve computational resources and applies centroid selection techniques to accelerate convergence and enhance clustering results. To evaluate its effectiveness, IWOKM PRO was tested on stock data collected from the Indonesia Stock Exchange (IDX), comprising 604 stocks with adjusted closing price features from January 2019 to December 2023. The experimental results demonstrate that IWOKM PRO outperforms the original IWOKM method in both convergence speed and clustering accuracy. Specifically, in the three-cluster scenario, IWOKM PRO achieved the best fitness value in 1.37 s with a Sum of Squared Errors (SSE) of 973.6434. In the five-cluster scenario, IWOKM PRO reached an average convergence time of 6.45 s with an SSE of 443.8437. Compared to IWOKM, these results significantly improve computational efficiency and clustering performance. In general, this study shows that IWOKM PRO is an effective solution to improve the efficiency and accuracy of clustering, particularly for high-dimensional financial datasets.

Keywords:

clustering, k-means, IWO, IWOKM PRO, high-dimensional dataset, hybrid metaheuristic, Ιndonesia stock exchange, stocks

Downloads

Download data is not yet available.

References

A. Hartebrodt, R. Röttger, and D. B. Blumenthal, "Federated singular value decomposition for high-dimensional data," Data Mining and Knowledge Discovery, vol. 38, no. 3, pp. 938–975, May 2024. DOI: https://doi.org/10.1007/s10618-023-00983-z

J. Q. Yang et al., "Bi-Directional Feature Fixation-Based Particle Swarm Optimization for Large-Scale Feature Selection," IEEE Transactions on Big Data, vol. 9, no. 3, pp. 1004–1017, Jun. 2023. DOI: https://doi.org/10.1109/TBDATA.2022.3232761

F. Cheng, J. Cui, Q. Wang, and L. Zhang, "A Variable Granularity Search-Based Multiobjective Feature Selection Algorithm for High-Dimensional Data Classification," IEEE Transactions on Evolutionary Computation, vol. 27, no. 2, pp. 266–280, Apr. 2023. DOI: https://doi.org/10.1109/TEVC.2022.3160458

X. F. Song, Y. Zhang, D. W. Gong, and X. Z. Gao, "A Fast Hybrid Feature Selection Based on Correlation-Guided Clustering and Particle Swarm Optimization for High-Dimensional Data," IEEE Transactions on Cybernetics, vol. 52, no. 9, pp. 9573–9586, Sep. 2022. DOI: https://doi.org/10.1109/TCYB.2021.3061152

P. Sood, C. Sharma, S. Nijjer, and S. Sakhuja, "Review the role of artificial intelligence in detecting and preventing financial fraud using natural language processing," International Journal of System Assurance Engineering and Management, vol. 14, no. 6, pp. 2120–2135, Dec. 2023. DOI: https://doi.org/10.1007/s13198-023-02043-7

M. Tao, E. Silva, M. S. Sheng, L. Wen, and L. Qi, "How financial clustering influences China’s green development: Mechanism investigation and empirical discussion," Journal of Environmental Management, vol. 347, Dec. 2023, Art. no. 119081. DOI: https://doi.org/10.1016/j.jenvman.2023.119081

V. Sinap, "Comparative analysis of machine learning techniques for credit card fraud detection: Dealing with imbalanced datasets," Turkish Journal of Engineering, vol. 8, no. 2, pp. 196–208, Apr. 2024. DOI: https://doi.org/10.31127/tuje.1386127

R. Hurriyati, A. A., S. Sulastri, L. Lisnawati, and T. Sawangsang, "Stock Market Trend Analysis and Machine Learning-based Predictive Evaluation," Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, vol. 14, no. 3, pp. 267–281, Sep. 2023. DOI: https://doi.org/10.58346/JOWUA.2023.I3.020

M. Ashrafzadeh, H. M. Taheri, M. Gharehgozlou, and S. Hashemkhani Zolfani, "Clustering-based return prediction model for stock pre-selection in portfolio optimization using PSO-CNN+MVF," Journal of King Saud University - Computer and Information Sciences, vol. 35, no. 9, Oct. 2023, Art. no. 101737. DOI: https://doi.org/10.1016/j.jksuci.2023.101737

A. Bhattacharjee, R. Murugan, and T. Goel, "A hybrid approach for lung cancer diagnosis using optimized random forest classification and K-means visualization algorithm," Health and Technology, vol. 12, no. 4, pp. 787–800, Jul. 2022. DOI: https://doi.org/10.1007/s12553-022-00679-2

M. Behera et al., "Automatic Data Clustering by Hybrid Enhanced Firefly and Particle Swarm Optimization Algorithms," Mathematics, vol. 10, no. 19, Sep. 2022, Art. no. 3532. DOI: https://doi.org/10.3390/math10193532

A. M. Ikotun and A. E. Ezugwu, "Boosting k-means clustering with symbiotic organisms search for automatic clustering problems," PLOS ONE, vol. 17, no. 8, Aug. 2022, Art. no. e0272861. DOI: https://doi.org/10.1371/journal.pone.0272861

R. M. Mathew and R. Gunasundari, "A Cluster-based Undersampling Technique for Multiclass Skewed Datasets," Engineering, Technology & Applied Science Research, vol. 13, no. 3, pp. 10785–10790, Jun. 2023. DOI: https://doi.org/10.48084/etasr.5844

Y. Li, X. Zhou, J. Gu, K. Guo, and W. Deng, "A Novel K-Means Clustering Method for Locating Urban Hotspots Based on Hybrid Heuristic Initialization," Applied Sciences, vol. 12, no. 16, Aug. 2022, Art. no. 8047. DOI: https://doi.org/10.3390/app12168047

Q. Pu, J. Gan, L. Qiu, J. Duan, and H. Wang, "An efficient hybrid approach based on PSO, ABC and k-means for cluster analysis," Multimedia Tools and Applications, vol. 81, no. 14, pp. 19321–19339, Jun. 2022. DOI: https://doi.org/10.1007/s11042-021-11016-6

A. Kaur and Y. Kumar, "Neighborhood search based improved bat algorithm for data clustering," Applied Intelligence, vol. 52, no. 9, pp. 10541–10575, Jul. 2022. DOI: https://doi.org/10.1007/s10489-021-02934-x

S. Saleem, F. Hussain, and N. K. Baloch, "IWO-IGA—A Hybrid Whale Optimization Algorithm Featuring Improved Genetic Characteristics for Mapping Real-Time Applications onto 2D Network on Chip," Algorithms, vol. 17, no. 3, Mar. 2024, Art. no. 115. DOI: https://doi.org/10.3390/a17030115

A. M. Ikotun and A. E. Ezugwu, "Enhanced Firefly-K-Means Clustering with Adaptive Mutation and Central Limit Theorem for Automatic Clustering of High-Dimensional Datasets," Applied Sciences, vol. 12, no. 23, Nov. 2022, Art. no. 12275. DOI: https://doi.org/10.3390/app122312275

A. Kaur and Y. Kumar, "A new metaheuristic algorithm based on water wave optimization for data clustering," Evolutionary Intelligence, vol. 15, no. 1, pp. 759–783, Mar. 2022. DOI: https://doi.org/10.1007/s12065-020-00562-x

D. Malandrino, R. De Prisco, M. Ianulardo, and R. Zaccagnino, "An adaptive meta-heuristic for music plagiarism detection based on text similarity and clustering," Data Mining and Knowledge Discovery, vol. 36, no. 4, pp. 1301–1334, Jul. 2022. DOI: https://doi.org/10.1007/s10618-022-00835-2

H. Jia, Q. Wen, Y. Wang, and S. Mirjalili, "Catch fish optimization algorithm: a new human behavior algorithm for solving clustering problems," Cluster Computing, vol. 27, no. 9, pp. 13295–13332, Dec. 2024. DOI: https://doi.org/10.1007/s10586-024-04618-w

B. Abdollahzadeh et al., "Puma optimizer (PO): a novel metaheuristic optimization algorithm and its application in machine learning," Cluster Computing, vol. 27, no. 4, pp. 5235–5283, Jul. 2024. DOI: https://doi.org/10.1007/s10586-023-04221-5

N. L. G. P. Suwirmayanti, E. Setyaningsih, R. A. N. Diaz, and K. Budiarta, "Optimization of the K-Means Method for Clustering Banking Data Using the Hybrid Model of Invasive Weed Optimization and K-Means (IWOKM)." ICIC International, 2024.

C. N. Aher and A. K. Jena, "Improved invasive weed bird swarm optimization algorithm (IWBSOA) enabled hybrid deep learning classifier for diabetic prediction," Journal of Ambient Intelligence and Humanized Computing, vol. 14, no. 4, pp. 3929–3945, Apr. 2023. DOI: https://doi.org/10.1007/s12652-022-04462-z

Z. Xu, Z. Yu, X. Ning, X. Wan, Z. Qu, and C. Zhao, "Hybrid of non-dominated sorting genetic algorithm II and invasive weed optimization for fan duct surface heat exchanger configuration optimization design," Case Studies in Thermal Engineering, vol. 61, Sep. 2024, Art. no. 105149. DOI: https://doi.org/10.1016/j.csite.2024.105149

B. Sahoo, D. Das, K. C. Pujhari, and Vikas, "Optimization of route planning for the mobile robot using a hybrid Neuro-IWO technique," International Journal of Information Technology, vol. 17, no. 3, pp. 1431–1439, Apr. 2025. DOI: https://doi.org/10.1007/s41870-024-02231-z

M. Shantal, Z. Othman, and A. A. Bakar, "A Novel Approach for Data Feature Weighting Using Correlation Coefficients and Min–Max Normalization," Symmetry, vol. 15, no. 12, Dec. 2023, Art. no. 2185. DOI: https://doi.org/10.3390/sym15122185

Downloads

How to Cite

[1]
N. L. G. P. Suwirmayanti, I. K. G. D. Putra, M. Sudarma, I. M. Sukarsa, E. Setyaningsih, and R. A. N. Diaz, “Invasive Weed Optimization K-Means Performance Robust Operations (IWOKM PRO) in High-Dimensional Datasets”, Eng. Technol. Appl. Sci. Res., vol. 15, no. 4, pp. 24390–24395, Aug. 2025.

Metrics

Abstract Views: 104
PDF Downloads: 197

Metrics Information