A New Approach to the Extraction of ANN Rules and to Their Generalization Capacity Through GP

2004 ◽  
Vol 16 (7) ◽  
pp. 1483-1523 ◽  
Author(s):  
Juan R. Rabuñal ◽  
Julián Dorado ◽  
Alejandro Pazos ◽  
Javier Pereira ◽  
Daniel Rivero
Keyword(s):  
Genetic Programming ◽  
Rule Extraction ◽  
Human Beings ◽  
Activation Functions ◽  
New Approach ◽  
Previous Algorithm ◽  
Internal Distribution

Various techniques for the extraction of ANN rules have been used, but most of them have focused on certain types of networks and their training. There are very few methods that deal with ANN rule extraction as systems that are independent of their architecture, training, and internal distribution of weights, connections, and activation functions. This article proposes a methodology for the extraction of ANN rules, regardless of their architecture, and based on genetic programming. The strategy is based on the previous algorithm and aims at achieving the generalization capacity that is characteristic of ANNs by means of symbolic rules that are understandable to human beings.

scholarly journals Improving Model-Based Genetic Programming for Symbolic Regression of Small Expressions

2020 ◽  
pp. 1-27 ◽  
Author(s):  
M. Virgolin ◽  
T. Alderliesten ◽  
C. Witteveen ◽  
P. A. N. Bosman
Keyword(s):  
Genetic Programming ◽  
Real World ◽  
Symbolic Regression ◽  
New Approach ◽  
Model Based ◽  
Real World Datasets ◽  
Linkage Learning ◽  
Optimal Mixing ◽  
Crucial Parameter

The Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA) is a model-based EA framework that has been shown to perform well in several domains, including Genetic Programming (GP). Differently from traditional EAs where variation acts blindly, GOMEA learns a model of interdependencies within the genotype, that is, the linkage, to estimate what patterns to propagate. In this article, we study the role of Linkage Learning (LL) performed by GOMEA in Symbolic Regression (SR). We show that the non-uniformity in the distribution of the genotype in GP populations negatively biases LL, and propose a method to correct for this. We also propose approaches to improve LL when ephemeral random constants are used. Furthermore, we adapt a scheme of interleaving runs to alleviate the burden of tuning the population size, a crucial parameter for LL, to SR. We run experiments on 10 real-world datasets, enforcing a strict limitation on solution size, to enable interpretability. We find that the new LL method outperforms the standard one, and that GOMEA outperforms both traditional and semantic GP. We also find that the small solutions evolved by GOMEA are competitive with tuned decision trees, making GOMEA a promising new approach to SR.

scholarly journals One-Dimensional Convolutional Neural Networks with Feature Selection for Highly Concise Rule Extraction from Credit Scoring Datasets with Heterogeneous Attributes

Electronics ◽  
2020 ◽  
Vol 9 (8) ◽  
pp. 1318
Author(s):  
Yoichi Hayashi ◽  
Naoki Takano
Keyword(s):  
Neural Networks ◽  
Credit Scoring ◽  
Extraction Methods ◽  
Rule Extraction ◽  
Financial Industry ◽  
New Approach ◽  
New Era ◽  
One Dimensional ◽  
Recursive Rule ◽  
Fully Connected

Convolution neural networks (CNNs) have proven effectiveness, but they are not applicable to all datasets, such as those with heterogeneous attributes, which are often used in the finance and banking industries. Such datasets are difficult to classify, and to date, existing high-accuracy classifiers and rule-extraction methods have not been able to achieve sufficiently high classification accuracies or concise classification rules. This study aims to provide a new approach for achieving transparency and conciseness in credit scoring datasets with heterogeneous attributes by using a one-dimensional (1D) fully-connected layer first CNN combined with the Recursive-Rule Extraction (Re-RX) algorithm with a J48graft decision tree (hereafter 1D FCLF-CNN). Based on a comparison between the proposed 1D FCLF-CNN and existing rule extraction methods, our architecture enabled the extraction of the most concise rules (6.2) and achieved the best accuracy (73.10%), i.e., the highest interpretability–priority rule extraction. These results suggest that the 1D FCLF-CNN with Re-RX with J48graft is very effective for extracting highly concise rules for heterogeneous credit scoring datasets. Although it does not completely overcome the accuracy–interpretability dilemma for deep learning, it does appear to resolve this issue for credit scoring datasets with heterogeneous attributes, and thus, could lead to a new era in the financial industry.

scholarly journals Genetic Programming for Evolving Similarity Functions for Clustering: Representations and Analysis

2020 ◽  
Vol 28 (4) ◽  
pp. 531-561 ◽  
Author(s):  
Andrew Lensen ◽  
Bing Xue ◽  
Mengjie Zhang
Keyword(s):  
Genetic Programming ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Similarity Measures ◽  
Small Subset ◽  
Similarity Functions ◽  
New Approach ◽  
Performance Improvements ◽  
Consistent Performance ◽  
High Dimensional Datasets

Clustering is a difficult and widely studied data mining task, with many varieties of clustering algorithms proposed in the literature. Nearly all algorithms use a similarity measure such as a distance metric (e.g., Euclidean distance) to decide which instances to assign to the same cluster. These similarity measures are generally predefined and cannot be easily tailored to the properties of a particular dataset, which leads to limitations in the quality and the interpretability of the clusters produced. In this article, we propose a new approach to automatically evolving similarity functions for a given clustering algorithm by using genetic programming. We introduce a new genetic programming-based method which automatically selects a small subset of features (feature selection) and then combines them using a variety of functions (feature construction) to produce dynamic and flexible similarity functions that are specifically designed for a given dataset. We demonstrate how the evolved similarity functions can be used to perform clustering using a graph-based representation. The results of a variety of experiments across a range of large, high-dimensional datasets show that the proposed approach can achieve higher and more consistent performance than the benchmark methods. We further extend the proposed approach to automatically produce multiple complementary similarity functions by using a multi-tree approach, which gives further performance improvements. We also analyse the interpretability and structure of the automatically evolved similarity functions to provide insight into how and why they are superior to standard distance metrics.

The life of St Patrick : a new approach

1968 ◽  
Vol 16 (62) ◽  
pp. 119-137 ◽  
Author(s):  
T.Ó Raifeartaigh
Keyword(s):  
Seventh Century ◽  
Human Beings ◽  
The West ◽  
New Approach

The runaway British slave who called himself Patricius tells us in this Confession that on making land after his escape from Ireland the and the ship’s crew had to journey for twenty-eight days before coming across any other human beings. Bury (Life of St Patrick, London, 1905) offered the explanation that they must have found themselves in a part of Gaul which had just been devastated by the Vandals, who burst into the west in the first days of 407. The idea was tempting. The date 407, combined with 431 (the year which is known from Prosper’s contemporary chronicle to have been that in which Pope Celestine sent Palladius as ‘first bishop’ to the Irish Christians), not only gave a fairly firm chronological anchorage to Patrick’s career, but also forged for him an early link with the continent, whence, according to his seventh-century Irish biographers, Muirchú and Tírechán, he ultimately returned to Ireland as successor to Palladius.

Sign in / Sign up

Export Citation Format

Share Document