Universal problem of attribute reduction

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

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

Universal problem of attribute reduction

Mikhail Ju Moshkov, Marcin Piliszczuk, Beata Zielosko

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

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. © 2008 Springer Berlin Heidelberg.

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	187-199
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-540-89876-4_11
State	Published - Dec 1 2008
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

@inproceedings{cd838cfd6d25442aa8b2a5d7d342c609,

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. {\textcopyright} 2008 Springer Berlin Heidelberg.",

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

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

year = "2008",

month = dec,

day = "1",

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

language = "English (US)",

isbn = "3540898751",

pages = "187--199",

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

}

TY - GEN

T1 - Universal problem of attribute reduction

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

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

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. © 2008 Springer Berlin Heidelberg.

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. © 2008 Springer Berlin Heidelberg.

UR - http://link.springer.com/10.1007/978-3-540-89876-4_11

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

SN - 3540898751

SP - 187

EP - 199

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

ER -

Universal problem of attribute reduction

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this