On partial tests and partial reducts for decision tables

Mikhail Ju Moshkov, Marcin Piliszczuk

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


In the paper a greedy algorithm for construction of partial tests is considered. Bounds on minimal cardinality of partial reducts are obtained. Results of experiments with software implementation of the greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2005.
Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number of pages7
StatePublished - Dec 1 2005
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'On partial tests and partial reducts for decision tables'. Together they form a unique fingerprint.

Cite this