scholarly journals Recursive Learning of Genetic Algorithm Featuring Incremental Attribute Learning for Higher Dimensional Classification Problems

2012 ◽  
pp. 802-806 ◽  
Author(s):  
Haofan Zhang ◽  
Sheng-Uei Guan ◽  
Mengjun Xu
Keyword(s):  
Genetic Algorithm ◽  
Classification Problems ◽  
Dimensional Classification ◽  
Higher Dimensional ◽  
Recursive Learning ◽  
Attribute Learning

Incremental Hyperplane Partitioning for Classification

2013 ◽  
Vol 4 (2) ◽  
pp. 67-79 ◽  
Author(s):  
Tao Yang ◽  
Sheng-Uei Guan ◽  
Jinghao Song ◽  
Binge Zheng ◽  
Mengying Cao ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Linear Equations ◽  
Curse Of Dimensionality ◽  
Experimental Results ◽  
New Method ◽  
Complex Pattern ◽  
Classification Problems ◽  
Encoding Scheme ◽  
Incremental Approach ◽  
Higher Dimensional

The authors propose an incremental hyperplane partitioning approach to classification. Hyperplanes that are close to the classification boundaries of a given problem are searched using an incremental approach based upon Genetic Algorithm (GA). A new method - Incremental Linear Encoding based Genetic Algorithm (ILEGA) is proposed to tackle the difficulty of classification problems caused by the complex pattern relationship and curse of dimensionality. The authors solve classification problems through a simple and flexible chromosome encoding scheme, where the partitioning rules are encoded by linear equations rather than If-Then rules. Moreover, an incremental approach combined with output portioning and pattern reduction is applied to cope with the curse of dimensionality. The algorithm is tested with six datasets. The experimental results show that ILEGA outperform in both lower- and higher-dimensional problems compared with the original GA.

Statistical Discriminability Estimation for Pattern Classification Based on Neural Incremental Attribute Learning

2014 ◽  
Vol 5 (2) ◽  
pp. 37-57
Author(s):  
Ting Wang ◽  
Sheng-Uei Guan ◽  
Sadasivan Puthusserypady ◽  
Prudence W. H. Wong
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Learning Approach ◽  
Classification Problems ◽  
Dynamical Feature ◽  
Discrimination Ability ◽  
Machine Learning Approach ◽  
Attribute Learning ◽  
Predictive Metric ◽  
Significant Data

Feature ordering is a significant data preprocessing method in Incremental Attribute Learning (IAL), a novel machine learning approach which gradually trains features according to a given order. Previous research has shown that, similar to feature selection, feature ordering is also important based on each feature's discrimination ability, and should be sorted in a descending order of their discrimination ability. However, such an ordering is crucial for the performance of IAL. As the number of feature dimensions in IAL is increasing, feature discrimination ability also should be calculated in the corresponding incremental way. Based on Single Discriminability (SD), where only the feature discrimination ability is computed, a new filter statistical feature discrimination ability predictive metric, called the Accumulative Discriminability (AD), is designed for the dynamical feature discrimination ability estimation. Moreover, a criterion that summarizes all the produced values of AD is employed with a GA (Genetic Algorithm)-based approach to obtain the optimum feature ordering for classification problems based on neural networks by means of IAL. Compared with the feature ordering obtained by other approaches, the method proposed in this paper exhibits better performance in the final classification results. Such a phenomenon indicates that, (i) the feature discrimination ability should be incrementally estimated in IAL, and (ii) the feature ordering derived by AD and its corresponding approaches are applicable with IAL.

Incremental Hyper-Sphere Partitioning for Classification

2014 ◽  
Vol 5 (2) ◽  
pp. 72-88
Author(s):  
Jinghao Song ◽  
Sheng-Uei Guan ◽  
Binge Zheng
Keyword(s):  
Genetic Algorithm ◽  
Classification Problem ◽  
Curse Of Dimensionality ◽  
Experimental Results ◽  
Complex Pattern ◽  
Unique Combination ◽  
Classification Problems ◽  
Encoding Scheme ◽  
Incremental Approach ◽  
Hyper Plane

In this paper, an Incremental Hyper-Sphere Partitioning (IHSP) approach to classification on the basis of Incremental Linear Encoding Genetic Algorithm (ILEGA) is proposed. Hyper-spheres approximating boundaries to a given classification problem, are searched with an incremental approach based on a unique combination of genetic algorithm (GA), output partitioning and pattern reduction. ILEGA is used to cope with the difficulty of classification problems caused by the complex pattern relationship and curse of dimensionality. Classification problems are solved by a simple and flexible chromosome encoding scheme which is different from that was proposed in Incremental Hyper-plane Partitioning (IHPP) for classification. The algorithm is tested with 7 datasets. The experimental results show that IHSP performs better compared with those classified using hyper-planes and normal GA.

scholarly journals HYBRID NSGA-II OPTIMIZATION FOR IMPROVING THE THREE-TERM BP NETWORK FOR MULTICLASS CLASSIFICATION PROBLEMS

2015 ◽  
Author(s):  
Ashraf Osman Ibrahim ◽  
Siti Mariyam Shamsuddin ◽  
Sultan Noman Qasem
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithm ◽  
Hybrid Algorithm ◽  
Search Algorithm ◽  
Classification Performance ◽  
Classification Problems ◽  
Nsga Ii ◽  
Bp Network ◽  
Multiobjective Evolutionary Algorithm

