Upper bounds on minimum cardinality of exact and approximate reducts

Handle URI:
http://hdl.handle.net/10754/564269
Title:
Upper bounds on minimum cardinality of exact and approximate reducts
Authors:
Chikalov, Igor; Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Zielosko, Beata Marta
Abstract:
In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Applied Mathematics and Computational Science Program; Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Publisher:
Springer Science + Business Media
Journal:
Rough Sets and Current Trends in Computing
Conference/Event name:
7th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2010
Issue Date:
2010
DOI:
10.1007/978-3-642-13529-3_44
Type:
Conference Paper
ISSN:
03029743
ISBN:
3642135285; 9783642135286
Appears in Collections:
Conference Papers; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorChikalov, Igoren
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorZielosko, Beata Martaen
dc.date.accessioned2015-08-04T06:21:26Zen
dc.date.available2015-08-04T06:21:26Zen
dc.date.issued2010en
dc.identifier.isbn3642135285; 9783642135286en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-13529-3_44en
dc.identifier.urihttp://hdl.handle.net/10754/564269en
dc.description.abstractIn the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectApproximate reducten
dc.subjectExact reducten
dc.subjectUpper bound on minimum cardinalityen
dc.titleUpper bounds on minimum cardinality of exact and approximate reductsen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.identifier.journalRough Sets and Current Trends in Computingen
dc.conference.date28 June 2010 through 30 June 2010en
dc.conference.name7th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2010en
dc.conference.locationWarsawen
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Bȩdzińska St., Sosnowiec, 41-200, Polanden
kaust.authorChikalov, Igoren
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.