On construction of partial reducts and irreducible partial decision rules

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

On construction of partial reducts and irreducible partial decision rules

Mikhail Ju Moshkov, Marcin Piliszczuk, Beata Zielosko

Research output: Contribution to journal › Article › peer-review

Abstract

In the paper for the most part of binary decision tables upper and lower bounds on the cardinality of partial reducts and length of irreducible partial decision rules are obtained. The number of partial reducts and the number of irreducible partial decision rules are evaluated. Complexity of algorithms for construction of all partial reducts and all irreducible partial decision rules is studied on the basis of obtained bounds.

Original language	English (US)
Pages (from-to)	357-374
Number of pages	18
Journal	Fundamenta Informaticae
Volume	75
Issue number	1-4
State	Published - Mar 14 2007
Externally published	Yes

Bibliographical note

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

ASJC Scopus subject areas

Computational Theory and Mathematics
Algebra and Number Theory
Theoretical Computer Science
Information Systems

Cite this

@article{961d5eb766e54074946da51747105030,

title = "On construction of partial reducts and irreducible partial decision rules",

abstract = "In the paper for the most part of binary decision tables upper and lower bounds on the cardinality of partial reducts and length of irreducible partial decision rules are obtained. The number of partial reducts and the number of irreducible partial decision rules are evaluated. Complexity of algorithms for construction of all partial reducts and all irreducible partial decision rules is studied on the basis of obtained bounds.",

author = "Moshkov, {Mikhail Ju} and Marcin Piliszczuk and Beata Zielosko",

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

year = "2007",

month = mar,

day = "14",

language = "English (US)",

volume = "75",

pages = "357--374",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press BV",

number = "1-4",

}

TY - JOUR

T1 - On construction of partial reducts and irreducible partial decision rules

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

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

PY - 2007/3/14

Y1 - 2007/3/14

N2 - In the paper for the most part of binary decision tables upper and lower bounds on the cardinality of partial reducts and length of irreducible partial decision rules are obtained. The number of partial reducts and the number of irreducible partial decision rules are evaluated. Complexity of algorithms for construction of all partial reducts and all irreducible partial decision rules is studied on the basis of obtained bounds.

AB - In the paper for the most part of binary decision tables upper and lower bounds on the cardinality of partial reducts and length of irreducible partial decision rules are obtained. The number of partial reducts and the number of irreducible partial decision rules are evaluated. Complexity of algorithms for construction of all partial reducts and all irreducible partial decision rules is studied on the basis of obtained bounds.

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

M3 - Article

SN - 0169-2968

VL - 75

SP - 357

EP - 374

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 1-4

ER -

On construction of partial reducts and irreducible partial decision rules

Abstract

Bibliographical note

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this