Experiments with real-life decision tables

Mikhail Ju Moshkov; Marcin Piliszczuk; Beata Zielosko

doi:10.1007/978-3-540-69029-0_5

Experiments with real-life decision tables

Mikhail Ju Moshkov^*, Marcin Piliszczuk, Beata Zielosko

^*Corresponding author for this work

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

2 Scopus citations

Abstract

This chapter is devoted to consideration of results of experiments with decision tables from UCI Repository of Machine Learning Databases [32]. The aim of the first group of experiments is to verify 0.5-hypothesis for real-life decision tables. We made experiments with 23 decision tables. Results of 21 experiments confirm 0.5-hypothesis for reducts: under the construction of partial test, during each step the greedy algorithm chooses an attribute which separates at least one-half of unseparated pairs of different rows with different decisions.

Original language	English (US)
Title of host publication	Partial Covers, Reducts and Decision Rules in Rough Sets
Subtitle of host publication	Theory and Applications
Editors	Mikhail Moshkov, Beata Zielosko, Marcin Piliszczuk
Pages	117-133
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-540-69029-0_5
State	Published - 2008

Publication series

Name	Studies in Computational Intelligence
Volume	145
ISSN (Print)	1860-949X

ASJC Scopus subject areas

Artificial Intelligence

Access to Document

10.1007/978-3-540-69029-0_5

Cite this

@inbook{9ca714f3dce6471e96d3b3c089a649f3,

title = "Experiments with real-life decision tables",

abstract = "This chapter is devoted to consideration of results of experiments with decision tables from UCI Repository of Machine Learning Databases [32]. The aim of the first group of experiments is to verify 0.5-hypothesis for real-life decision tables. We made experiments with 23 decision tables. Results of 21 experiments confirm 0.5-hypothesis for reducts: under the construction of partial test, during each step the greedy algorithm chooses an attribute which separates at least one-half of unseparated pairs of different rows with different decisions.",

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

year = "2008",

doi = "10.1007/978-3-540-69029-0_5",

language = "English (US)",

isbn = "9783540690276",

series = "Studies in Computational Intelligence",

pages = "117--133",

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

booktitle = "Partial Covers, Reducts and Decision Rules in Rough Sets",

}

Experiments with real-life decision tables. / Moshkov, Mikhail Ju; Piliszczuk, Marcin; Zielosko, Beata.
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications. ed. / Mikhail Moshkov; Beata Zielosko; Marcin Piliszczuk. 2008. p. 117-133 (Studies in Computational Intelligence; Vol. 145).

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

TY - CHAP

T1 - Experiments with real-life decision tables

AU - Moshkov, Mikhail Ju

AU - Piliszczuk, Marcin

AU - Zielosko, Beata

PY - 2008

Y1 - 2008

N2 - This chapter is devoted to consideration of results of experiments with decision tables from UCI Repository of Machine Learning Databases [32]. The aim of the first group of experiments is to verify 0.5-hypothesis for real-life decision tables. We made experiments with 23 decision tables. Results of 21 experiments confirm 0.5-hypothesis for reducts: under the construction of partial test, during each step the greedy algorithm chooses an attribute which separates at least one-half of unseparated pairs of different rows with different decisions.

AB - This chapter is devoted to consideration of results of experiments with decision tables from UCI Repository of Machine Learning Databases [32]. The aim of the first group of experiments is to verify 0.5-hypothesis for real-life decision tables. We made experiments with 23 decision tables. Results of 21 experiments confirm 0.5-hypothesis for reducts: under the construction of partial test, during each step the greedy algorithm chooses an attribute which separates at least one-half of unseparated pairs of different rows with different decisions.

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

U2 - 10.1007/978-3-540-69029-0_5

DO - 10.1007/978-3-540-69029-0_5

M3 - Chapter

AN - SCOPUS:51649098490

SN - 9783540690276

T3 - Studies in Computational Intelligence

SP - 117

EP - 133

BT - Partial Covers, Reducts and Decision Rules in Rough Sets

A2 - Moshkov, Mikhail

A2 - Zielosko, Beata

A2 - Piliszczuk, Marcin

ER -

Experiments with real-life decision tables

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this