An efficient system for customer churn prediction through particle swarm optimization based feature selection model with simulated annealing

2017 ◽  
Vol 22 (S5) ◽  
pp. 10757-10768 ◽  
Author(s):  
J. Vijaya ◽  
E. Sivasankar
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Simulated Annealing ◽  
Particle Swarm ◽  
Selection Model ◽  
Churn Prediction ◽  
Swarm Optimization ◽  
Efficient System ◽  
Customer Churn ◽  
Customer Churn Prediction

Hybrid Particle Swarm Optimization-Extreme Learning Machine Algorithm for Customer Churn Prediction

2019 ◽  
Vol 16 (8) ◽  
pp. 3432-3436
Author(s):  
Koh Guan Li ◽  
Booma Poolan Marikannan
Keyword(s):  
Particle Swarm Optimization ◽  
Extreme Learning Machine ◽  
Particle Swarm ◽  
Churn Prediction ◽  
Telecommunication Sector ◽  
Swarm Optimization ◽  
Customer Churn ◽  
Hybrid Particle Swarm Optimization ◽  
Learning Machine ◽  
The Cost

Customer churn which also commonly referred to as customer attrition, occurs when a customer ceases or stops doing business with a particular company or service. Predicting customer churn had become one of the major aim of businesses is various sectors, namely the telecommunication sector as the markets are very saturated. Apart from that, the cost to retain existing customers is much lesser as compared to the cost to acquire or attract new customers through marketing. This paper proposes a new hybrid algorithm which incorporate the algorithms of Particle Swarm Optimization (PSO) as well as Extreme Learning Machine (ELM) to build a telecommunication churn prediction model which can accurately predict churners and non-churners. This model will be named as Particle Swarm Extreme Learning Machine (PSELM) model. PSO algorithm is able to effectively scale the selected features so that ELM algorithm can classify data based on these features more easily and provide accurate classification.

An Improved Intelligent Approach to Enhance the Sentiment Classifier for Knowledge Discovery Using Machine Learning

2020 ◽  
Vol 10 (4) ◽  
pp. 582-593
Author(s):  
Midde Venkateswarlu Naik ◽  
D. Vasumathi ◽  
A.P. Siva Kumar
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Global Warming ◽  
Particle Swarm Optimization ◽  
Sentiment Analysis ◽  
Optimization Technique ◽  
Particle Swarm ◽  
Sentiment Classification ◽  
Support Vector ◽  
Swarm Optimization

Aims: The proposed research work is on an evolutionary enhanced method for sentiment or emotion classification on unstructured review text in the big data field. The sentiment analysis plays a vital role for current generation of people for extracting valid decision points about any aspect such as movie ratings, education institute or politics ratings, etc. The proposed hybrid approach combined the optimal feature selection using Particle Swarm Optimization (PSO) and sentiment classification through Support Vector Machine (SVM). The current approach performance is evaluated with statistical measures, such as precision, recall, sensitivity, specificity, and was compared with the existing approaches. The earlier authors have achieved an accuracy of sentiment classifier in the English text up to 94% as of now. In the proposed scheme, an average accuracy of sentiment classifier on distinguishing datasets outperformed as 99% by tuning various parameters of SVM, such as constant c value and kernel gamma value in association with PSO optimization technique. The proposed method utilized three datasets, such as airline sentiment data, weather, and global warming datasets, that are publically available. The current experiment produced results that are trained and tested based on 10- Fold Cross-Validations (FCV) and confusion matrix for predicting sentiment classifier accuracy. Background: The sentiment analysis plays a vital role for current generation people for extracting valid decisions about any aspect such as movie rating, education institute or even politics ratings, etc. Sentiment Analysis (SA) or opinion mining has become fascinated scientifically as a research domain for the present environment. The key area is sentiment classification on semi-structured or unstructured data in distinguish languages, which has become a major research aspect. User-Generated Content [UGC] from distinguishing sources has been hiked significantly with rapid growth in a web environment. The huge user-generated data over social media provides substantial value for discovering hidden knowledge or correlations, patterns, and trends or sentiment extraction about any specific entity. SA is a computational analysis to determine the actual opinion of an entity which is expressed in terms of text. SA is also called as computation of emotional polarity expressed over social media as natural text in miscellaneous languages. Usually, the automatic superlative sentiment classifier model depends on feature selection and classification algorithms. Methods: The proposed work used Support vector machine as classification technique and particle swarm optimization technique as feature selection purpose. In this methodology, we tune various permutations and combination parameters in order to obtain expected desired results with kernel and without kernel technique for sentiment classification on three datasets, including airline, global warming, weather sentiment datasets, that are freely hosted for research practices. Results: In the proposed scheme, The proposed method has outperformed with 99.2% of average accuracy to classify the sentiment on different datasets, among other machine learning techniques. The attained high accuracy in classifying sentiment or opinion about review text proves superior effectiveness over existing sentiment classifiers. The current experiment produced results that are trained and tested based on 10- Fold Cross-Validations (FCV) and confusion matrix for predicting sentiment classifier accuracy. Conclusion: The objective of the research issue sentiment classifier accuracy has been hiked with the help of Kernel-based Support Vector Machine (SVM) based on parameter optimization. The optimal feature selection to classify sentiment or opinion towards review documents has been determined with the help of a particle swarm optimization approach. The proposed method utilized three datasets to simulate the results, such as airline sentiment data, weather sentiment data, and global warming data that are freely available datasets.

Novel self-adjusted particle swarm optimization algorithm for feature selection

Computing ◽  
2021 ◽  
Author(s):  
Bo Wei ◽  
Xuan Wang ◽  
Xuewen Xia ◽  
Mingfeng Jiang ◽  
Zuohua Ding ◽  
...  
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Swarm Optimization

scholarly journals Chunking and cooperation in particle swarm optimization for feature selection

2021 ◽  
Author(s):  
Malek Sarhani ◽  
Stefan Voß
Keyword(s):  
Feature Selection ◽  
Particle Swarm Optimization ◽  
Cooperative Learning ◽  
Optimization Problems ◽  
Practical Importance ◽  
Particle Swarm ◽  
Large Datasets ◽  
Social Phenomena ◽  
Swarm Optimization ◽  
Complex Optimization

AbstractBio-inspired optimization aims at adapting observed natural behavioral patterns and social phenomena towards efficiently solving complex optimization problems, and is nowadays gaining much attention. However, researchers recently highlighted an inconsistency between the need in the field and the actual trend. Indeed, while nowadays it is important to design innovative contributions, an actual trend in bio-inspired optimization is to re-iterate the existing knowledge in a different form. The aim of this paper is to fill this gap. More precisely, we start first by highlighting new examples for this problem by considering and describing the concepts of chunking and cooperative learning. Second, by considering particle swarm optimization (PSO), we present a novel bridge between these two notions adapted to the problem of feature selection. In the experiments, we investigate the practical importance of our approach while exploring both its strength and limitations. The results indicate that the approach is mainly suitable for large datasets, and that further research is needed to improve the computational efficiency of the approach and to ensure the independence of the sub-problems defined using chunking.

Sign in / Sign up

Export Citation Format

Share Document