Universal problem of attribute reduction

Mikhail Moshkov, Marcin Piliszczuk, Beata Zielosko

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

1 Scopus citations

Abstract

In the paper, some generalizations of the notions of reduct, test (superreduct), partial (approximate) reduct and partial test are considered. The accuracy of greedy algorithm for construction of partial test is investigated. A lower bound on the minimal cardinality of partial reducts based on an information about greedy algorithm work is studied. A bound on the precision of greedy algorithm which does not depend on the number of pairs of rows of a decision table which should be separated is obtained. Results of experiments with greedy algorithm are discussed.

Original languageEnglish (US)
Title of host publicationTransactions on Rough Sets IX
Pages187-199
Number of pages13
DOIs
StatePublished - Dec 1 2008

Publication series

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

Keywords

  • Greedy algorithm
  • Partial reduct
  • Partial test

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Universal problem of attribute reduction'. Together they form a unique fingerprint.

Cite this