LOGIC MINING FOR TELECOMMUNICATION CHURN CLASSIFICATION: PERMUTATION WEIGHTED RANDOM 2 SATISFIABILITY REVERSE ANALYSIS APPROACH
Abstract
The telecommunications industry is experiencing rapid transformation, resulting in tense competition and increased customer volatility. Telecom churn, which refers to the discontinuation of services by customers, poses a serious challenge due to its direct impact on revenue and long-term profitability. Addressing this issue requires effective methods for understanding and predicting customer behavior. Hence, a logic mining approach is introduced in this study, namely the Permutation Weighted Random 2 Satisfiability Reverse Analysis Method, to classify customer churn in the telecommunications sector. The proposed method is based on a logical rule known as Weighted Random 2 Satisfiability, which is implemented in the Discrete Hopfield Neural Network. The logical rule facilitates the dynamic allocation of negative literals, contributing to improved logical representation. Furthermore, the Election algorithm is incorporated during the training phase to enhance the accuracy of logical structure interpretation. The proposed method is capable of extracting optimal data patterns and generating induced logic that accurately describes customer churn behaviour. This induced logic not only predicts whether a customer will churn but also provides interpretable insights into the underlying causes. Experimental results demonstrate a strong average accuracy of 85.6%, indicating the effectiveness and scalability of the proposed approach for knowledge discovery. Although the proposed approach achieves strong accuracy, the lower F1-Score and Matthews Correlation Coefficient reveal limitations in churn customer classification, highlighting the need for further improvement in handling class imbalance. This study contributes to the field of data mining by offering a logic-based framework for churn classification and emphasizing its practical relevance in supporting strategic customer retention efforts in a competitive telecommunications sector.
Downloads
References
N. Y. Nhu, T. Van Ly, and D. V. Truong Son, “CHURN PREDICTION IN TELECOMMUNICATION INDUSTRY USING KERNEL SUPPORT VECTOR MACHINES,” PLoS One, vol. 17, no. 5, pp. e0267935, May 2022. doi: https://doi.org/10.1371/journal.pone.0267935
D. Asif, M. S. Arif, and A. Mukheimer, “A DATA-DRIVEN APPROACH WITH EXPLAINABLE ARTIFICIAL INTELLIGENCE FOR CUSTOMER CHURN PREDICTION IN THE TELECOMMUNICATIONS INDUSTRY,” Results in Engineering, vol. 26, pp. 104629, Jun 2025. doi: https://doi.org/10.1016/j.rineng.2025.104629
R. Soltani, M. Ashrafi, M. M. S. Esfahani, and H. Farvaresh, “COMPETITIVE PRICING OF COMPLEMENTARY TELECOMMUNICATION SERVICES WITH SUBSCRIBER CHURN IN A DUOPOLY,” Expert Syst Appl, vol. 237, pp. 121447, 2024. doi: https://doi.org/10.1016/j.eswa.2023.121447
N. E. Zamri, et al., “A MODIFIED REVERSE-BASED ANALYSIS LOGIC MINING MODEL WITH WEIGHTED RANDOM 2 SATISFIABILITY LOGIC IN DISCRETE HOPFIELD NEURAL NETWORK AND MULTI-OBJECTIVE TRAINING OF MODIFIED NICHED GENETIC ALGORITHM,” Expert Syst Appl, vol. 240, pp. 122307, April 2024. doi: https://doi.org/10.1016/j.eswa.2023.122307
J. J. Hopfield and D. W. Tank, “‘NEURAL’ COMPUTATION OF DECISIONS IN OPTIMIZATION PROBLEMS,” Biol Cybern, vol. 52, no. 3, pp. 141-152, July 1985. doi: https://doi.org/10.1007/BF00339943
W. A. T. W. Abdullah, “LOGIC PROGRAMMING ON A NEURAL NETWORK.” Int. J. Intell. Syst., vol. 7, pp. 513-519, August 1992. doi: https://doi.org/10.1002/int.4550070604
S. Sathasivam and W. A. T. Wan Abdullah, “LOGIC MINING IN NEURAL NETWORK: REVERSE ANALYSIS METHOD,” Computing (Vienna/New York), vol. 91, no. 2, pp. 119–133, Feb 2011. doi: https://doi.org/10.1007/s00607-010-0117-9
A. Alway, N. E. Zamri, M. S. M. Kasihmuddin, M. Asyraf Mansor, and S. Sathasivam, “PALM OIL TREND ANALYSIS VIA LOGIC MINING WITH DISCRETE HOPFIELD NEURAL NETWORK,” Pertanika J Sci Technol, vol. 28, no. 3, pp. 967-981, July 2020.
N. A. Rusdi, M. S. M. Kasihmuddin, N. A. Romli, G. Manoharam, and M. A. Mansor, “MULTI-UNIT DISCRETE HOPFIELD NEURAL NETWORK FOR HIGHER ORDER SUPERVISED LEARNING THROUGH LOGIC MINING: OPTIMAL PERFORMANCE DESIGN AND ATTRIBUTE SELECTION,” Journal of King Saud University - Computer and Information Sciences, vol. 35, no. 5, pp. 101554, April 2023. doi: https://doi.org/10.1016/j.jksuci.2023.101554
G. Manoharam et al., “LOG-LINEAR-BASED LOGIC MINING WITH MULTI-DISCRETE HOPFIELD NEURAL NETWORK,” Mathematics, vol. 11, no. 9, pp. 2121, April 2023. doi: https://doi.org/10.3390/math11092121
N. A. Romli, et al., “UNSUPERVISED LOGIC MINING WITH A BINARY CLONAL SELECTION ALGORITHM IN MULTI-UNIT DISCRETE HOPFIELD NEURAL NETWORKS VIA WEIGHTED SYSTEMATIC 2 SATISFIABILITY,” AIMS Mathematics, vol. 9, no. 8, pp. 22321–22365, July 2024. doi: https://doi.org/10.3934/math.20241087.
S. S. M. Sidik, N. E. Zamri, M. S. M. Kasihmuddin, H. A. Wahab, Y. Guo, and M. Asyraf Mansor, “NON-SYSTEMATIC WEIGHTED SATISFIABILITY IN DISCRETE HOPFIELD NEURAL NETWORK USING BINARY ARTIFICIAL BEE COLONY OPTIMIZATION,” Mathematics, vol. 10, no. 7, pp. 1129 April 2022. doi: https://doi.org/10.3390/math10071129
Y. Chang, M. S. Mohd Kasihmuddin, W. N. Aqlili Ruzai, Y. Guo, and J. Chen, “WEIGHTED C-TYPE RANDOM 2 SATISFIABILITY IN DISCRETE HOPFIELD NEURAL NETWORK,” Eng Appl Artif Intell, vol. 160, pp. 111760, Nov 2025. doi: https://doi.org/10.1016/j.engappai.2025.111760
Y. Guo, et al., “LOGIC MINING METHOD VIA HYBRID DISCRETE HOPFIELD NEURAL NETWORK,” Comput Ind Eng, vol. 206, pp. 111200, Aug 2025. doi: https://doi.org/10.1016/j.cie.2025.111200
K. Jha and S. Saha, “INCORPORATION OF MULTIMODAL MULTIOBJECTIVE OPTIMIZATION IN DESIGNING A FILTER BASED FEATURE SELECTION TECHNIQUE,” Appl Soft Comput, vol. 98, pp. 106823, Jan 2021. doi: https://doi.org/10.1016/j.asoc.2020.106823
D. Chicco and G. Jurman, “THE ADVANTAGES OF THE MATTHEWS CORRELATION COEFFICIENT (MCC) OVER F1 SCORE AND ACCURACY IN BINARY CLASSIFICATION EVALUATION,” BMC Genomics, vol. 21, no. 6, pp. 1-13, 2020. doi: https://doi.org/10.1186/s12864-019-6413-7
A. Luque, A. Carrasco, A. Martín, and A. de las Heras, “THE IMPACT OF CLASS IMBALANCE IN CLASSIFICATION PERFORMANCE METRICS BASED ON THE BINARY CONFUSION MATRIX,” Pattern Recognit, vol. 91, pp. 216-231, July 2019. doi: https://doi.org/10.1016/j.patcog.2019.02.023
A. Tharwat, “CLASSIFICATION ASSESSMENT METHODS,” Applied Computing and Informatics, vol. 17, no. 1, pp. 168-192, Jan 2021. doi: https://doi.org/10.1016/j.aci.2018.08.003
H. Ting, K. L. Tan, X. J. Lim, J. H. Cheah, Q. H. Ting, and H. B. Ting, “WHAT DETERMINES CUSTOMERS’ LOYALTY TOWARDS TELECOMMUNICATION SERVICE? MEDIATING ROLES OF SATISFACTION AND TRUST,” International Journal of Services, Economics and Management, vol. 11, no. 3, pp. 234, Jan 2020. doi: https://doi.org/10.1504/IJSEM.2020.111179
A. M. Almana, M. S. Aksoy, and R. Alzahrani, “A SURVEY ON DATA MINING TECHNIQUES IN CUSTOMER CHURN ANALYSIS FOR TELECOM INDUSTRY,” Journal of Engineering Research and Applications, vol. 4, no. 5, pp. 165-171, May 2014.
R. U. Khan, Y. Salamzadeh, Q. Iqbal, and S. Yang, “THE IMPACT OF CUSTOMER RELATIONSHIP MANAGEMENT AND COMPANY REPUTATION ON CUSTOMER LOYALTY: THE MEDIATING ROLE OF CUSTOMER SATISFACTION,” Journal of Relationship Marketing, vol. 21, no. 1, pp. 1-26, 2020. doi: https://doi.org/10.1080/15332667.2020.1840904.
Copyright (c) 2026 Nurul Atiqah Romli, Nurul Ain Najwa Mohamad Jamil, Nur Ezlin Zamri, Mohd Shareduwan Mohd Kasihmuddin

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this Journal agree to the following terms:
- Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
- Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
- Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.




1.gif)


