Advertisement
Published in:
2018 | OriginalPaper | Chapter
Genetic Programming Based on Granular Computing for Classification with High-Dimensional Data
Authors : Wenbin Pei, Bing Xue, Lin Shang, Mengjie Zhang
Published in: AI 2018: Advances in Artificial Intelligence
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Classification tasks become more challenging when having the curse of dimensionality issue. Recently, there has been an increasing number of datasets with thousands of features. Some classification algorithms often need feature selection to avoid the curse of dimensionality. Genetic programming (GP) has shown success in classification tasks. GP does not require to do feature selection because of its built-in capability to automatically select informative features. However, GP-based methods are often computationally intensive to achieve a good classification accuracy. Based on perspectives from granular computing (GrC), this paper proposes a new approach to linking features hierarchically for GP-based classification. Experiments on seven high-dimensional datasets show the effectiveness of the proposed algorithm in terms of saving training time and enhancing the classification accuracy, compared to baseline methods.