On partial tests and partial reducts for decision tables

Mikhail Moshkov*, Marcin Piliszczuk

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages149-155
Number of pages7
DOIs
StatePublished - Dec 1 2005
Event10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005 - Regina, Canada
Duration: Aug 31 2005Sep 3 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3641 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005
CountryCanada
CityRegina
Period08/31/0509/3/05

Keywords

  • Greedy algorithm
  • Partial cover
  • Partial reduct
  • Partial test

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Fingerprint

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

Cite this