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

^*Corresponding author for this work

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

Abstract

In the paper upper and lower bounds on the cardinality of reducts for the most part of binary decision tables are obtained.

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 - 2005
Externally published	Yes
Event	2nd Indian International Conference on Artificial Intelligence, IICAI 2005 - Pune, India Duration: Dec 20 2005 → Dec 22 2005

Publication series

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

Other

Other	2nd Indian International Conference on Artificial Intelligence, IICAI 2005
Country/Territory	India
City	Pune
Period	12/20/05 → 12/22/05

ASJC Scopus subject areas

Artificial Intelligence

Cite this

@inproceedings{e55b8c7e59a648978ae9e56947a2387b,

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.",

author = "Moshkov, {Mikhail Ju}",

year = "2005",

language = "English (US)",

isbn = "0972741216",

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

pages = "2404--2410",

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

note = "2nd Indian International Conference on Artificial Intelligence, IICAI 2005 ; Conference date: 20-12-2005 Through 22-12-2005",

}

Moshkov, MJ 2005, On cardinality of reducts for the most part of binary decision tables. in Proceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005. Proceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005, pp. 2404-2410, 2nd Indian International Conference on Artificial Intelligence, IICAI 2005, Pune, India, 12/20/05.

On cardinality of reducts for the most part of binary decision tables. / Moshkov, Mikhail Ju.
Proceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005. 2005. p. 2404-2410 (Proceedings of the 2nd Indian International Conference on Artificial Intelligence, IICAI 2005).

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

TY - GEN

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

AU - Moshkov, Mikhail Ju

PY - 2005

Y1 - 2005

N2 - In the paper upper and lower bounds on the cardinality of reducts for the most part of binary decision tables are obtained.

AB - In the paper upper and lower bounds on the cardinality of reducts for the most part of binary decision tables are obtained.

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

M3 - Conference contribution

AN - SCOPUS:84872067865

SN - 0972741216

SN - 9780972741217

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

SP - 2404

EP - 2410

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

T2 - 2nd Indian International Conference on Artificial Intelligence, IICAI 2005

Y2 - 20 December 2005 through 22 December 2005

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this