Sign in
Back
Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules
Book chapter   Peer reviewed

Lower Bounds on Minimal Weight of Partial Reducts and Partial Decision Rules

Mikhail Ju Moshkov, Marcin Piliszczuk and Beata Zielosko
Rough Sets and Knowledge Technology, pp.290-296
Lecture Notes in Computer Science, Springer Berlin Heidelberg
2006
DOI: https://doi.org/10.1007/11795131_42

Abstract

greedy algorithms partial decision rules Partial reducts weights
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.

Metrics

1 Record Views

Details