Covering with Reducts - A Fast Algorithm for Rule Generation

  title={Covering with Reducts - A Fast Algorithm for Rule Generation},
  author={Jakub Wr{\'o}blewski},
  booktitle={Rough Sets and Current Trends in Computing},
  • J. Wróblewski
  • Published in
    Rough Sets and Current Trends…
    22 June 1998
  • Computer Science
In a rough set approach to knowledge discovery problems, a set of rules is generated basing on training data using a notion of reduct. Because a problem of finding short reducts is NP-hard, we have to use several approximation techniques. A covering approach to the problem of generating rules based on information system is presented in this article. A new, efficient algorithm for finding local reducts for each object in data table is described, as well as its parallelization and some… 

A Parallel Algorithm for Knowledge Discovery System-DNXE : UyEOHZVNL

A rough set based knowledge discovery system is presented. The system is based on the decomposition of large data tables into smaller ones in such a way that the approximation of global decision from

On the Decision Table with Maximal Number of Reducts

  • H. Nguyen
  • Computer Science, Mathematics
    Electron. Notes Theor. Comput. Sci.
  • 2003

Tree-Like Parallelization of Reduct and Construct Computation

  • R. Susmaga
  • Computer Science
    Rough Sets and Current Trends in Computing
  • 2004
The paper presents a so-called constrained tree-like model of parallelization of this task and illustrates practical behaviour of this algorithm in a computational experiment.

Ensembles of Classifiers Based on Approximate Reducts

It is proved that the problem of finding optimal set of classifying agents based on approximate reducts is NP-hard; the genetic algorithm is applied to find the suboptimal set.

Rseslib 3: Library of Rough Set and Machine Learning Methods with Extensible Architecture

The paper presents a new generation of Rseslib library - a collection of rough set and machine learning algorithms and data structures in Java. It provides algorithms for discretization,

Rough set algorithms in classification problem

Some algorithms, based on rough set theory, that can be used for the problem of new cases classification, and several methods for computation of decision rules based on reducts for real value attribute discretization are presented.

Scalable Methods in Rough Sets

This paper investigates the scalability features of rough set based methods in the context of their applicability in knowledge discovery from databases (KDD) and data mining and presents one of the latest scalable rough set classifiers.

Rseslib 3: Open Source Library of Rough Set and Machine Learning Methods

The paper presents a new generation of Rseslib library - a collection of rough set and machine learning algorithms and data structures in Java. It provides algorithms for discretization,

Building Scalable Lazy Rough Classifiers

A lazy classification method, which is equivalent to the rough set based method for construction of classifiers, but is scalable and applicable for large data sets, and can be applied forConstruction of adaptive rule generation system where data are growing up in time.

Computation of Minimal Cost Reducts

A new algorithm for generating all reducts of minimal costs, called minimal cost reduCTs or cheapest reductS, is introduced, which has been tested in numerous experiments with real-life data sets, and the results are reported here.



Genetic Algorithms in Decomposition and Classification Problems

Some combinatorical problems concerned with using rough set theory in knowledge discovery (KD) and data analysis can be successfully solved using genetic algorithms (GA) — a sophisticated, adaptive

ROSETTA -- A Rough Set Toolkit for Analysis of Data

The Rosetta system is presented, a toolkit for pattern recognition and data mining within the framework of rough set theory that has been constructed using well-proven object-oriented design patterns with maintainability, exten-sibility and exibility and ease of use as principal design parameters.

Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables

The results are showing that dynamic reducts can help to extract laws from decision tables, e.g. market data, medical data, textures and handwritten digits.

Genetic algorithms in decomposition and classification problem

In this work some examples of hybrid systems are presented, as well as the theory of order-based genetic algorithms being used in these systems and two examples of application of hybrid algorithms supporting rough set methods in knowledge discovery.

Intelligent Decision Support

The paper presents the system LERS for rule induction, which computes lower and upper approximations of each concept and induces certain rules and possible rules that can be induced from the input data.

Chapter 17 a Comparison of Dynamic and Non{dynamic Rough Set Methods for Extracting Laws from Decision Tables

The results of computer experiments obtained by applying the system based on rough set methods with the results on the same data sets obtained with help of several data analysis systems known from literature are reported.

Theoretical Foundations of Order-Based Genetic Algorithms

This paper shows, that many of classical results can be transferred into the order-based GAs, and includes the Schema Theorem and Markov chain modelling of order- based GA.

The Discernibility Matrices and Functions in Information Systems

Two notions related to any information system, namely the discernibility matrix and discernibility function, are introduced and several algorithms for solving problems related among other things to the rough definability, reducts, core and dependencies generation are obtained.

Rough sets: Theoretical aspects of reasoning about data