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

^*Corresponding author for this work

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

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.

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 - 2005
Externally published	Yes
Event	10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005 - Regina, Canada Duration: Aug 31 2005 → Sep 3 2005

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3641 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005
Country/Territory	Canada
City	Regina
Period	08/31/05 → 09/3/05

Keywords

Greedy algorithm
Partial cover
Partial reduct
Partial test

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11548669_16

Cite this

Moshkov, M. J., & Piliszczuk, M. (2005). On partial tests and partial reducts for decision tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 149-155). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3641 LNAI). https://doi.org/10.1007/11548669_16

Moshkov, Mikhail Ju ; Piliszczuk, Marcin. / On partial tests and partial reducts for decision tables. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. pp. 149-155 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7faf181bb55a4bdbb22b1f525129a345,

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

keywords = "Greedy algorithm, Partial cover, Partial reduct, Partial test",

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

year = "2005",

doi = "10.1007/11548669_16",

language = "English (US)",

isbn = "3540286535",

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

pages = "149--155",

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

note = "10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005 ; Conference date: 31-08-2005 Through 03-09-2005",

}

Moshkov, MJ & Piliszczuk, M 2005, On partial tests and partial reducts for decision tables. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3641 LNAI, pp. 149-155, 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005, Regina, Canada, 08/31/05. https://doi.org/10.1007/11548669_16

On partial tests and partial reducts for decision tables. / Moshkov, Mikhail Ju; Piliszczuk, Marcin.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 149-155 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3641 LNAI).

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

TY - GEN

T1 - On partial tests and partial reducts for decision tables

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

PY - 2005

Y1 - 2005

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.

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.

KW - Greedy algorithm

KW - Partial cover

KW - Partial reduct

KW - Partial test

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

AN - SCOPUS:33645999378

SN - 3540286535

SN - 9783540286530

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

SP - 149

EP - 155

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

T2 - 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2005

Y2 - 31 August 2005 through 3 September 2005

ER -

Moshkov MJ, Piliszczuk M. On partial tests and partial reducts for decision tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 149-155. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11548669_16

On partial tests and partial reducts for decision tables

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this