Lower bounds on minimal weight of partial reducts and partial decision rules

Mikhail Ju Moshkov*, Marcin Piliszczuk, Beata Zielosko

*Corresponding author for this work

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

Abstract

In this paper greedy algorithms with weights for construction of partial tests (partial superreducts) and partial decision rules are considered. Lower bounds on minimal weight of partial reducts and partial decision rules based on information about greedy algorithm work are obtained.

Original languageEnglish (US)
Title of host publicationRough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings
PublisherSpringer Verlag
Pages290-296
Number of pages7
Volume4062 LNAI
ISBN (Print)3540362975, 9783540362975
StatePublished - 2006
Externally publishedYes
EventFirst International Conference on Rough Sets and Knowledge Technology, RSKT 2006 - Chongqing, China
Duration: Jul 24 2006Jul 26 2006

Publication series

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

Other

OtherFirst International Conference on Rough Sets and Knowledge Technology, RSKT 2006
CountryChina
CityChongqing
Period07/24/0607/26/06

Keywords

  • Greedy algorithms
  • Partial decision rules
  • Partial reducts
  • Weights

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Fingerprint

Dive into the research topics of 'Lower bounds on minimal weight of partial reducts and partial decision rules'. Together they form a unique fingerprint.

Cite this