Recently, hybrid algorithms have received considerable attention from a number of researchers. This paper presents a hybrid of the multiobjective evolutionary algorithm to gain a better accuracy of the fi nal solutions. The aim of using the hybrid algorithm is to improve the multiobjective evolutionary algorithm performance in terms of the enhancement of all the individuals in the population and increase the quality of the Pareto optimal solutions. The multiobjective evolutionary algorithm used in this study is a nondominated sorting genetic algorithm-II (NSGA-II) together with its hybrid, the backpropagation algorithm (BP), which is used as a local search algorithm to optimize the accuracy and complexity of the three-term backpropagation (TBP) network. The outcome positively demonstrates that the hybrid algorithm is able to improve the classification performance with a smaller number of hidden nodes and is effective in multiclass classifi cation problems. Furthermore, the results indicate that the proposed hybrid method is a potentially useful classifi er for enhancing the classification process ability when compared with the multiobjective genetic algorithm based on the TBP network (MOGATBP) and certain other methods found in the literature.  

scholarly journals Genetic programming for feature construction and selection in classification on high-dimensional data

2021 ◽  
Author(s):  
Binh Tran ◽  
Bing Xue ◽  
Mengjie Zhang
Keyword(s):  
Feature Selection ◽  
Genetic Programming ◽  
High Dimensional Data ◽  
Classification Performance ◽  
High Dimensional ◽  
Feature Construction ◽  
Classification Problems ◽  
Memetic Computing ◽  
Dimensional Classification ◽  
High Level

Classification on high-dimensional data with thousands to tens of thousands of dimensions is a challenging task due to the high dimensionality and the quality of the feature set. The problem can be addressed by using feature selection to choose only informative features or feature construction to create new high-level features. Genetic programming (GP) using a tree-based representation can be used for both feature construction and implicit feature selection. This work presents a comprehensive study to investigate the use of GP for feature construction and selection on high-dimensional classification problems. Different combinations of the constructed and/or selected features are tested and compared on seven high-dimensional gene expression problems, and different classification algorithms are used to evaluate their performance. The results show that the constructed and/or selected feature sets can significantly reduce the dimensionality and maintain or even increase the classification accuracy in most cases. The cases with overfitting occurred are analysed via the distribution of features. Further analysis is also performed to show why the constructed feature can achieve promising classification performance. This is a post-peer-review, pre-copyedit version of an article published in 'Memetic Computing'. The final authenticated version is available online at: https://doi.org/10.1007/s12293-015-0173-y. The following terms of use apply: https://www.springer.com/gp/open-access/publication-policies/aam-terms-of-use.

scholarly journals Genetic programming for feature construction and selection in classification on high-dimensional data

2021 ◽  
Author(s):  
Binh Tran ◽  
Bing Xue ◽  
Mengjie Zhang
Keyword(s):  
Feature Selection ◽  
Genetic Programming ◽  
High Dimensional Data ◽  
Classification Performance ◽  
High Dimensional ◽  
Feature Construction ◽  
Classification Problems ◽  
Memetic Computing ◽  
Dimensional Classification ◽  
High Level

Classification on high-dimensional data with thousands to tens of thousands of dimensions is a challenging task due to the high dimensionality and the quality of the feature set. The problem can be addressed by using feature selection to choose only informative features or feature construction to create new high-level features. Genetic programming (GP) using a tree-based representation can be used for both feature construction and implicit feature selection. This work presents a comprehensive study to investigate the use of GP for feature construction and selection on high-dimensional classification problems. Different combinations of the constructed and/or selected features are tested and compared on seven high-dimensional gene expression problems, and different classification algorithms are used to evaluate their performance. The results show that the constructed and/or selected feature sets can significantly reduce the dimensionality and maintain or even increase the classification accuracy in most cases. The cases with overfitting occurred are analysed via the distribution of features. Further analysis is also performed to show why the constructed feature can achieve promising classification performance. This is a post-peer-review, pre-copyedit version of an article published in 'Memetic Computing'. The final authenticated version is available online at: https://doi.org/10.1007/s12293-015-0173-y. The following terms of use apply: https://www.springer.com/gp/open-access/publication-policies/aam-terms-of-use.

Combination classification method for customer relationship management

2019 ◽  
Vol 32 (5) ◽  
pp. 1004-1022
Author(s):  
Zhe Zhang ◽  
Yue Dai
Keyword(s):  
Genetic Algorithm ◽  
Decision Trees ◽  
Customer Relationship Management ◽  
Predictive Accuracy ◽  
Behavior Pattern ◽  
Relationship Management ◽  
Customer Relationship ◽  
Combination Method ◽  
Classification Problems ◽  
Content Type

Purpose For classification problems of customer relationship management (CRM), the purpose of this paper is to propose a method with interpretability of the classification results that combines multiple decision trees based on a genetic algorithm. Design/methodology/approach In the proposed method, multiple decision trees are combined in parallel. Subsequently, a genetic algorithm is used to optimize the weight matrix in the combination algorithm. Findings The method is applied to customer credit rating assessment and customer response behavior pattern recognition. The results demonstrate that compared to a single decision tree, the proposed combination method improves the predictive accuracy and optimizes the classification rules, while maintaining interpretability of the classification results. Originality/value The findings of this study contribute to research methodologies in CRM. It specifically focuses on a new method with interpretability by combining multiple decision trees based on genetic algorithms for customer classification.

Sign in / Sign up

Export Citation Format

Share Document