scholarly journals Enhanced imperialist competitive algorithm for 2-satisfiability logic mining in bank marketing data set

2020 ◽  
Author(s):  
Nur Nasuha Mohd Rashid ◽  
Mohd. Asyraf Mansor ◽  
Mohd Shareduwan Mohd Kasihmuddin ◽  
Saratha Sathasivam
2019 ◽  
Vol 8 (3) ◽  
pp. 4373-4378

The amount of data belonging to different domains are being stored rapidly in various repositories across the globe. Extracting useful information from the huge volumes of data is always difficult due to the dynamic nature of data being stored. Data Mining is a knowledge discovery process used to extract the hidden information from the data stored in various repositories, termed as warehouses in the form of patterns. One of the popular tasks of data mining is Classification, which deals with the process of distinguishing every instance of a data set into one of the predefined class labels. Banking system is one of the realworld domains, which collects huge number of client data on a daily basis. In this work, we have collected two variants of the bank marketing data set pertaining to a Portuguese financial institution consisting of 41188 and 45211 instances and performed classification on them using two data reduction techniques. Attribute subset selection has been performed on the first data set and the training data with the selected features are used in classification. Principal Component Analysis has been performed on the second data set and the training data with the extracted features are used in classification. A deep neural network classification algorithm based on Backpropagation has been developed to perform classification on both the data sets. Finally, comparisons are made on the performance of each deep neural network classifier with the four standard classifiers, namely Decision trees, Naïve Bayes, Support vector machines, and k-nearest neighbors. It has been found that the deep neural network classifier outperforms the existing classifiers in terms of accuracy


Author(s):  
Mouhcine El Hassani ◽  
Noureddine Falih ◽  
Belaid Bouikhalene

<p><span>Classification of information is a vague and difficult to explore area of research, hence the emergence of grouping techniques, often referred to Clustering. It is necessary to differentiate between an unsupervised and a supervised classification. Clustering methods are numerous. Data partitioning and hierarchization push to use them in parametric form or not. Also, their use is influenced by algorithms of a probabilistic nature during the partitioning of data. The choice of a method depends on the result of the Clustering that we want to have. This work focuses on classification using the density-based spatial clustering of applications with noise (DBSCAN) and DENsity-based CLUstEring (DENCLUE) algorithm through an application made in csharp. Through the use of three databases which are the IRIS database, breast cancer wisconsin (diagnostic) data set and bank marketing data set, we show experimentally that the choice of the initial data parameters is important to accelerate the processing and can minimize the number of iterations to reduce the execution time of the application.</span></p>


2014 ◽  
Vol 13 (11) ◽  
pp. 5134-5141
Author(s):  
Sorayya Mirzapour Kalaibar ◽  
Seyed Naser Razavi

Spam is a basic problem in electronic communications such as email systems in large scales and large number of weblogs and social networks. Due to the problems created by spams, much research has been carried out in this regard by using classification techniques. Redundant and high dimensional information are considered as a serious problem for these classification algorithms due to their high computation costs and using a memory. Reducing feature space results in representing an understandable model and using various methods. In this paper, the method of feature selection by using imperialist competitive algorithm has been presented. Decision tree and SVM classifications have been taken into account in classification phase. In order to prove the efficiency of this method, the results of evaluating data set of Spam Base have been compared with the algorithms proposed in this regard such as genetic algorithm. The results show that this method improves the efficiency of spam detection.


2018 ◽  
Vol 11 (1) ◽  
pp. 57 ◽  
Author(s):  
Dieu Tien Bui ◽  
Himan Shahabi ◽  
Ataollah Shirzadi ◽  
Kamran Kamran Chapi ◽  
Nhat-Duc Hoang ◽  
...  

The authors wish to make the following corrections to this paper [...]


2013 ◽  
Vol 219 (17) ◽  
pp. 8829-8841 ◽  
Author(s):  
Rasul Enayatifar ◽  
Moslem Yousefi ◽  
Abdul Hanan Abdullah ◽  
Amer Nordin Darus

2012 ◽  
Vol 166-169 ◽  
pp. 493-496
Author(s):  
Roya Kohandel ◽  
Behzad Abdi ◽  
Poi Ngian Shek ◽  
M.Md. Tahir ◽  
Ahmad Beng Hong Kueh

The Imperialist Competitive Algorithm (ICA) is a novel computational method based on the concept of socio-political motivated strategy, which is usually used to solve different types of optimization problems. This paper presents the optimization of cold-formed channel section subjected to axial compression force utilizing the ICA method. The results are then compared to the Genetic Algorithm (GA) and Sequential Quadratic Programming (SQP) algorithm for validation purpose. The results obtained from the ICA method is in good agreement with the GA and SQP method in terms of weight but slightly different in the geometry shape.


Sign in / Sign up

Export Citation Format

Share Document