Displaying similar documents to “Minimal decision rules based on the apriori algorithm”

Combined classifier based on feature space partitioning

Michał Woźniak, Bartosz Krawczyk (2012)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper presents a significant modification to the AdaSS (Adaptive Splitting and Selection) algorithm, which was developed several years ago. The method is based on the simultaneous partitioning of the feature space and an assignment of a compound classifier to each of the subsets. The original version of the algorithm uses a classifier committee and a majority voting rule to arrive at a decision. The proposed modification replaces the fairly simple fusion method with a combined classifier,...

A rough set-based knowledge discovery process

Ning Zhong, Andrzej Skowron (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

The knowledge discovery from real-life databases is a multi-phase process consisting of numerous steps, including attribute selection, discretization of real-valued attributes, and rule induction. In the paper, we discuss a rule discovery process that is based on rough set theory. The core of the process is a soft hybrid induction system called the Generalized Distribution Table and Rough Set System (GDT-RS) for discovering classification rules from databases with uncertain and incomplete...

Quality improvement of rule-based gene group descriptions using information about GO terms importance occurring in premises of determined rules

Marek Sikora, Aleksandra Gruca (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper we present a method for evaluating the importance of GO terms which compose multi-attribute rules. The rules are generated for the purpose of biological interpretation of gene groups. Each multi-attribute rule is a combination of GO terms and, based on relationships among them, one can obtain a functional description of gene groups. We present a method which allows evaluating the influence of a given GO term on the quality of a rule and the quality of a whole set of rules....

Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery

Mohammed Khabzaoui, Clarisse Dhaenens, El-Ghazali Talbi (2008)

RAIRO - Operations Research

Similarity:

An important task of knowledge discovery deals with discovering association rules. This very general model has been widely studied and efficient algorithms have been proposed. But most of the time, only frequent rules are seeked. Here we propose to consider this problem as a multi-objective combinatorial optimization problem in order to be able to also find non frequent but interesting rules. As the search space may be very large, a discussion about different approaches is proposed...

Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem

Ireneusz Czarnowski, Piotr Jędrzejowicz (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning...