Universal attribute reduction problem

Mikhail Ju Moshkov, Marcin Piliszczuk, Beata Zielosko

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

3 Scopus citations


In the paper, some generalizations of the notions of reduct and test (superreduct) 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 on greedy algorithm work is studied. Results of an experiment with greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2007.
Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540734505
StatePublished - Jan 1 2007
Externally publishedYes


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

Cite this