Lower bounds on minimal weight of partial reducts and partial decision rules

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

doi:10.1007/11795131_42

Lower bounds on minimal weight of partial reducts and partial decision rules

Mikhail Ju Moshkov^*, Marcin Piliszczuk, Beata Zielosko

^*Corresponding author for this work

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

2 Scopus citations

Abstract

In this paper greedy algorithms with weights for construction of partial tests (partial superreducts) and partial decision rules are considered. Lower bounds on minimal weight of partial reducts and partial decision rules based on information about greedy algorithm work are obtained.

Original language	English (US)
Title of host publication	Rough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings
Publisher	Springer Verlag
Pages	290-296
Number of pages	7
ISBN (Print)	3540362975, 9783540362975
DOIs	https://doi.org/10.1007/11795131_42
State	Published - 2006
Externally published	Yes
Event	First International Conference on Rough Sets and Knowledge Technology, RSKT 2006 - Chongqing, China Duration: Jul 24 2006 → Jul 26 2006

Publication series

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

Other

Other	First International Conference on Rough Sets and Knowledge Technology, RSKT 2006
Country/Territory	China
City	Chongqing
Period	07/24/06 → 07/26/06

Keywords

Greedy algorithms
Partial decision rules
Partial reducts
Weights

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11795131_42

Cite this

Moshkov, M. J., Piliszczuk, M., & Zielosko, B. (2006). Lower bounds on minimal weight of partial reducts and partial decision rules. In Rough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings (pp. 290-296). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4062 LNAI). Springer Verlag. https://doi.org/10.1007/11795131_42

Moshkov, Mikhail Ju ; Piliszczuk, Marcin ; Zielosko, Beata. / Lower bounds on minimal weight of partial reducts and partial decision rules. Rough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings. Springer Verlag, 2006. pp. 290-296 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{dc96f2dfba4c4bff90ccf414c2b20246,

title = "Lower bounds on minimal weight of partial reducts and partial decision rules",

abstract = "In this paper greedy algorithms with weights for construction of partial tests (partial superreducts) and partial decision rules are considered. Lower bounds on minimal weight of partial reducts and partial decision rules based on information about greedy algorithm work are obtained.",

keywords = "Greedy algorithms, Partial decision rules, Partial reducts, Weights",

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

year = "2006",

doi = "10.1007/11795131_42",

language = "English (US)",

isbn = "3540362975",

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

publisher = "Springer Verlag",

pages = "290--296",

booktitle = "Rough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings",

address = "Germany",

note = "First International Conference on Rough Sets and Knowledge Technology, RSKT 2006 ; Conference date: 24-07-2006 Through 26-07-2006",

}

Moshkov, MJ, Piliszczuk, M & Zielosko, B 2006, Lower bounds on minimal weight of partial reducts and partial decision rules. in Rough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4062 LNAI, Springer Verlag, pp. 290-296, First International Conference on Rough Sets and Knowledge Technology, RSKT 2006, Chongqing, China, 07/24/06. https://doi.org/10.1007/11795131_42

Lower bounds on minimal weight of partial reducts and partial decision rules. / Moshkov, Mikhail Ju; Piliszczuk, Marcin; Zielosko, Beata.
Rough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings. Springer Verlag, 2006. p. 290-296 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4062 LNAI).

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

TY - GEN

T1 - Lower bounds on minimal weight of partial reducts and partial decision rules

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

PY - 2006

Y1 - 2006

N2 - In this paper greedy algorithms with weights for construction of partial tests (partial superreducts) and partial decision rules are considered. Lower bounds on minimal weight of partial reducts and partial decision rules based on information about greedy algorithm work are obtained.

AB - In this paper greedy algorithms with weights for construction of partial tests (partial superreducts) and partial decision rules are considered. Lower bounds on minimal weight of partial reducts and partial decision rules based on information about greedy algorithm work are obtained.

KW - Greedy algorithms

KW - Partial decision rules

KW - Partial reducts

KW - Weights

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

U2 - 10.1007/11795131_42

DO - 10.1007/11795131_42

M3 - Conference contribution

AN - SCOPUS:33746772056

SN - 3540362975

SN - 9783540362975

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

SP - 290

EP - 296

BT - Rough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings

PB - Springer Verlag

T2 - First International Conference on Rough Sets and Knowledge Technology, RSKT 2006

Y2 - 24 July 2006 through 26 July 2006

ER -

Moshkov MJ, Piliszczuk M, Zielosko B. Lower bounds on minimal weight of partial reducts and partial decision rules. In Rough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings. Springer Verlag. 2006. p. 290-296. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11795131_42

Lower bounds on minimal weight of partial reducts and partial decision rules

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this