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

^*Corresponding author for this work

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

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.

Original language	English (US)
Title of host publication	Rough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings
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 - 2007
Externally published	Yes
Event	International Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007 - Warsaw, Poland Duration: Jun 28 2007 → Jun 30 2007

Publication series

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

Other

Other	International Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007
Country/Territory	Poland
City	Warsaw
Period	06/28/07 → 06/30/07

Keywords

Greedy algorithm
Partial reduct
Partial test

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

Moshkov, M. J., Piliszczuk, M., & Zielosko, B. (2007). Universal attribute reduction problem. In Rough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings (pp. 417-426). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4585 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-540-73451-2_44

Moshkov, Mikhail Ju ; Piliszczuk, Marcin ; Zielosko, Beata. / Universal attribute reduction problem. Rough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings. Springer Verlag, 2007. pp. 417-426 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{084fd182ea00439e87034e49366946d2,

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

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

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

year = "2007",

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

language = "English (US)",

isbn = "9783540734505",

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

publisher = "Springer Verlag",

pages = "417--426",

booktitle = "Rough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings",

address = "Germany",

note = "International Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007 ; Conference date: 28-06-2007 Through 30-06-2007",

}

Moshkov, MJ, Piliszczuk, M & Zielosko, B 2007, Universal attribute reduction problem. in Rough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4585 LNAI, Springer Verlag, pp. 417-426, International Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007, Warsaw, Poland, 06/28/07. https://doi.org/10.1007/978-3-540-73451-2_44

Universal attribute reduction problem. / Moshkov, Mikhail Ju; Piliszczuk, Marcin; Zielosko, Beata.
Rough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings. Springer Verlag, 2007. p. 417-426 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4585 LNAI).

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

TY - GEN

T1 - Universal attribute reduction problem

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

PY - 2007

Y1 - 2007

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.

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.

KW - Greedy algorithm

KW - Partial reduct

KW - Partial test

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

AN - SCOPUS:38049088390

SN - 9783540734505

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

SP - 417

EP - 426

BT - Rough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings

PB - Springer Verlag

T2 - International Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007

Y2 - 28 June 2007 through 30 June 2007

ER -

Moshkov MJ, Piliszczuk M, Zielosko B. Universal attribute reduction problem. In Rough Sets and Intelligent Systems Paradigms - International Conference, RSEISP 2007, Proceedings. Springer Verlag. 2007. p. 417-426. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-73451-2_44

Universal attribute reduction problem

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this