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

Authors:
Mikhail Ju Moshkov;Marcin Piliszczuk;Beata Zielosko
Affiliations:
Institute of Computer Science, University of Silesia, Sosnowiec, Poland;ING Bank Śląski S.A., Katowice, Poland;Institute of Computer Science, University of Silesia, Sosnowiec, Poland
Venue:
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Year:
2006

Citing 7
Cited 0

Approximate Reducts and Association Rules - Correspondence and Complexity Results

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Approximate entropy reducts

Fundamenta Informaticae
Approximation algorithms for set cover and related problems

Approximation algorithms for set cover and related problems
Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis

Fundamenta Informaticae
Ensembles of Classifiers Based on Approximate Reducts

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Order based genetic algorithms for the search of approximate entropy reducts

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
On partial covers, reducts and decision rules

Transactions on rough sets VIII

Quantified Score

Hi-index	0.00

Visualization

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