A Review of Evolutionary Algorithms for Data Mining <s> Data Preprocessing vs. Interleaving Approach <s> From the Publisher: ::: Classifier systems play a major role in machine learning and knowledge-based systems, and Ross Quinlan's work on ID3 and C4.5 is widely acknowledged to have made some of the most significant contributions to their development. This book is a complete guide to the C4.5 system as implemented in C for the UNIX environment. It contains a comprehensive guide to the system's use , the source code (about 8,800 lines), and implementation notes. The source code and sample datasets are also available on a 3.5-inch floppy diskette for a Sun workstation. ::: ::: C4.5 starts with large sets of cases belonging to known classes. The cases, described by any mixture of nominal and numeric properties, are scrutinized for patterns that allow the classes to be reliably discriminated. These patterns are then expressed as models, in the form of decision trees or sets of if-then rules, that can be used to classify new cases, with emphasis on making the models understandable as well as accurate. The system has been applied successfully to tasks involving tens of thousands of cases described by hundreds of properties. The book starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting. Advantages and disadvantages of the C4.5 approach are discussed and illustrated with several case studies. ::: ::: This book and software should be of interest to developers of classification-based intelligent systems and to students in machine learning and expert systems courses. <s> BIB001 </s> A Review of Evolutionary Algorithms for Data Mining <s> Data Preprocessing vs. Interleaving Approach <s> For a given data set, its set of attributes defines its data space representation. The quality of a data space representation is one of the most important factors influencing the performance of a data mining algorithm. The attributes defining the data space can be inadequate, making it difficult to discover high-quality knowledge. In order to solve this problem, this paper proposes a Genetic Programming algorithm developed for attribute construction. This algorithm constructs new attributes out of the original attributes of the data set, performing an important preprocessing step for the subsequent application of a data mining algorithm. <s> BIB002 </s> A Review of Evolutionary Algorithms for Data Mining <s> Data Preprocessing vs. Interleaving Approach <s> The use of machine learning techniques to automatically analyse data for information is becoming increasingly widespread. In this paper we examine the use of Genetic Programming and a Genetic Algorithm to pre-process data before it is classified using the C4.5 decision tree learning algorithm. The Genetic Programming is used to construct new features from those available in the data, a potentially significant process for data mining since it gives consideration to hidden relationships between features. The Genetic Algorithm is used to determine which such features are the most predictive. Using ten well-known datasets we show that our approach, in comparison to C4.5 alone, provides marked improvement in a number of cases. <s> BIB003 </s> A Review of Evolutionary Algorithms for Data Mining <s> Data Preprocessing vs. Interleaving Approach <s> In this paper we use genetic programming for changing the representation of the input data for machine learners. In particular, the topic of interest here is feature construction in the learning-from-examples paradigm, where new features are built based on the original set of attributes. The paper first introduces the general framework for GP-based feature construction. Then, an extended approach is proposed where the useful components of representation (features) are preserved during an evolutionary run, as opposed to the standard approach where valuable features are often lost during search. Finally, we present and discuss the results of an extensive computational experiment carried out on several reference data sets. The outcomes show that classifiers induced using the representation enriched by the GP-constructed features provide better accuracy of classification on the test set. In particular, the extended approach proposed in the paper proved to be able to outperform the standard approach on some benchmark problems on a statistically significant level. <s> BIB004 </s> A Review of Evolutionary Algorithms for Data Mining <s> Data Preprocessing vs. Interleaving Approach <s> In this paper, we present a general-purpose, systematic algorithm, consisting of a genetic programming module and a k-nearest neighbor classifier, to automatically create multiple artificial features (i.e., features that are computer-crafted and may not have a known physical meaning) directly from EEG signals, in a process that reveals patterns predictive of epileptic seizures. The algorithm was evaluated in three patients, with prediction defined over a horizon that varies between 1 and 5 minutes before unequivocal electrographic onset of seizure. For one patient, a perfect classification was achieved. For the other two patients, high classification accuracy was reached, predicting three seizures out of four for one, and eleven seizures out of fifteen for the other. For the latter, also, only one normal (non-seizure) signal was misclassified. These results compare favorably with other prediction approaches for patients from the same population. <s> BIB005
In the data preprocessing approach, the attribute construction algorithm evaluates a constructed attribute without using the classification algorithm to be applied later. Examples of this approach are the GP algorithms for attribute construction proposed by BIB002  , whose attribute evaluation function (the fitness function) is the information gain ratio -a measure discussed in detail in BIB001 . In addition,  ) did experiments comparing the effectiveness of two different attributeevaluation criteria in GP for attribute construction -viz. information gain ratio and gini index -and obtained results indicating that, overall, there was no significant difference in the results associated with those two criteria. By contrast, in the interleaving approach the attribute construction algorithm evaluates the constructed attributes based on the performance of the classification algorithm with those attributes. Examples of this approach are the GP algorithms for attribute construction proposed by BIB004 BIB003 BIB005 , where the fitness functions are based on the accuracy of the classifier built with the constructed attributes. Single-Attribute-per-Individual vs.