|
|
- Asher Morris
- 5 years ago
- Views:
Transcription
1 Wrapper Feature Selection using Discrete Cuckoo Optimization Algorithm Abstract S.J. Mousavirad and H. Ebrahimpour-Komleh* 1 Department of Computer and Electrical Engineering, University of Kashan, Kashan, Iran *Corresponding Author s ebrahimpour@gmail.com Feature subset selection plays an important role in data mining. The aim of feature selection is to remove redundant and irrelevant features without reducing the accuracy. Cuckoo optimization algorithm (COA) is a new population based algorithm which is inspired by the lifestyle of a species of bird called cuckoo. In this paper, we introduce a new approach based on COA for feature subset selection. To verify the efficiency of our algorithm, experiments carried out on some datasets. The results demonstrate that proposed algorithm can provide an optimal solution for feature subset selection problem. Keywords: Feature Selection, Cuckoo Optimization Algorithm, Population based Algorithms, Data Mining 1. Introduction Feature subset selection or feature selection is one of the main steps in data mining process. Feature subset selection is process of selection a subset of relevant features without reducing the accuracy. Finding the relevant features with N number of features for a given problem needs evaluating 2 N possible subsets. This method is exhaustive. It also may be very demanding and time consuming. There are other ways based on heuristic or random search that effort to reduce computational complexity. Algorithms for feature selection are divided into three broad categories: wrapper methods that use learning algorithms for evaluating features[1], filter methods that evaluate features according to the statistical information of the features, and embedded methods perform feature selection in the process of training. Wrapper based approaches utilize the learning algorithms as a fitness function and search best subset of features in the space of all feature subsets. Moreover, the selected features could be compared with the previous selected candidates and replace them if 709
2 found to be better[1]. Among too many methods, which are proposed for wrapper feature selection, population based optimization algorithms such as genetic algorithm[2-4], particle swarm optimization[5, 6], ant colony[7, 8] and imperialist competition algorithm[9] have attracted a lot of attention. These methods attempt to find a better solution using an iterative process. Cuckoo optimization algorithm (COA) is a novel population based algorithm which is inspired by the lifestyle of a species of bird called cuckoo[10]. This algorithm is based on anomalous egg laying and breeding of cuckoo. The current paper is the first attempt to apply cuckoo optimization algorithm for feature selection. The rest of this paper is organized as follows. First, a brief description of COA has been described. Then the proposed algorithm for feature selection using COA has been demonstrated. In the next section, the experiment and results are presented. Finally, several conclusions have been included. 2. Brief Description of Cuckoo Optimization Algorithm COA is a novel population based algorithm which is inspired by the life of a bird species called cuckoo. This algorithm is based on anomalous egg laying and breeding of cuckoos. In the presented algorithm, cuckoos are divided two forms: mature cuckoos and eggs[10]. Similar other population based algorithms, COA starts with an initial population of cuckoos. This initial population which is mature cuckoos lay some eggs in some host birds nest. Some of these eggs which are more similar to the eggs of host birds have the opportunities to grow up and become a mature cuckoo. Cuckoos with less similarity are detected by host birds and are destroyed. The more eggs survive in an area, the more profit is gathered in that area. Cuckoo search is searching for the best area to lay eggs. After intact eggs grow and become mature cuckoos, they make some societies. Cuckoos in other societies immigrate toward the most appropriate society. They will inhabit somewhere near the best habitat in the most appropriate society. According to the number of eggs each cuckoo and their distance to best habitat, some egg laying radii will be devoted to it. Cuckoos start to lay eggs in some random nests inside her egg laying radius. This process continue iteratively until he best position with maximum profit value is obtained and most of cuckoo population is collected around the same position[10]. Figure 1 Shows flowchart of COA. Start Initialize Cuckoos with eggs Lay eggs in different nests 710 Determine egg laying radius for each cuckoo Move all cuckoos
3 Figure 1: Flowchart of Cuckoo Optimization Algorithm 711
4 3. The proposed approach In this section, the proposed algorithm for feature selection is presented. The steps of the proposed approach are considered in details in the following subsections Generating initial cuckoo habitat In genetic algorithm and particle swarm optimization, each solution is called chromosome and particle position, respectively. But in COA, it is called habitat. In a N dimensional problem, a habitat is a 1 N array, representing current living position of cuckoo[10]. This array is: habitat ( x1, x2,..., x N ) In the proposed approach for Feature selection, each habitat is a string of binary numbers. When value of variable is 1, then the feature is selected and when it is 0, the corresponding feature is not selected. Figure 2 shows of the feature representation as a habitat in the proposed approach. The profit of a habitat is defined as the classifier accuracy. Many classifiers can be used to calculate the profit. For example, K-nearest neighbor (KNN), Neural networks (NN) and Support vector machines (SVM) are three popular classifier. SVM and NN are powerful classifiers but it takes too long to build a classifier. Moreover, NN is sensitive to weight initialization. Since KNN was chosen to compute profit value which is simpler and quicker in compared to other classifiers. F 1 F 2 F 3 F n-1 F n-2 Habitat Feature Subset: {F 2,,F n-1 } Figure 2: Example of feature representation in the proposed approach 712
5 Algorithm starts with N pop initial habitat randomly in the population size. A habitat of real cuckoos is that they lay eggs within a maximum distance from their habitat[10]. It maximum range has been called Egg Laying Radius (ELR). It is defined as: Number of Current Cuckoo's eggs ELR= (varhi var low) Total Number of Eggs Where is an integer, var hi and var low is an upper bound and lower bound, respectively. According to the above equation, ELR is proportional to the total number of eggs, number of current cuckoo s eggs and also variable limits Cuckoo s egg laying Each cuckoo starts laying eggs randomly in some other host bird s nest in the range of her ELR. Figure 3 gives a clear view of this concept. Figure 3: Random egg laying in ELR, central red star is the initial habitat of the cuckoo with 5 eggs; pink stars are the eggs new nest[10]. After egg laying process, eggs with less profit value, will be detected and destroyed. Other eggs grow in host nests, hatch and are fed by host birds. Interestingly, only on egg in the each nest has the chance to grow because cuckoos chick eats most of the food host bird brings to the nest[10]. 713
6 3.3. Immigration of cuckoos When cuckoos grow and become mature they live in the own society. But in the time of the egg laying, they immigrate to new and better society with more similarity of eggs to host birds. After the cuckoos are formed in different area, the society with best profit value is selected as the goal point for other cuckoos to immigrate[10]. It is difficult to distinguish which cuckoo belongs to which groups. To solve this problem, clustering is done. After cuckoo grouping, maximum of mean profit of each group determine the goal group. As previously mentioned, cuckoos improved their habitat for egg laying by moving all the cuckoos toward the goal point. The original version of COA operates on continuous problems. Since the feature selection is a discrete problem, in the current research a new immigration method, which is suitable for the discrete problems, is presented. This operator is as below in Figure 4. For each habitat do Calculate city block distance(d) between habitat and goal point Create a binary string(s) of length N with initial value of zero Assign 1 to some array cells proportional to D. Copy the cells from the goal point correspond to location of the 1 s in the S to the same position in the habitat. End Figure 4: Proposed method for immigration cuckoos toward goal point in a discrete problem 3.4. Eliminating cuckoos in worst habitats Due to the population equilibrium in birds, a new parameter is defined that limits the maximum number of live cuckoos in the society. For modeling of this limitation, survives that have better profit values, and other cuckoos death. N max number of cuckoos 714
7 3.5. Convergence After some iteration, all the cuckoo population move toward best habitat with maximum similarity of eggs to the host birds. 4. Results and Discussions In order to test of proposed algorithm, K nearest neighbor classifier [11] is used. This classifier classifies instance based on their similarity to instances in the training data. In order to evaluate the proposed method discussed in the previous section, datasets from the UCI repository[12], was chosen as follows: Iris: in this dataset each class refers to a type of iris plant. Wine: it includes data from a chemical analysis of wine grown in the same region in Italy but derived from three different cultivars[12]. Pima: it includes Pima Indians diabetes analysis that belongs to classes of healthy and diabetics. Glass identification Breast cancer: Features in this dataset are computed from a digitized image of a fine needle aspirate (FNA) of a breast mass. They describe characteristics of the cell nuclei present in the image[12]. Table.1 shows characteristics of the used datasets. Some of datasets used contain missing value. For replacing missing data with substituted values, an approach based on nearest neighbor algorithm was used[13]. In this approach, missing value replaces with the corresponding feature value from the nearest neighbor instance. Nearest neighbor instance is the closet instance in Euclidean distance. To test the efficiency of the proposed method, a K-fold cross validation procedure was used. In this procedure, the dataset is randomly divided in K disjoint parts of approximately equal size. Classifier is trained with K-1 parts and then is tested with a single part. This process is repeated K times (K folds) with each of the K parts used exactly once as the test data. The average of K results from the folds can be calculated to produce a single estimator. An example of the process of the cuckoo feature selection searching for optimal solution is given in Figure 5-7, where it can be seen that the average classification error decreases, indicating the convergence of the proposed algorithm. In 715
8 Figure 5, the average of the classification error for all habitats at each iteration t is shown. Figure 6 presents minimum classification error of all habitats at each iteration t. Figure 7 exhibits the evolution of the search for the best number of features. The classification accuracy was calculated for each dataset before and after feature selection. Table 2 shows the result feature selection using the above mentioned datasets. The results for the algorithm represented the average of 10 fold in K fold cross validation procedure. Results of the proposed approach are compared with three feature selection approach: Forward feature selection (FFS)[14], Backward feature selection (BFS)[14], genetic based feature selection(ga-fs), and particle swarm based feature selection(pso-fs). According to the results, Classification with feature selection, improve classification performance. In addition, the proposed approach showed improvement in the majority of datasets compared to other methods. Table 1: Description of the used datasets Dataset used Number of features Number of class Number of instance Missing value Wine No Iris No Glass identification No Pima Yes Breast cancer Yes 716
9 A B C D E Figure 5: Average classification error for each iteration in A. Iris, B.Wine, C.Pima, D.Glass identification, and E. Breast cancer datasets 717
10 A B C D E Figure 6. Minimum classification error for each iteration in A. Iris, B.Wine, C.Pima, D.Glass identification, and E. Breast cancer datasets 718
11 Figure 7. Best number of features for each iteration in A. Iris, B. Wine, C. Pima, D. Glass identification, and E. Breast cancer datasets 719
12 Dataset Name No. of the original features Table 2: Classification results using the proposed approach KNN Without FS* Accuracy KNN with FFS KNN with BFS KNN with GA-FS KNN with PSO-FS KNN with COA-FS Wine Iris Glass identification Pima Breast cancer * Feature selection Conclusion In this paper, a new approach based on Cuckoo Optimization Algorithm (COA) for feature subset selection is presented. In the proposed approach, features are encoded to binary strings. The COA based method is evaluated on five known classification problem. The experimental results showed that the proposed approach have high performance in searching for a reduced set of features. In the future, COA can be combined with other intelligent classifiers such as support vector machines. References 1. Emmert-Streib, F. and M. Dehmer, Information theory and statistical learning. 2008: Springer-Verlag New York Incorporated. 2. Yang, J. and V. Honavar, Feature subset selection using a genetic algorithm, in Feature extraction, construction and selection. 1998, Springer. p Leardi, R., Application of a genetic algorithm to feature selection under full validation conditions and to outlier detection. Journal of Chemometrics, (1): p Uğuz, H., A two-stage feature selection method for text categorization by using information gain, principal component analysis and genetic algorithm. Knowledge-Based Systems, (7): p
13 5. Wang, X., et al., Feature selection based on rough sets and particle swarm optimization. Pattern Recognition Letters, (4): p Unler, A. and A. Murat, A discrete particle swarm optimization method for feature selection in binary classification problems. European Journal of Operational Research, (3): p Aghdam, M.H., N. Ghasem-Aghaee, and M.E. Basiri, Text feature selection using ant colony optimization. Expert Systems with Applications, (3): p Ahmed, A.-A., Feature subset selection using ant colony optimization MousaviRad, S., F.A. Tab, and K. Mollazade, Application of Imperialist Competitive Algorithm for Feature Selection: A Case Study on Bulk Rice Classification. International Journal of Computer Applications, (16). 10. Rajabioun, R., Cuckoo optimization algorithm. Applied Soft Computing, (8): p Bishop, C.M., Pattern recognition and machine learning. Vol : springer New York. 12. Asuncion, A. and D.J. Newman, UCI machine learning repository Hastie, T., et al., Imputing missing data for gene expression arrays. 1999, Stanford University Statistics Department Technical report. 14. Kittler, J., Feature selection and extraction. Handbook of pattern recognition and image processing, 1986: p
Feature Selection using Modified Imperialist Competitive Algorithm
Feature Selection using Modified Imperialist Competitive Algorithm S. J. Mousavirad Department of Computer and Electrical Engineering University of Kashan Kashan, Iran jalalmoosavirad@gmail.com Abstract
More informationA Binary Model on the Basis of Cuckoo Search Algorithm in Order to Solve the Problem of Knapsack 1-0
22 International Conference on System Engineering and Modeling (ICSEM 22) IPCSIT vol. 34 (22) (22) IACSIT Press, Singapore A Binary Model on the Basis of Cuckoo Search Algorithm in Order to Solve the Problem
More informationImproving Results and Performance of Collaborative Filtering-based Recommender Systems using Cuckoo Optimization Algorithm
Improving Results and Performance of Collaborative Filtering-based Recommender Systems using Cuckoo Optimization Algorithm Majid Hatami Faculty of Electrical and Computer Engineering University of Tabriz,
More information[Kaur, 5(8): August 2018] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES EVOLUTIONARY METAHEURISTIC ALGORITHMS FOR FEATURE SELECTION: A SURVEY Sandeep Kaur *1 & Vinay Chopra 2 *1 Research Scholar, Computer Science and Engineering,
More informationUsing a genetic algorithm for editing k-nearest neighbor classifiers
Using a genetic algorithm for editing k-nearest neighbor classifiers R. Gil-Pita 1 and X. Yao 23 1 Teoría de la Señal y Comunicaciones, Universidad de Alcalá, Madrid (SPAIN) 2 Computer Sciences Department,
More informationNovel Initialisation and Updating Mechanisms in PSO for Feature Selection in Classification
Novel Initialisation and Updating Mechanisms in PSO for Feature Selection in Classification Bing Xue, Mengjie Zhang, and Will N. Browne School of Engineering and Computer Science Victoria University of
More informationTHE NEW HYBRID COAW METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS
THE NEW HYBRID COAW METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS Zeinab Borhanifar and Elham Shadkam * Department of Industrial Engineering, Faculty of Eng.; Khayyam University, Mashhad, Iran ABSTRACT In
More informationMIXED VARIABLE ANT COLONY OPTIMIZATION TECHNIQUE FOR FEATURE SUBSET SELECTION AND MODEL SELECTION
MIXED VARIABLE ANT COLONY OPTIMIZATION TECHNIQUE FOR FEATURE SUBSET SELECTION AND MODEL SELECTION Hiba Basim Alwan 1 and Ku Ruhana Ku-Mahamud 2 1, 2 Universiti Utara Malaysia, Malaysia, hiba81basim@yahoo.com,
More informationChapter 8 The C 4.5*stat algorithm
109 The C 4.5*stat algorithm This chapter explains a new algorithm namely C 4.5*stat for numeric data sets. It is a variant of the C 4.5 algorithm and it uses variance instead of information gain for the
More informationLEARNING WEIGHTS OF FUZZY RULES BY USING GRAVITATIONAL SEARCH ALGORITHM
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 4, April 2013 pp. 1593 1601 LEARNING WEIGHTS OF FUZZY RULES BY USING GRAVITATIONAL
More informationFeature weighting using particle swarm optimization for learning vector quantization classifier
Journal of Physics: Conference Series PAPER OPEN ACCESS Feature weighting using particle swarm optimization for learning vector quantization classifier To cite this article: A Dongoran et al 2018 J. Phys.:
More informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationFEATURE SELECTION USING PARTICLE SWARM OPTIMIZATION IN TEXT CATEGORIZATION
JAISCR, 2015, Vol. 5, No. 4, pp. 231 238 10.1515/jaiscr-2015-0031 FEATURE SELECTION USING PARTICLE SWARM OPTIMIZATION IN TEXT CATEGORIZATION Mehdi Hosseinzadeh Aghdam 1 and Setareh Heidari 2 1 Department
More informationClassifier Inspired Scaling for Training Set Selection
Classifier Inspired Scaling for Training Set Selection Walter Bennette DISTRIBUTION A: Approved for public release: distribution unlimited: 16 May 2016. Case #88ABW-2016-2511 Outline Instance-based classification
More informationData Cleaning and Prototyping Using K-Means to Enhance Classification Accuracy
Data Cleaning and Prototyping Using K-Means to Enhance Classification Accuracy Lutfi Fanani 1 and Nurizal Dwi Priandani 2 1 Department of Computer Science, Brawijaya University, Malang, Indonesia. 2 Department
More informationDouble Sort Algorithm Resulting in Reference Set of the Desired Size
Biocybernetics and Biomedical Engineering 2008, Volume 28, Number 4, pp. 43 50 Double Sort Algorithm Resulting in Reference Set of the Desired Size MARCIN RANISZEWSKI* Technical University of Łódź, Computer
More informationKyrre Glette INF3490 Evolvable Hardware Cartesian Genetic Programming
Kyrre Glette kyrrehg@ifi INF3490 Evolvable Hardware Cartesian Genetic Programming Overview Introduction to Evolvable Hardware (EHW) Cartesian Genetic Programming Applications of EHW 3 Evolvable Hardware
More informationHybrid AFS Algorithm and k-nn Classification for Detection of Diseases
Hybrid AFS Algorithm and k-nn Classification for Detection of Diseases Logapriya S Dr.G.Anupriya II ME(CSE) Department of Computer Science and Engineering Dr. Mahalingam college of Engineering and Technology,
More informationMutual Information with PSO for Feature Selection
Mutual Information with PSO for Feature Selection S. Sivakumar #1, Dr.C.Chandrasekar *2 #* Department of Computer Science, Periyar University Salem-11, Tamilnadu, India 1 ssivakkumarr@yahoo.com 2 ccsekar@gmail.com
More informationAn Enhanced Binary Particle Swarm Optimization (EBPSO) Algorithm Based A V- shaped Transfer Function for Feature Selection in High Dimensional data
Int. J. Advance Soft Compu. Appl, Vol. 9, No. 3, Nov 2017 ISSN 2074-8523 An Enhanced Binary Particle Swarm Optimization (EBPSO) Algorithm Based A V- shaped Transfer Function for Feature Selection in High
More informationCLUSTERING CATEGORICAL DATA USING k-modes BASED ON CUCKOO SEARCH OPTIMIZATION ALGORITHM
ISSN: 2229-6956 (ONLINE) ICTACT JOURNAL ON SOFT COMPUTING, OCTOBER 2017, VOLUME: 08, ISSUE: 01 DOI: 10.21917/ijsc.2017.0218 CLUSTERING CATEGORICAL DATA USING k-modes BASED ON CUCKOO SEARCH OPTIMIZATION
More informationUse of the Improved Frog-Leaping Algorithm in Data Clustering
Journal of Computer & Robotics 9 (2), 2016 19-26 19 Use of the Improved Frog-Leaping Algorithm in Data Clustering Sahifeh Poor Ramezani Kalashami *, Seyyed Javad Seyyed Mahdavi Chabok Faculty of Engineering,
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More informationParticle Swarm Optimization Artificial Bee Colony Chain (PSOABCC): A Hybrid Meteahuristic Algorithm
Particle Swarm Optimization Artificial Bee Colony Chain (PSOABCC): A Hybrid Meteahuristic Algorithm Oğuz Altun Department of Computer Engineering Yildiz Technical University Istanbul, Turkey oaltun@yildiz.edu.tr
More informationNearest Cluster Classifier
Nearest Cluster Classifier Hamid Parvin, Moslem Mohamadi, Sajad Parvin, Zahra Rezaei, Behrouz Minaei Nourabad Mamasani Branch Islamic Azad University Nourabad Mamasani, Iran hamidparvin@mamasaniiau.ac.ir,
More informationCloNI: clustering of JN -interval discretization
CloNI: clustering of JN -interval discretization C. Ratanamahatana Department of Computer Science, University of California, Riverside, USA Abstract It is known that the naive Bayesian classifier typically
More informationInternational Journal of Current Research and Modern Education (IJCRME) ISSN (Online): & Impact Factor: Special Issue, NCFTCCPS -
TO SOLVE ECONOMIC DISPATCH PROBLEM USING SFLA P. Sowmya* & Dr. S. P. Umayal** * PG Scholar, Department Electrical and Electronics Engineering, Muthayammal Engineering College, Rasipuram, Tamilnadu ** Dean
More informationAN EFFICIENT COST FUNCTION FOR IMPERIALIST COMPETITIVE ALGORITHM TO FIND BEST CLUSTERS
AN EFFICIENT COST FUNCTION FOR IMPERIALIST COMPETITIVE ALGORITHM TO FIND BEST CLUSTERS 1 MOJGAN GHANAVATI, 2 MOHAMAD REZA GHOLAMIAN, 3 BEHROUZ MINAEI, 4 MEHRAN DAVOUDI 2 Professor, Iran University of Science
More informationResearch on Applications of Data Mining in Electronic Commerce. Xiuping YANG 1, a
International Conference on Education Technology, Management and Humanities Science (ETMHS 2015) Research on Applications of Data Mining in Electronic Commerce Xiuping YANG 1, a 1 Computer Science Department,
More informationSOMSN: An Effective Self Organizing Map for Clustering of Social Networks
SOMSN: An Effective Self Organizing Map for Clustering of Social Networks Fatemeh Ghaemmaghami Research Scholar, CSE and IT Dept. Shiraz University, Shiraz, Iran Reza Manouchehri Sarhadi Research Scholar,
More informationThe movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat
An Improved Firefly Algorithm for Optimization Problems Amarita Ritthipakdee 1, Arit Thammano, Nol Premasathian 3, and Bunyarit Uyyanonvara 4 Abstract Optimization problem is one of the most difficult
More informationThe k-means Algorithm and Genetic Algorithm
The k-means Algorithm and Genetic Algorithm k-means algorithm Genetic algorithm Rough set approach Fuzzy set approaches Chapter 8 2 The K-Means Algorithm The K-Means algorithm is a simple yet effective
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More informationAssociative Cellular Learning Automata and its Applications
Associative Cellular Learning Automata and its Applications Meysam Ahangaran and Nasrin Taghizadeh and Hamid Beigy Department of Computer Engineering, Sharif University of Technology, Tehran, Iran ahangaran@iust.ac.ir,
More informationIntroduction to Artificial Intelligence
Introduction to Artificial Intelligence COMP307 Machine Learning 2: 3-K Techniques Yi Mei yi.mei@ecs.vuw.ac.nz 1 Outline K-Nearest Neighbour method Classification (Supervised learning) Basic NN (1-NN)
More informationGlobal Metric Learning by Gradient Descent
Global Metric Learning by Gradient Descent Jens Hocke and Thomas Martinetz University of Lübeck - Institute for Neuro- and Bioinformatics Ratzeburger Allee 160, 23538 Lübeck, Germany hocke@inb.uni-luebeck.de
More informationHamming Distance based Binary PSO for Feature Selection and Classification from high dimensional Gene Expression Data
Hamming Distance based Binary PSO for Feature Selection and Classification from high dimensional Gene Expression Data Haider Banka and Suresh Dara Department of Computer Science and Engineering Indian
More informationWEIGHTED K NEAREST NEIGHBOR CLASSIFICATION ON FEATURE PROJECTIONS 1
WEIGHTED K NEAREST NEIGHBOR CLASSIFICATION ON FEATURE PROJECTIONS 1 H. Altay Güvenir and Aynur Akkuş Department of Computer Engineering and Information Science Bilkent University, 06533, Ankara, Turkey
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationImproving Tree-Based Classification Rules Using a Particle Swarm Optimization
Improving Tree-Based Classification Rules Using a Particle Swarm Optimization Chi-Hyuck Jun *, Yun-Ju Cho, and Hyeseon Lee Department of Industrial and Management Engineering Pohang University of Science
More informationAccelerating Unique Strategy for Centroid Priming in K-Means Clustering
IJIRST International Journal for Innovative Research in Science & Technology Volume 3 Issue 07 December 2016 ISSN (online): 2349-6010 Accelerating Unique Strategy for Centroid Priming in K-Means Clustering
More informationA Hybrid Feature Selection Algorithm Based on Information Gain and Sequential Forward Floating Search
A Hybrid Feature Selection Algorithm Based on Information Gain and Sequential Forward Floating Search Jianli Ding, Liyang Fu School of Computer Science and Technology Civil Aviation University of China
More informationUnivariate Margin Tree
Univariate Margin Tree Olcay Taner Yıldız Department of Computer Engineering, Işık University, TR-34980, Şile, Istanbul, Turkey, olcaytaner@isikun.edu.tr Abstract. In many pattern recognition applications,
More informationResearch Article Application of Global Optimization Methods for Feature Selection and Machine Learning
Mathematical Problems in Engineering Volume 2013, Article ID 241517, 8 pages http://dx.doi.org/10.1155/2013/241517 Research Article Application of Global Optimization Methods for Feature Selection and
More informationPreprocessing of Stream Data using Attribute Selection based on Survival of the Fittest
Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest Bhakti V. Gavali 1, Prof. Vivekanand Reddy 2 1 Department of Computer Science and Engineering, Visvesvaraya Technological
More informationAn Effective Performance of Feature Selection with Classification of Data Mining Using SVM Algorithm
Proceedings of the National Conference on Recent Trends in Mathematical Computing NCRTMC 13 427 An Effective Performance of Feature Selection with Classification of Data Mining Using SVM Algorithm A.Veeraswamy
More informationCHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES
CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving
More informationA Parallel Evolutionary Algorithm for Discovery of Decision Rules
A Parallel Evolutionary Algorithm for Discovery of Decision Rules Wojciech Kwedlo Faculty of Computer Science Technical University of Bia lystok Wiejska 45a, 15-351 Bia lystok, Poland wkwedlo@ii.pb.bialystok.pl
More information[Sabeena*, 5(4): April, 2016] ISSN: (I2OR), Publication Impact Factor: 3.785
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY FEATURE SELECTION AND CLASSIFICATION TECHNIQUES IN DATA MINING S.Sabeena*, G.Priyadharshini Department of Computer Science, Avinashilingam
More informationWeighting and selection of features.
Intelligent Information Systems VIII Proceedings of the Workshop held in Ustroń, Poland, June 14-18, 1999 Weighting and selection of features. Włodzisław Duch and Karol Grudziński Department of Computer
More informationPSOk-NN: A Particle Swarm Optimization Approach to Optimize k-nearest Neighbor Classifier
PSOk-NN: A Particle Swarm Optimization Approach to Optimize k-nearest Neighbor Classifier Alaa Tharwat 1,2,5, Aboul Ella Hassanien 3,4,5 1 Dept. of Electricity- Faculty of Engineering- Suez Canal University,
More informationParticle Swarm Optimization applied to Pattern Recognition
Particle Swarm Optimization applied to Pattern Recognition by Abel Mengistu Advisor: Dr. Raheel Ahmad CS Senior Research 2011 Manchester College May, 2011-1 - Table of Contents Introduction... - 3 - Objectives...
More informationA Fuzzy C-means Clustering Algorithm Based on Pseudo-nearest-neighbor Intervals for Incomplete Data
Journal of Computational Information Systems 11: 6 (2015) 2139 2146 Available at http://www.jofcis.com A Fuzzy C-means Clustering Algorithm Based on Pseudo-nearest-neighbor Intervals for Incomplete Data
More informationFEATURE EXTRACTION TECHNIQUES USING SUPPORT VECTOR MACHINES IN DISEASE PREDICTION
FEATURE EXTRACTION TECHNIQUES USING SUPPORT VECTOR MACHINES IN DISEASE PREDICTION Sandeep Kaur 1, Dr. Sheetal Kalra 2 1,2 Computer Science Department, Guru Nanak Dev University RC, Jalandhar(India) ABSTRACT
More informationA Lazy Approach for Machine Learning Algorithms
A Lazy Approach for Machine Learning Algorithms Inés M. Galván, José M. Valls, Nicolas Lecomte and Pedro Isasi Abstract Most machine learning algorithms are eager methods in the sense that a model is generated
More informationAn Analysis of Applicability of Genetic Algorithms for Selecting Attributes and Examples for the Nearest Neighbour Classifier
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 7, No 2 Sofia 2007 An Analysis of Applicability of Genetic Algorithms for Selecting Attributes and Examples for the Nearest
More informationA *69>H>N6 #DJGC6A DG C<>C::G>C<,8>:C8:H /DA 'D 2:6G, ()-"&"3 -"(' ( +-" " " % '.+ % ' -0(+$,
The structure is a very important aspect in neural network design, it is not only impossible to determine an optimal structure for a given problem, it is even impossible to prove that a given structure
More informationIN recent years, neural networks have attracted considerable attention
Multilayer Perceptron: Architecture Optimization and Training Hassan Ramchoun, Mohammed Amine Janati Idrissi, Youssef Ghanou, Mohamed Ettaouil Modeling and Scientific Computing Laboratory, Faculty of Science
More informationMachine Learning nearest neighbors classification. Luigi Cerulo Department of Science and Technology University of Sannio
Machine Learning nearest neighbors classification Luigi Cerulo Department of Science and Technology University of Sannio Nearest Neighbors Classification The idea is based on the hypothesis that things
More informationThe Design of Pole Placement With Integral Controllers for Gryphon Robot Using Three Evolutionary Algorithms
The Design of Pole Placement With Integral Controllers for Gryphon Robot Using Three Evolutionary Algorithms Somayyeh Nalan-Ahmadabad and Sehraneh Ghaemi Abstract In this paper, pole placement with integral
More informationTime Complexity Analysis of the Genetic Algorithm Clustering Method
Time Complexity Analysis of the Genetic Algorithm Clustering Method Z. M. NOPIAH, M. I. KHAIRIR, S. ABDULLAH, M. N. BAHARIN, and A. ARIFIN Department of Mechanical and Materials Engineering Universiti
More informationReview of feature selection techniques in bioinformatics by Yvan Saeys, Iñaki Inza and Pedro Larrañaga.
Americo Pereira, Jan Otto Review of feature selection techniques in bioinformatics by Yvan Saeys, Iñaki Inza and Pedro Larrañaga. ABSTRACT In this paper we want to explain what feature selection is and
More informationMass Classification Method in Mammogram Using Fuzzy K-Nearest Neighbour Equality
Mass Classification Method in Mammogram Using Fuzzy K-Nearest Neighbour Equality Abstract: Mass classification of objects is an important area of research and application in a variety of fields. In this
More informationFeature Selection in Knowledge Discovery
Feature Selection in Knowledge Discovery Susana Vieira Technical University of Lisbon, Instituto Superior Técnico Department of Mechanical Engineering, Center of Intelligent Systems, IDMEC-LAETA Av. Rovisco
More informationSupervised classification exercice
Universitat Politècnica de Catalunya Master in Artificial Intelligence Computational Intelligence Supervised classification exercice Authors: Miquel Perelló Nieto Marc Albert Garcia Gonzalo Date: December
More informationk-nn Disgnosing Breast Cancer
k-nn Disgnosing Breast Cancer Prof. Eric A. Suess February 4, 2019 Example Breast cancer screening allows the disease to be diagnosed and treated prior to it causing noticeable symptoms. The process of
More informationCHAPTER 4 FEATURE SELECTION USING GENETIC ALGORITHM
CHAPTER 4 FEATURE SELECTION USING GENETIC ALGORITHM In this research work, Genetic Algorithm method is used for feature selection. The following section explains how Genetic Algorithm is used for feature
More informationCse634 DATA MINING TEST REVIEW. Professor Anita Wasilewska Computer Science Department Stony Brook University
Cse634 DATA MINING TEST REVIEW Professor Anita Wasilewska Computer Science Department Stony Brook University Preprocessing stage Preprocessing: includes all the operations that have to be performed before
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationMonika Maharishi Dayanand University Rohtak
Performance enhancement for Text Data Mining using k means clustering based genetic optimization (KMGO) Monika Maharishi Dayanand University Rohtak ABSTRACT For discovering hidden patterns and structures
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationEvolving SQL Queries for Data Mining
Evolving SQL Queries for Data Mining Majid Salim and Xin Yao School of Computer Science, The University of Birmingham Edgbaston, Birmingham B15 2TT, UK {msc30mms,x.yao}@cs.bham.ac.uk Abstract. This paper
More informationMaximum Relevancy Minimum Redundancy Based Feature Subset Selection using Ant Colony Optimization
2017, TextRoad Publication ISSN: 2090-4274 Journal of Applied Environmental and Biological Sciences www.textroad.com Maximum Relevancy Minimum Redundancy Based Feature Subset Selection using Ant Colony
More informationFuzzy Ant Clustering by Centroid Positioning
Fuzzy Ant Clustering by Centroid Positioning Parag M. Kanade and Lawrence O. Hall Computer Science & Engineering Dept University of South Florida, Tampa FL 33620 @csee.usf.edu Abstract We
More informationAn Empirical Study of Hoeffding Racing for Model Selection in k-nearest Neighbor Classification
An Empirical Study of Hoeffding Racing for Model Selection in k-nearest Neighbor Classification Flora Yu-Hui Yeh and Marcus Gallagher School of Information Technology and Electrical Engineering University
More informationA Maximal Margin Classification Algorithm Based on Data Field
Send Orders for Reprints to reprints@benthamscience.ae 1088 The Open Cybernetics & Systemics Journal, 2015, 9, 1088-1093 Open Access A Maximal Margin Classification Algorithm Based on Data Field Zhao 1,*,
More informationNOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION
NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION * Prof. Dr. Ban Ahmed Mitras ** Ammar Saad Abdul-Jabbar * Dept. of Operation Research & Intelligent Techniques ** Dept. of Mathematics. College
More informationNearest Cluster Classifier
Nearest Cluster Classifier Hamid Parvin, Moslem Mohamadi, Sajad Parvin, Zahra Rezaei, and Behrouz Minaei Nourabad Mamasani Branch, Islamic Azad University, Nourabad Mamasani, Iran hamidparvin@mamasaniiau.ac.ir,
More informationFUZZY KERNEL K-MEDOIDS ALGORITHM FOR MULTICLASS MULTIDIMENSIONAL DATA CLASSIFICATION
FUZZY KERNEL K-MEDOIDS ALGORITHM FOR MULTICLASS MULTIDIMENSIONAL DATA CLASSIFICATION 1 ZUHERMAN RUSTAM, 2 AINI SURI TALITA 1 Senior Lecturer, Department of Mathematics, Faculty of Mathematics and Natural
More informationInformation Fusion Dr. B. K. Panigrahi
Information Fusion By Dr. B. K. Panigrahi Asst. Professor Department of Electrical Engineering IIT Delhi, New Delhi-110016 01/12/2007 1 Introduction Classification OUTLINE K-fold cross Validation Feature
More informationRECORD-TO-RECORD TRAVEL ALGORITHM FOR ATTRIBUTE REDUCTION IN ROUGH SET THEORY
RECORD-TO-RECORD TRAVEL ALGORITHM FOR ATTRIBUTE REDUCTION IN ROUGH SET THEORY MAJDI MAFARJA 1,2, SALWANI ABDULLAH 1 1 Data Mining and Optimization Research Group (DMO), Center for Artificial Intelligence
More informationBENCHMARKING ATTRIBUTE SELECTION TECHNIQUES FOR MICROARRAY DATA
BENCHMARKING ATTRIBUTE SELECTION TECHNIQUES FOR MICROARRAY DATA S. DeepaLakshmi 1 and T. Velmurugan 2 1 Bharathiar University, Coimbatore, India 2 Department of Computer Science, D. G. Vaishnav College,
More informationSolving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques
Solving the Traveling Salesman Problem using Reinforced Ant Colony Optimization techniques N.N.Poddar 1, D. Kaur 2 1 Electrical Engineering and Computer Science, University of Toledo, Toledo, OH, USA 2
More informationA PSO-based Generic Classifier Design and Weka Implementation Study
International Forum on Mechanical, Control and Automation (IFMCA 16) A PSO-based Generic Classifier Design and Weka Implementation Study Hui HU1, a Xiaodong MAO1, b Qin XI1, c 1 School of Economics and
More informationA Fast Wrapper Feature Subset Selection Method Based On Binary Particle Swarm Optimization
2013 IEEE Congress on Evolutionary Computation June 20-23, Cancún, México A Fast Wrapper Feature Subset Selection Method Based On Binary Particle Swarm Optimization Xing Liu State Key Laboratory of Novel
More informationA Survey of Parallel Social Spider Optimization Algorithm based on Swarm Intelligence for High Dimensional Datasets
International Journal of Computational Intelligence Research ISSN 0973-1873 Volume 13, Number 9 (2017), pp. 2259-2265 Research India Publications http://www.ripublication.com A Survey of Parallel Social
More informationFuzzy Ants as a Clustering Concept
Fuzzy Ants as a Clustering Concept Parag M. Kanade and Lawrence O. Hall Dept. of Computer Science & Engineering, ENB118 University of South Florida, Tampa FL 33620 pkanade@csee.usf.edu, hall@csee.usf.edu
More informationCell-to-switch assignment in. cellular networks. barebones particle swarm optimization
Cell-to-switch assignment in cellular networks using barebones particle swarm optimization Sotirios K. Goudos a), Konstantinos B. Baltzis, Christos Bachtsevanidis, and John N. Sahalos RadioCommunications
More informationA genetic algorithm based focused Web crawler for automatic webpage classification
A genetic algorithm based focused Web crawler for automatic webpage classification Nancy Goyal, Rajesh Bhatia, Manish Kumar Computer Science and Engineering, PEC University of Technology, Chandigarh, India
More informationMUSSELS WANDERING OPTIMIZATION ALGORITHM BASED TRAINING OF ARTIFICIAL NEURAL NETWORKS FOR PATTERN CLASSIFICATION
MUSSELS WANDERING OPTIMIZATION ALGORITHM BASED TRAINING OF ARTIFICIAL NEURAL NETWORKS FOR PATTERN CLASSIFICATION Ahmed A. Abusnaina 1 and Rosni Abdullah 2 1 School of Computer Sciences, Universiti Sains
More informationKeywords Clustering, K-Mean, Firefly algorithm, Genetic Algorithm (GA), Particle Swarm Optimization (PSO).
Volume 4, Issue 12, December 214 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Hybrid Technique
More informationUsing Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem
Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve
More informationClassification of Hand-Written Numeric Digits
Classification of Hand-Written Numeric Digits Nyssa Aragon, William Lane, Fan Zhang December 12, 2013 1 Objective The specific hand-written recognition application that this project is emphasizing is reading
More informationDifferentiation of Malignant and Benign Breast Lesions Using Machine Learning Algorithms
Journal of Multidisciplinary Engineering Science and Technology (JMEST) Differentiation of Malignant and Benign Breast Lesions Using Machine Learning Algorithms Chetan Nashte, Jagannath Nalavade, Abhilash
More informationIncremental Continuous Ant Colony Optimization Technique for Support Vector Machine Model Selection Problem
Incremental Continuous Ant Colony Optimization Technique for Support Vector Machine Model Selection Problem HIBA BASIM ALWAN, KU RUHANA KU-MAHAMUD School of Computing, College of Art and Sciences University
More informationSalman Ahmed.G* et al. /International Journal of Pharmacy & Technology
ISSN: 0975-766X CODEN: IJPTFI Available Online through Research Article www.ijptonline.com A FRAMEWORK FOR CLASSIFICATION OF MEDICAL DATA USING BIJECTIVE SOFT SET Salman Ahmed.G* Research Scholar M. Tech
More informationA New Meta-heuristic Bat Inspired Classification Approach for Microarray Data
Available online at www.sciencedirect.com Procedia Technology 4 (2012 ) 802 806 C3IT-2012 A New Meta-heuristic Bat Inspired Classification Approach for Microarray Data Sashikala Mishra a, Kailash Shaw
More informationAn Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm
An Efficient Analysis for High Dimensional Dataset Using K-Means Hybridization with Ant Colony Optimization Algorithm Prabha S. 1, Arun Prabha K. 2 1 Research Scholar, Department of Computer Science, Vellalar
More informationClass dependent feature weighting and K-nearest neighbor classification
Class dependent feature weighting and K-nearest neighbor classification Elena Marchiori Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands elenam@cs.ru.nl Abstract.
More informationA Web Page Recommendation system using GA based biclustering of web usage data
A Web Page Recommendation system using GA based biclustering of web usage data Raval Pratiksha M. 1, Mehul Barot 2 1 Computer Engineering, LDRP-ITR,Gandhinagar,cepratiksha.2011@gmail.com 2 Computer Engineering,
More information