On cardinality of reducts for the most part of binary decision tables

Mikhail Ju Moshkov

On cardinality of reducts for the most part of binary decision tables

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

Abstract

Original language	English (US)
Title of host publication	Proceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005
Pages	2404-2410
Number of pages	7
State	Published - Dec 1 2005
Externally published	Yes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2023-09-21

Cite this

@inproceedings{256fd38c88d04de6bf6ea8af78234e14,

title = "On cardinality of reducts for the most part of binary decision tables",

abstract = "In the paper upper and lower bounds on the cardinality of reducts for the most part of binary decision tables are obtained. Copyright {\textcopyright} IICAI 2005.",

author = "Moshkov, {Mikhail Ju}",

note = "Generated from Scopus record by KAUST IRTS on 2023-09-21",

year = "2005",

month = dec,

day = "1",

language = "English (US)",

isbn = "0972741216",

pages = "2404--2410",

booktitle = "Proceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005",

}

TY - GEN

T1 - On cardinality of reducts for the most part of binary decision tables

AU - Moshkov, Mikhail Ju

N1 - Generated from Scopus record by KAUST IRTS on 2023-09-21

PY - 2005/12/1

Y1 - 2005/12/1

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

M3 - Conference contribution

SN - 0972741216

SP - 2404

EP - 2410

BT - Proceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005

ER -

On cardinality of reducts for the most part of binary decision tables

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this