{"title":"基于高斯的客户流失预测并行编程Naïve贝叶斯","authors":"D. T. Barus, R. Elfarizy, F. Masri, P. H. Gunawan","doi":"10.1109/ICoICT49345.2020.9166319","DOIUrl":null,"url":null,"abstract":"This paper presents churn predictions with the Gaussian Naïve Bayes method. Churn prediction is a forecasting method to predict customer decisions in a company’s service or product (churn). With high public enthusiasm and an increasing number of customers in the Big Data era, a fast computing process is needed to predict churn as quickly as possible. In this paper, computing is accelerated by the OpenMP platform parallel algorithm. Churn prediction experiments are performed with different amounts of test data, ranging from 100, 300, 500, 700, to 900 data. The results obtained show that implementing OpenMP in predicting churn is faster than serial processing. The obtained speedup and efficiency reached more than 1.49 and 37%, even for test data of 300 and 500, based on the tests, the speedup and efficiency reached 1.99 and 50%.","PeriodicalId":113108,"journal":{"name":"2020 8th International Conference on Information and Communication Technology (ICoICT)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Parallel Programming of Churn Prediction Using Gaussian Naïve Bayes\",\"authors\":\"D. T. Barus, R. Elfarizy, F. Masri, P. H. Gunawan\",\"doi\":\"10.1109/ICoICT49345.2020.9166319\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents churn predictions with the Gaussian Naïve Bayes method. Churn prediction is a forecasting method to predict customer decisions in a company’s service or product (churn). With high public enthusiasm and an increasing number of customers in the Big Data era, a fast computing process is needed to predict churn as quickly as possible. In this paper, computing is accelerated by the OpenMP platform parallel algorithm. Churn prediction experiments are performed with different amounts of test data, ranging from 100, 300, 500, 700, to 900 data. The results obtained show that implementing OpenMP in predicting churn is faster than serial processing. The obtained speedup and efficiency reached more than 1.49 and 37%, even for test data of 300 and 500, based on the tests, the speedup and efficiency reached 1.99 and 50%.\",\"PeriodicalId\":113108,\"journal\":{\"name\":\"2020 8th International Conference on Information and Communication Technology (ICoICT)\",\"volume\":\"77 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 8th International Conference on Information and Communication Technology (ICoICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICoICT49345.2020.9166319\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 8th International Conference on Information and Communication Technology (ICoICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICoICT49345.2020.9166319","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel Programming of Churn Prediction Using Gaussian Naïve Bayes
This paper presents churn predictions with the Gaussian Naïve Bayes method. Churn prediction is a forecasting method to predict customer decisions in a company’s service or product (churn). With high public enthusiasm and an increasing number of customers in the Big Data era, a fast computing process is needed to predict churn as quickly as possible. In this paper, computing is accelerated by the OpenMP platform parallel algorithm. Churn prediction experiments are performed with different amounts of test data, ranging from 100, 300, 500, 700, to 900 data. The results obtained show that implementing OpenMP in predicting churn is faster than serial processing. The obtained speedup and efficiency reached more than 1.49 and 37%, even for test data of 300 and 500, based on the tests, the speedup and efficiency reached 1.99 and 50%.