K-RBBSO Algorithm: A Result-Based Stochastic Search Algorithm in Big Data
Source abstract
Abstract
Clustering is widely used in client-facing businesses to categorize their customer base and deliver personalized services. This study proposes an algorithm to stochastically search for an optimum solution based on the outcomes of a data clustering process. Fundamentally, the aforementioned goal is achieved using a result-based stochastic search algorithm. Hence, shortcomings of existing stochastic search algorithms are identified, and the k-means-initiated rapid biogeography-based silhouette optimization (K-RBBSO) algorithm is proposed to overcome them. The proposed algorithm is validated by creating a data clustering engine and comparing the performance of the K-RBBSO algorithm with those of currently used stochastic search techniques, such as simulated annealing and artificial bee colony, on a validation dataset. The results indicate that K-RBBSO is more effective with larger volumes of data compared to the other algorithms. Finally, we describe some prospective beneficial uses of a data clustering algorithm in unsupervised learning based on the findings of this study.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Advanced Clustering Algorithms Research · Customer churn and segmentation · Data Mining Algorithms and Applications
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Graduate School of Business, Kyung Hee University, Seoul 02447, Republic of Korea
Funding
National Research Foundation of Korea and funded by the Korean Government · Ministry of Science and ICT, Korea, under the Information Technology Research Center support program
References (22)
Show source-provided references
1. A survey on data Stream clustering and classification10.1007/s10115-014-0808-1 ↗
2. Meta-heuristic algorithm for K-means clustering: Areview
3. HA-CCP: A hybrid algorithm for solving capacitated clustering problem
4. Why simheuristics? Benefits, limitations, and best practices when combining metaheuristics with simulation
5. Metaheuristic research: A comprehensive survey10.1007/s10462-017-9605-z ↗
6. A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects10.1016/j.engappai.2022.104743 ↗
7. A discrete binary version of the particle swarm algorithm
8. Clustering using firefly algorithm: Performance study10.1016/j.swevo.2011.06.003 ↗
9. Biogeography-based optimization: A 10-year review10.1109/TETCI.2017.2739124 ↗
10. Enhanced K-means clustering algorithm for evolving user groups10.17485/ijst/2015/v8i24/80192 ↗
11. A survey of evolutionary algorithms for clustering10.1109/TSMCC.2008.2007252 ↗
12. Silhouettes: A graphical aid to the interpretation and validation of cluster analysis10.1016/0377-0427(87)90125-7 ↗
13. Simulated annealing algorithms: An overview10.1109/101.17235 ↗
14. Artificial bee colony algorithm10.4249/scholarpedia.6915 ↗
15. A fast simulated annealing algorithm for the examination timetabling problem10.1016/j.eswa.2018.12.048 ↗
16. A survey of clustering algorithms for an industrial context10.1016/j.procs.2019.01.022 ↗
17. Algorithm AS 136: A K-means clustering algorithm
18. Experimental comparisons of clustering approaches for data representation10.1145/3490384 ↗
19. Data clustering using enhanced biogeography-based optimization
20. Biogeography-based optimization10.1109/TEVC.2008.919004 ↗
21. Baek, J. (2020). Data Clustering Using Efficient Simulated Annealing (ESA) by Applying a Silhouette Valid Index and a Stochastic Distance Ratio. [Master’s Thesis, Kangwon National University].
22. Jie, Z., Chen, S., Lai, J., Arif, M., and He, Z. (2022). Personalized federated recommendation system with historical parameter clustering. J. Ambient Intell. Hum. Comput., 1–17.10.1007/s12652-022-03709-z ↗