A Genetic Programming Approach to Hyper-Heuristic Feature Selection

2012 ◽  
pp. 320-330 ◽  
Author(s):  
Rachel Hunt ◽  
Kourosh Neshatian ◽  
Mengjie Zhang
Keyword(s):  
Feature Selection ◽  
Genetic Programming ◽  
Programming Approach

A Genetic Programming approach for feature selection in highly dimensional skewed data

2018 ◽  
Vol 273 ◽  
pp. 554-569 ◽  
Author(s):  
Felipe Viegas ◽  
Leonardo Rocha ◽  
Marcos Gonçalves ◽  
Fernando Mourão ◽  
Giovanni Sá ◽  
...  
Keyword(s):  
Feature Selection ◽  
Genetic Programming ◽  
Programming Approach ◽  
Skewed Data

scholarly journals Generating redundant features with unsupervised multi-tree genetic programming

2020 ◽  
Author(s):  
Andrew Lensen ◽  
Bing Xue ◽  
Mengjie Zhang
Keyword(s):  
Feature Selection ◽  
Genetic Programming ◽  
Programming Approach ◽  
Modern Life ◽  
Benchmark Datasets ◽  
Common Technique ◽  
International Publishing ◽  
Selection Algorithms ◽  
High Dimensional Datasets

© Springer International Publishing AG, part of Springer Nature 2018. Recently, feature selection has become an increasingly important area of research due to the surge in high-dimensional datasets in all areas of modern life. A plethora of feature selection algorithms have been proposed, but it is difficult to truly analyse the quality of a given algorithm. Ideally, an algorithm would be evaluated by measuring how well it removes known bad features. Acquiring datasets with such features is inherently difficult, and so a common technique is to add synthetic bad features to an existing dataset. While adding noisy features is an easy task, it is very difficult to automatically add complex, redundant features. This work proposes one of the first approaches to generating redundant features, using a novel genetic programming approach. Initial experiments show that our proposed method can automatically create difficult, redundant features which have the potential to be used for creating high-quality feature selection benchmark datasets.

scholarly journals Generating redundant features with unsupervised multi-tree genetic programming

2020 ◽  
Author(s):  
Andrew Lensen ◽  
Bing Xue ◽  
Mengjie Zhang
Keyword(s):  
Feature Selection ◽  
Genetic Programming ◽  
Programming Approach ◽  
Modern Life ◽  
Benchmark Datasets ◽  
Common Technique ◽  
International Publishing ◽  
Selection Algorithms ◽  
High Dimensional Datasets

© Springer International Publishing AG, part of Springer Nature 2018. Recently, feature selection has become an increasingly important area of research due to the surge in high-dimensional datasets in all areas of modern life. A plethora of feature selection algorithms have been proposed, but it is difficult to truly analyse the quality of a given algorithm. Ideally, an algorithm would be evaluated by measuring how well it removes known bad features. Acquiring datasets with such features is inherently difficult, and so a common technique is to add synthetic bad features to an existing dataset. While adding noisy features is an easy task, it is very difficult to automatically add complex, redundant features. This work proposes one of the first approaches to generating redundant features, using a novel genetic programming approach. Initial experiments show that our proposed method can automatically create difficult, redundant features which have the potential to be used for creating high-quality feature selection benchmark datasets.

scholarly journals Generating redundant features with unsupervised multi-tree genetic programming

2020 ◽  
Author(s):  
Andrew Lensen ◽  
Bing Xue ◽  
Mengjie Zhang
Keyword(s):  
Feature Selection ◽  
Genetic Programming ◽  
Programming Approach ◽  
Modern Life ◽  
Benchmark Datasets ◽  
Common Technique ◽  
International Publishing ◽  
Selection Algorithms ◽  
High Dimensional Datasets

© Springer International Publishing AG, part of Springer Nature 2018. Recently, feature selection has become an increasingly important area of research due to the surge in high-dimensional datasets in all areas of modern life. A plethora of feature selection algorithms have been proposed, but it is difficult to truly analyse the quality of a given algorithm. Ideally, an algorithm would be evaluated by measuring how well it removes known bad features. Acquiring datasets with such features is inherently difficult, and so a common technique is to add synthetic bad features to an existing dataset. While adding noisy features is an easy task, it is very difficult to automatically add complex, redundant features. This work proposes one of the first approaches to generating redundant features, using a novel genetic programming approach. Initial experiments show that our proposed method can automatically create difficult, redundant features which have the potential to be used for creating high-quality feature selection benchmark datasets.

scholarly journals Generating redundant features with unsupervised multi-tree genetic programming

2020 ◽  
Author(s):  
Andrew Lensen ◽  
Bing Xue ◽  
Mengjie Zhang
Keyword(s):  
Feature Selection ◽  
Genetic Programming ◽  
Programming Approach ◽  
Modern Life ◽  
Benchmark Datasets ◽  
Common Technique ◽  
International Publishing ◽  
Selection Algorithms ◽  
High Dimensional Datasets

© Springer International Publishing AG, part of Springer Nature 2018. Recently, feature selection has become an increasingly important area of research due to the surge in high-dimensional datasets in all areas of modern life. A plethora of feature selection algorithms have been proposed, but it is difficult to truly analyse the quality of a given algorithm. Ideally, an algorithm would be evaluated by measuring how well it removes known bad features. Acquiring datasets with such features is inherently difficult, and so a common technique is to add synthetic bad features to an existing dataset. While adding noisy features is an easy task, it is very difficult to automatically add complex, redundant features. This work proposes one of the first approaches to generating redundant features, using a novel genetic programming approach. Initial experiments show that our proposed method can automatically create difficult, redundant features which have the potential to be used for creating high-quality feature selection benchmark datasets.

Sign in / Sign up

Export Citation Format

Share Document