Universal attribute reduction problem

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

doi:10.1007/978-3-540-73451-2_44

Universal attribute reduction problem

Mikhail Ju Moshkov, Marcin Piliszczuk, Beata Zielosko

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

3 Scopus citations

Abstract

In the paper, some generalizations of the notions of reduct and test (superreduct) 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 on greedy algorithm work is studied. Results of an experiment with greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2007.

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)
Publisher	Springer Verlag
Pages	417-426
Number of pages	10
ISBN (Print)	9783540734505
DOIs	https://doi.org/10.1007/978-3-540-73451-2_44
State	Published - Jan 1 2007
Externally published	Yes

Access to Document

10.1007/978-3-540-73451-2_44

Cite this

@inproceedings{6a3048602a084a5b9dcb123a090a7d83,

title = "Universal attribute reduction problem",

abstract = "In the paper, some generalizations of the notions of reduct and test (superreduct) 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 on greedy algorithm work is studied. Results of an experiment with greedy algorithm are described. {\textcopyright} Springer-Verlag Berlin Heidelberg 2007.",

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 = jan,

day = "1",

doi = "10.1007/978-3-540-73451-2_44",

language = "English (US)",

isbn = "9783540734505",

pages = "417--426",

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

publisher = "Springer Verlag",

address = "Germany",

}

TY - GEN

T1 - Universal attribute reduction problem

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

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

PY - 2007/1/1

Y1 - 2007/1/1

N2 - In the paper, some generalizations of the notions of reduct and test (superreduct) 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 on greedy algorithm work is studied. Results of an experiment with greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2007.

AB - In the paper, some generalizations of the notions of reduct and test (superreduct) 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 on greedy algorithm work is studied. Results of an experiment with greedy algorithm are described. © Springer-Verlag Berlin Heidelberg 2007.

UR - http://link.springer.com/10.1007/978-3-540-73451-2_44

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

U2 - 10.1007/978-3-540-73451-2_44

DO - 10.1007/978-3-540-73451-2_44

M3 - Conference contribution

SN - 9783540734505

SP - 417

EP - 426

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

PB - Springer Verlag

ER -

Universal attribute reduction problem

Abstract

Access to Document

Other files and links

Fingerprint

Cite this