Universal problem of attribute reduction

Mikhail Moshkov; Marcin Piliszczuk; Beata Zielosko

doi:10.1007/978-3-540-89876-4_11

Universal problem of attribute reduction

Mikhail Moshkov, Marcin Piliszczuk, Beata Zielosko

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

1 Scopus citations

Abstract

In the paper, some generalizations of the notions of reduct, test (superreduct), partial (approximate) reduct and partial test are considered. The accuracy of greedy algorithm for construction of partial test is investigated. A lower bound on the minimal cardinality of partial reducts based on an information about greedy algorithm work is studied. A bound on the precision of greedy algorithm which does not depend on the number of pairs of rows of a decision table which should be separated is obtained. Results of experiments with greedy algorithm are discussed.

Original language	English (US)
Title of host publication	Transactions on Rough Sets IX
Pages	187-199
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-540-89876-4_11
State	Published - Dec 1 2008

Publication series

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

Keywords

Greedy algorithm
Partial reduct
Partial test

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-89876-4_11

Cite this

@inproceedings{918817b5e2fc447e89e7e602c336c359,

title = "Universal problem of attribute reduction",

abstract = "In the paper, some generalizations of the notions of reduct, test (superreduct), partial (approximate) reduct and partial test are considered. The accuracy of greedy algorithm for construction of partial test is investigated. A lower bound on the minimal cardinality of partial reducts based on an information about greedy algorithm work is studied. A bound on the precision of greedy algorithm which does not depend on the number of pairs of rows of a decision table which should be separated is obtained. Results of experiments with greedy algorithm are discussed.",

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

author = "Mikhail Moshkov and Marcin Piliszczuk and Beata Zielosko",

year = "2008",

month = dec,

day = "1",

doi = "10.1007/978-3-540-89876-4_11",

language = "English (US)",

isbn = "3540898751",

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

pages = "187--199",

booktitle = "Transactions on Rough Sets IX",

}

Universal problem of attribute reduction. / Moshkov, Mikhail; Piliszczuk, Marcin; Zielosko, Beata.
Transactions on Rough Sets IX. 2008. p. 187-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5390 LNCS).

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

TY - GEN

T1 - Universal problem of attribute reduction

AU - Moshkov, Mikhail

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

PY - 2008/12/1

Y1 - 2008/12/1

N2 - In the paper, some generalizations of the notions of reduct, test (superreduct), partial (approximate) reduct and partial test are considered. The accuracy of greedy algorithm for construction of partial test is investigated. A lower bound on the minimal cardinality of partial reducts based on an information about greedy algorithm work is studied. A bound on the precision of greedy algorithm which does not depend on the number of pairs of rows of a decision table which should be separated is obtained. Results of experiments with greedy algorithm are discussed.

AB - In the paper, some generalizations of the notions of reduct, test (superreduct), partial (approximate) reduct and partial test are considered. The accuracy of greedy algorithm for construction of partial test is investigated. A lower bound on the minimal cardinality of partial reducts based on an information about greedy algorithm work is studied. A bound on the precision of greedy algorithm which does not depend on the number of pairs of rows of a decision table which should be separated is obtained. Results of experiments with greedy algorithm are discussed.

KW - Greedy algorithm

KW - Partial reduct

KW - Partial test

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

U2 - 10.1007/978-3-540-89876-4_11

DO - 10.1007/978-3-540-89876-4_11

M3 - Conference contribution

AN - SCOPUS:58449133457

SN - 3540898751

SN - 9783540898757

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

SP - 187

EP - 199

BT - Transactions on Rough Sets IX

ER -

Universal problem of attribute reduction

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this