Asia Mahdi Naser alzubaidi
University of Karbala

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Projection pursuit random forest using discriminant feature analysis model for churners prediction in telecom industry Asia Mahdi Naser alzubaidi; Eman Salih Al-Shamery
International Journal of Electrical and Computer Engineering (IJECE) Vol 10, No 2: April 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1346.036 KB) | DOI: 10.11591/ijece.v10i2.pp1406-1421

Abstract

A major and demanding issue in the telecommunications industry is the prediction of churn customers. Churn describes the customer who is attrite from one Telecom service provider to competitors searching for better services offers. Companies from the Telco sector frequently have customer relationship management offices it is the main objective in how to win back defecting clients because preserve long-term customers can be much more beneficial to a company than gain newly recruited customers. Researchers and practitioners are paying great attention and investing more in developing a robust customer churn prediction model, especially in the telecommunication business by proposed numerous machine learning approaches. Many approaches of Classification are established, but the most effective in recent times is a tree-based method. The main contribution of this research is to predict churners/non-churners in the Telecom sector based on project pursuit Random Forest (PPForest) that uses discriminant feature analysis as a novelty extension of the conventional Random Forest approach for learning oblique Project Pursuit tree (PPtree). The proposed methodology leverages the advantage of two discriminant analysis methods to calculate the project index used in the construction of PPtree. The first method used Support Vector Machines (SVM) as a classifier in the construction of PPForest to differentiate between churners and non-churners customers. The second method is a Linear Discriminant Analysis (LDA) to achieve linear splitting of variables node during oblique PPtree construction to produce individual classifiers that are robust and more diverse than classical Random Forest. It found that the proposed methods enjoy the best performance measurements e.g. Accuracy, hit rate, ROC curve, Gini coefficient, Kolmogorov-Smirnov statistic and lift coefficient, H-measure, AUC. Moreover, PPForest based on direct applied of LDA on the raw data delivers an effective evaluator for the customer churn prediction model.
LPCNN: convolutional neural network for link prediction based on network structured features Asia Mahdi Naser Alzubaidi; Elham Mohammed Thabit A. Alsaadi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 20, No 6: December 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v20i6.22990

Abstract

In a social network (SN), link prediction (LP) is the process of estimating whether a link will exist in the future. In prior LP papers, heuristics score techniques were used. Recent state-of-the-art studies, like Wesfeiler-Lehman neural machine (WLNM) and learning from subgraphs, embeddings, and attributes for link prediction (SEAL), have demonstrated that heuristics scores may increase LP model accuracy by employing deep learning and sub-graphing techniques. WLNM and SEAL, on the other hand, have some limitations and perform poorly in some kinds of SNs. The goal of this research is to present a new framework for enhancing the effectiveness of LP models throughout various types of social networks while overcoming the constraints of earlier techniques. We present the link prediction based convolutional neural network (LPCNN) framework, which uses deep learning techniques to examine common neighbors and predict relations. Adapts the LP task into an image classification issue and classifies the links using a convolutional neural network. On 10 various types of real-work networks, tested the suggested LP model and compared its performance to heuristics and state-of-the-art approaches. Results revealed that our model outperforms the other LP benchmark approaches with an average area under curved (AUC) above 99%.