یک مطالعه در استفاده از روش انتخاب عنوان مثال در سیستم های مبتنی بر قواعد فازی ژنتیک طبقه بندی: دقت-پیچیدگی تجارت کردن
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|26292||2013||10 صفحه PDF||سفارش دهید||7479 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Knowledge-Based Systems, Volume 54, December 2013, Pages 32–41
In the framework of genetic fuzzy systems, the computational time required by genetic algorithms for generating fuzzy rule-based models from data increases considerably with the increase of the number of instances in the training set, mainly due to the fitness evaluation. Also, the amount of data typically affects the complexity of the resulting model: a higher number of instances generally induces the generation of models with a higher number of rules. Since the number of rules is considered one of the factors which affect the interpretability of the fuzzy rule-based models, large datasets generally bring to less interpretable models. Both these problems can be tackled and partially solved by reducing the number of instances before applying the evolutionary process. In the literature several algorithms of instance selection have been proposed for selecting instances without deteriorating the accuracy of the generated models. The aim of this paper is to analyze the effectiveness of 36 training set selection methods when combined with genetic fuzzy rule-based classification systems. Using 37 datasets of different sizes we show that some of these methods can considerably help to reduce the computational time of the evolutionary process and to decrease the complexity of the fuzzy rule-based models with a very limited decrease of their accuracy with respect to the models generated by using the overall training set.
Several real-world problems deal with classification tasks and several approaches have been proposed to manage them. Fuzzy Rule-Based Systems (FRBSs) have proved to be very effective as classifiers, especially when interpretable models are needed . The components of an FRBS can be automatically derived from a set of data, for example by using Genetic Algorithms (GAs)  and . In the last decades, GAs have been so extensively used to learn FRBSs that the term Genetic Fuzzy Systems (GFSs) has been coined to identify the hybridization between GAs and FRBSs ,  and . The learning process of a GFS is strongly affected by the amount of instances used to generate the FRBS. A first problem is related to the computational time required by the fitness evaluation during the evolutionary process, since it is directly proportional to the number of instances. A second problem regards the complexity of the obtained models: in order to cover as much as possible instances of the dataset, the learning process tends to generate a high number of rules. To reduce the amount of instances would speed up the learning process and possibly would lessen the complexity of the generated FRBSs. To this aim several approaches have been proposed in the literature. In particular, when considering medium and large datasets, the reduction can be obtained by applying techniques of Instance Selection (IS) , ,  and , which aim to extract a small representative subset of instances from the initial set, by removing superfluous instances. The subset should maintain all the information of the original set, so that it can be used to generate classification models with the same accuracy as models generated by using the original set. IS techniques can be grouped into two categories, depending on the aim pursued after obtaining the reduced set: • Prototype Selection (PS) methods : the reduced set is used by an instance-based classifier (for example K-NN) to classify new instances. Instance-based classifiers assume that unlabeled instances can be classified by relating them to the labeled instances, according to a certain similarity or distance function. The selected instances should provide the best trade-off between classification accuracy and reduction of the number of instances. • Training Set Selection (TSS) methods  and : the subset of instances is employed by a machine learning algorithm to build a predictive model (e.g. neural networks, FRBSs, decision trees, etc). Several studies can be found in the literature for both PS and TSS. For example in , the authors perform IS by means of an evolutionary process. The quality of the reduced set is assessed by using the 1-NN classifier and a classification model constructed by the C4.5 algorithm. A comparison is carried out among evolutionary and non-evolutionary IS techniques, with respect to the classification accuracy and the instance reduction rate. This study has been subsequently extended in  and , where the concept of data stratification has been integrated in the framework with the aim of handling the scaling problem that appears when evaluating medium-large size datasets, and generating classification models with a good accuracy-interpretability trade-off. A particular application of TSS is presented in . Here, the authors focus on classification problems in presence of imbalanced dataset. Data are re-balanced by undersampling the instances belonging to the majority class thorough a TSS method. TSS is integrated in an evolutionary algorithm and the quality of the reduced set is evaluated by generating a classification model with the well-known C4.5 algorithm. A recent approach can be found in , where the authors investigate the use of TSS to reduce the set of instances required by a Multi-Objective Evolutionary Algorithm (MOEA) to generate FRBSs for regression problems. The TSS is integrated in a co-evolutionary framework: cyclically, a single-objective GA selects a subset of instances which are used by the MOEA for generating the FRBSs. The GA maximizes an index that measures the quality of the reduced set of instances. In this paper, we focus on the use of TSS techniques as pre-processing methods before applying a GA for generating Fuzzy Rule-Based Classification Systems (FRBCSs). We aim to investigate if TSS techniques can help to reduce the complexity of the generated FRBCSs, preserving or hopefully increasing their accuracy. A preliminary study discussed in , where a set of 20 small size datasets have been considered, has highlighted that a specific family of TSS methods is effective in achieving this objective. We extend the study in  by considering also medium-large size datasets, which frequently appear in real-world problems. For these datasets, the number of rules of the generated FRBCSs can be quite large and therefore their interpretability can be quite low, blurred by the complexity. We have considered 36 TSS techniques and 17 additional medium-large size datasets. The TSS techniques have been applied to each dataset and reduced datasets have been obtained. Then, the reduced datasets have been used to generate FRBCSs by exploiting a recently developed GFS, named Fuzzy Association Rule-based Classification model for High-Dimensional problems (FARC-HD) , which has been demonstrated to be efficient when working with high-dimensional datasets, i.e. datasets with a high number of variables. Since medium-large size datasets usually involve also a high number variables, FARC-HD results to be particularly suitable for these datasets. The goal is to understand if TSS techniques are able to decrease the number of instances in a dataset without losing the information needed for allowing FARC-HD to generate FRBCSs that achieve high classification rate despite a low complexity and a low computational time. A further study has been performed by considering the combination of small and medium-large size datasets. The aim is to obtain more reliable results when applying statistical tests and to investigate if there exist TSS techniques that can be effectively used with datasets of any size. Finally, an analysis of the computational time required by the application of TSS techniques and by the execution of the GFS on the reduced datasets is reported, in order to evaluate if the selected subsets lead to a reduction in the time required by the GFS to generate classification models. This contribution is organized as follows: Section 2 contains a brief description of the IS process and IS methods in general. The methods used in this study are listed, according to the taxonomy proposed in . Section 3 describes the methodology used to carry out the experiments. Section 4 includes a brief overview of FARC-HD. In Section 5 the experimental framework is presented and the obtained results are examined and discussed.
نتیجه گیری انگلیسی
In this paper we have presented an analysis of the influence of instance selection methods, used for training set selection, combined with a genetic fuzzy system for classification. The analysis was carried out by considering 36 methods and 37 datasets of different sizes in order to investigate if these methods are useful to decrease the time of the evolutionary process and the complexity of the obtained models, although maintaining or improving their accuracy. The analysis highlights that different IS techniques should be used depending on the dimension of the considered dataset. According to , we recommend to use techniques belonging to the edition decremental family, and in particular RNG when small size datasets are involved. When dealing with medium-large size datasets, the IGA and PBIL techniques, belonging to the hybrid mixed family, have resulted to be the most suitable for generating models with a good trade-off between accuracy and complexity. Nevertheless, the execution of the PBIL technique is on average faster than the execution of the IGA technique, although the overall computational times required to perform both the TSS and the FARC-HD algorithm are longer than the time needed by the execution of the FARC-HD algorithm on the original training set. Therefore, the objective of using a TSS technique is not to reduce the overall computational time, but rather to improve the trade-off between accuracy and complexity, by reducing the number of rules while preserving most of the accuracy.