Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specific complexity, based on the length of the class boundary. We design a genetic algorithm as a search technique and find it useful to obtain class labels according to the desired complexity. The results show the suitability...
This paper introduces a multiobjective grammar based genetic programming algorithm to solve a Web Mining problem from multiple instance perspective. This algorithm, called MOG3P-MI, is evaluated and compared with other available algorithms which extend a well-known neighborhood-based algorithm (k-nearest neighbour algorithm) and with a mono objective version of grammar guided genetic programming G3P-MI...
Radial basis function networks (RBFNs) have shown their capability to be used in classification problems, so that many data mining algorithms have been developed to configure RBFNs. These algorithms need to be given a suitable set of parameters for every problem they face, thus methods to automatically search the values of these parameters are required. This paper shows the robustness of a meta-algorithm...
For a given data set, different learning algorithms typically provide different classifiers. Although it is possible to simply select the most successful classifier, the less successful classifiers could have potentially valuable information that may be wasted. This work proposes GAESC, an algorithm for evolving a set of classifiers into a single symbolic classifier using genetic algorithms. Individuals...
This paper presents an efficient distributed genetic algorithm for classification rules extraction in data mining, which is based on a new method of dynamic data distribution applied to parallelism using networks of computers in order to mine large datasets. The presented algorithm shows many advantages when compared with other distributed algorithms proposed in the specific literature. In this way,...
In this contribution we explore the combination of bagging with random subspace and two variants of Battiti's mutual information feature selection methods to design fuzzy rule-based classification system ensembles. Besides, we consider a multicriteria genetic algorithm guided by the training error to select the component classifiers, in order to look for appropriate accuracy-complexity trade-offs...
XCS is a learning classifier system that combines a reinforcement learning scheme with evolutionary algorithms to evolve rule sets on-line by means of the interaction with an environment. Usually, research conducted on XCS has mainly focused on the analysis and improvement of the reinforcement learning component, overlooking the evolutionary discovery process to some extent. Recently, the first efforts...
This paper focuses on the study of the influence of a newly implemented mechanism on a Pittsburgh-like classifier system. The Adapted Pittsburgh Classifier System is a learning classifier system that uses genetic algorithms to evolve its ruleset. The new mechanism discussed is inspired from Wilson work on the eXtended Classifier System (XCS): it allows the concerned LCS to adapt its rule set when...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.