Upper bounds on minimum cardinality of exact and approximate reducts

Igor Chikalov; Mikhail Moshkov; Beata Marta Zielosko

doi:10.1007/978-3-642-13529-3_44

Upper bounds on minimum cardinality of exact and approximate reducts

Igor Chikalov, Mikhail Moshkov, Beata Marta Zielosko

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

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.

Original language	English (US)
Title of host publication	Rough Sets and Current Trends in Computing
Publisher	Springer Nature
Pages	412-417
Number of pages	6
ISBN (Print)	3642135285; 9783642135286
DOIs	https://doi.org/10.1007/978-3-642-13529-3_44
State	Published - 2010

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-13529-3_44

Cite this

@inproceedings{148657affd844c7ab336e455773f1e9e,

title = "Upper bounds on minimum cardinality of exact and approximate reducts",

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. {\textcopyright} 2010 Springer-Verlag Berlin Heidelberg.",

author = "Igor Chikalov and Mikhail Moshkov and Zielosko, {Beata Marta}",

note = "KAUST Repository Item: Exported on 2020-10-01",

year = "2010",

doi = "10.1007/978-3-642-13529-3_44",

language = "English (US)",

isbn = "3642135285; 9783642135286",

pages = "412--417",

booktitle = "Rough Sets and Current Trends in Computing",

publisher = "Springer Nature",

}

TY - GEN

T1 - Upper bounds on minimum cardinality of exact and approximate reducts

AU - Chikalov, Igor

AU - Moshkov, Mikhail

AU - Zielosko, Beata Marta

N1 - KAUST Repository Item: Exported on 2020-10-01

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://hdl.handle.net/10754/564269

UR - http://link.springer.com/10.1007/978-3-642-13529-3_44

UR - http://www.scopus.com/inward/record.url?scp=79956289205&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13529-3_44

DO - 10.1007/978-3-642-13529-3_44

M3 - Conference contribution

SN - 3642135285; 9783642135286

SP - 412

EP - 417

BT - Rough Sets and Current Trends in Computing

PB - Springer Nature

ER -

Upper bounds on minimum cardinality of exact and approximate reducts

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this