Encrypting and Preserving Sensitive Attributes in Customer Churn Data Using Novel Dragonfly Based Pseudonymizer Approach

被引:2
|
作者
Nagaraj, Kalyan [1 ]
Sharvani, G. S. [1 ]
Sridhar, Amulyashree [1 ]
机构
[1] RV Coll Engn, Dept Comp Sci & Engn, Bangalore 560059, Karnataka, India
关键词
customer data; churn analysis; privacy; ensemble approach; data mining; FEATURE-SELECTION; PRIVACY; PREDICTION; RETENTION;
D O I
10.3390/info10090274
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With miscellaneous information accessible in public depositories, consumer data is the knowledgebase for anticipating client preferences. For instance, subscriber details are inspected in telecommunication sector to ascertain growth, customer engagement and imminent opportunity for advancement of services. Amongst such parameters, churn rate is substantial to scrutinize migrating consumers. However, predicting churn is often accustomed with prevalent risk of invading sensitive information from subscribers. Henceforth, it is worth safeguarding subtle details prior to customer-churn assessment. A dual approach is adopted based on dragonfly and pseudonymizer algorithms to secure lucidity of customer data. This twofold approach ensures sensitive attributes are protected prior to churn analysis. Exactitude of this method is investigated by comparing performances of conventional privacy preserving models against the current model. Furthermore, churn detection is substantiated prior and post data preservation for detecting information loss. It was found that the privacy based feature selection method secured sensitive attributes effectively as compared to traditional approaches. Moreover, information loss estimated prior and post security concealment identified random forest classifier as superlative churn detection model with enhanced accuracy of 94.3% and minimal data forfeiture of 0.32%. Likewise, this approach can be adopted in several domains to shield vulnerable information prior to data modeling.
引用
收藏
页数:21
相关论文
共 50 条
  • [21] A privacy-preserving model based on differential approach for sensitive data in cloud environment
    Singh, Ashutosh Kumar
    Gupta, Rishabh
    MULTIMEDIA TOOLS AND APPLICATIONS, 2022, 81 (23) : 33127 - 33150
  • [22] A Bayesian based approach for analyzing customer's online sales data to identify weights of product attributes
    Cali, Sedef
    Baykasoglu, Adil
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 210
  • [23] A privacy-preserving model based on differential approach for sensitive data in cloud environment
    Ashutosh Kumar Singh
    Rishabh Gupta
    Multimedia Tools and Applications, 2022, 81 : 33127 - 33150
  • [24] Customer churn modeling in telecommunication using a novel multi-objective evolutionary clustering-based ensemble learning
    Googerdchi, Kaveh Faraji
    Asadi, Shahrokh
    Jafari, Seyed Mohammadbagher
    PLOS ONE, 2024, 19 (06):
  • [25] Preserving Privacy for Sensitive Values of Individuals in Data Publishing Based on a New Additive Noise Approach
    Zhu, Hong
    Tian, Shengli
    Xie, Meiyi
    Yang, Mengyuan
    2014 23RD INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND NETWORKS (ICCCN), 2014,
  • [26] A Novel Approach to Quantify Time Series Differences of Gait Data Using Attractor Attributes
    Vieten, Manfred M.
    Sehle, Aida
    Jensen, Randall L.
    PLOS ONE, 2013, 8 (08):
  • [27] An interpretable data-driven approach for customer purchase prediction using cost-sensitive learning
    Xiao, Fei
    Chen, Shui-xia
    Chen, Zi-yu
    Wang, Ya-nan
    Wang, Jian-qiang
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2024, 138
  • [28] Privacy preserving data mining using cryptographic role based access control approach
    Vasudevan, Lalanthika
    Sukanya, S. E. Deepa
    Aarthi, N.
    IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 474 - 479
  • [30] Preserving Spatial Patterns in Point Data: A Generalization Approach Using Agent-Based Modeling
    Knura, Martin
    Schiewe, Jochen
    ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2024, 13 (12)