On partial tests and partial reducts for decision tables

Mikhail Ju Moshkov; Marcin Piliszczuk

doi:10.1007/11548669_16

On partial tests and partial reducts for decision tables

Mikhail Ju Moshkov, Marcin Piliszczuk

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

3 Scopus citations

Abstract

In the paper a greedy algorithm for construction of partial tests is considered. Bounds on minimal cardinality of partial reducts are obtained. Results of experiments with software implementation of the greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2005.

Original language	English (US)
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	149-155
Number of pages	7
DOIs	https://doi.org/10.1007/11548669_16
State	Published - Dec 1 2005
Externally published	Yes

Bibliographical note

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

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11548669_16

Cite this

@inproceedings{a6665120dd274f7bbbb05f1d62e26175,

title = "On partial tests and partial reducts for decision tables",

abstract = "In the paper a greedy algorithm for construction of partial tests is considered. Bounds on minimal cardinality of partial reducts are obtained. Results of experiments with software implementation of the greedy algorithm are described. {\textcopyright} Springer-Verlag Berlin Heidelberg 2005.",

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

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

year = "2005",

month = dec,

day = "1",

doi = "10.1007/11548669_16",

language = "English (US)",

isbn = "3540286535",

pages = "149--155",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - On partial tests and partial reducts for decision tables

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

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

PY - 2005/12/1

Y1 - 2005/12/1

N2 - In the paper a greedy algorithm for construction of partial tests is considered. Bounds on minimal cardinality of partial reducts are obtained. Results of experiments with software implementation of the greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2005.

AB - In the paper a greedy algorithm for construction of partial tests is considered. Bounds on minimal cardinality of partial reducts are obtained. Results of experiments with software implementation of the greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2005.

UR - http://link.springer.com/10.1007/11548669_16

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

U2 - 10.1007/11548669_16

DO - 10.1007/11548669_16

M3 - Conference contribution

SN - 3540286535

SP - 149

EP - 155

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

On partial tests and partial reducts for decision tables

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this