Implementation of Clustering Using Representative (CURE) Method for Segmenting Telephone Call Behavior as a Basis for Policy Making by Telecommunication Providers
##plugins.themes.bootstrap3.article.main##
Abstract
The quality of service provided by telecommunication providers is critical to ensure competitiveness in a competitive market. This quality often depends on the policies taken by the provider, which must be based on factual data to avoid decisions that deviate from field conditions. One resource that can be utilized is customer phone call data, which can be analyzed and grouped to understand call behavior. This study aims to implement the Clustering Using Representative (CURE) method in segmenting phone call behavior. The CURE method was chosen because of its ability to find clusters of various shapes and sizes, even when key attributes have low contributions. The test results show that this method is able to produce clusters with a high average percentage of accuracy. Thus, the CURE method is proven to be effective for segmenting phone call behavior, providing a strong foundation for telecommunication providers to make strategic decisions, such as tariff adjustments, loyalty programs, and customer retention strategies.
##plugins.themes.bootstrap3.article.details##
[2] L. Hafiza and M. R. Hamdala, “Studi Tekno-Ekonomi Implementasi Spectrum Sharing Pada Mobile Network Operator Di Kota Bandung,” J. Informatics Commun. Technol., vol. 4, no. 1, pp. 1–14, 2022, doi: 10.52661/j_ict.v4i1.96.
[3] Y. Li and S. Zhong, “Privacy-Preserving Clustering Using Representatives over Arbitrarily Partitioned Data,” Int. J. Adv. Comput. Sci. Appl., vol. 4, no. 9, pp. 207–212, 2013, doi: 10.14569/ijacsa.2013.040932.
[4] B. Cai, G. Huang, S. Yang, Y. Xiang, and C. H. Chi, “SE-shapelets: Semi-supervised Clustering of Time Series Using Representative Shapelets,” Expert Syst. Appl., vol. 240, no. November 2023, p. 122584, 2024, doi: 10.1016/j.eswa.2023.122584.
[5] V. N. Phu, V. T. N. Tran, and J. Max, “A CURE algorithm for Vietnamese sentiment classification in a parallel environment,” J. Comput. Sci., vol. 15, no. 10, pp. 1355–1377, 2019, doi: 10.3844/jcssp.2019.1355.1377.
[6] X. Wu and H. Zhu, “Association testing for binary trees—A Markov branching process approach,” Stat. Med., vol. 41, no. 14, pp. 2557–2573, 2022, doi: 10.1002/sim.9370.
[7] Y. Shan, S. H. U. Li, F. Li, M. Zhou, and X. Li, “With Sparse Search and K-d Tree,” no. June, pp. 74883–74901, 2022.
[8] G. S. Fuhnwi, J. O. Agbaje, K. Oshinubi, and O. J. Peter, “An Empirical Study on Anomaly Detection Using Density-based and Representative-based Clustering Algorithms,” J. Niger. Soc. Phys. Sci., vol. 5, no. 2, pp. 1–13, 2023, doi: 10.46481/jnsps.2023.1364.

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.