Universal attribute reduction problem

Mikhail Ju Moshkov*, Marcin Piliszczuk, Beata Zielosko

*Corresponding author for this work

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

1 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationRough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings
PublisherSpringer Verlag
Pages417-426
Number of pages10
ISBN (Print)9783540734505
DOIs
StatePublished - Jan 1 2007
EventInternational Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007 - Warsaw, Poland
Duration: Jun 28 2007Jun 30 2007

Publication series

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

Other

OtherInternational Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007
CountryPoland
CityWarsaw
Period06/28/0706/30/07

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 attribute reduction problem'. Together they form a unique fingerprint.

Cite this