Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules

Paweł Delimata; Mikhail Moshkov; Andrzej Skowron; Zbigniew Suraj

doi:10.1007/978-3-540-79721-0_13

Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules

Paweł Delimata^*, Mikhail Moshkov, Andrzej Skowron, Zbigniew Suraj

^*Corresponding author for this work

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

9 Scopus citations

Abstract

In the paper, two lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on deterministic and inhibitory decision rules, but the direct generation of rules is not required. Instead of this, for any new object the considered algorithms extract from a given decision table efficiently some information about the set of rules. Next, this information is used by a decision-making procedure. The reported results of experiments show that the algorithms based on inhibitory decision rules are often better than those based on deterministic decision rules.

Original language	English (US)
Title of host publication	Rough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings
Pages	55-62
Number of pages	8
DOIs	https://doi.org/10.1007/978-3-540-79721-0_13
State	Published - 2008
Event	3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008 - Chengdu, China Duration: May 17 2008 → May 19 2008

Publication series

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

Other

Other	3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008
Country/Territory	China
City	Chengdu
Period	05/17/08 → 05/19/08

Keywords

Decision tables
Deterministic decision rules
Inhibitory decision rules
Rough sets

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-79721-0_13

Cite this

Delimata, P., Moshkov, M., Skowron, A., & Suraj, Z. (2008). Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules. In Rough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings (pp. 55-62). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5009 LNAI). https://doi.org/10.1007/978-3-540-79721-0_13

Delimata, Paweł ; Moshkov, Mikhail ; Skowron, Andrzej et al. / Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules. Rough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings. 2008. pp. 55-62 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ac73fc5c20ce465c9233ec15695bbca6,

title = "Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules",

abstract = "In the paper, two lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on deterministic and inhibitory decision rules, but the direct generation of rules is not required. Instead of this, for any new object the considered algorithms extract from a given decision table efficiently some information about the set of rules. Next, this information is used by a decision-making procedure. The reported results of experiments show that the algorithms based on inhibitory decision rules are often better than those based on deterministic decision rules.",

keywords = "Decision tables, Deterministic decision rules, Inhibitory decision rules, Rough sets",

author = "Pawe{\l} Delimata and Mikhail Moshkov and Andrzej Skowron and Zbigniew Suraj",

year = "2008",

doi = "10.1007/978-3-540-79721-0_13",

language = "English (US)",

isbn = "3540797203",

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

pages = "55--62",

booktitle = "Rough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings",

note = "3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008 ; Conference date: 17-05-2008 Through 19-05-2008",

}

Delimata, P, Moshkov, M, Skowron, A & Suraj, Z 2008, Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules. in Rough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5009 LNAI, pp. 55-62, 3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008, Chengdu, China, 05/17/08. https://doi.org/10.1007/978-3-540-79721-0_13

Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules. / Delimata, Paweł; Moshkov, Mikhail; Skowron, Andrzej et al.
Rough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings. 2008. p. 55-62 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5009 LNAI).

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

TY - GEN

T1 - Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules

AU - Delimata, Paweł

AU - Moshkov, Mikhail

AU - Skowron, Andrzej

AU - Suraj, Zbigniew

PY - 2008

Y1 - 2008

N2 - In the paper, two lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on deterministic and inhibitory decision rules, but the direct generation of rules is not required. Instead of this, for any new object the considered algorithms extract from a given decision table efficiently some information about the set of rules. Next, this information is used by a decision-making procedure. The reported results of experiments show that the algorithms based on inhibitory decision rules are often better than those based on deterministic decision rules.

AB - In the paper, two lazy classification algorithms of polynomial time complexity are considered. These algorithms are based on deterministic and inhibitory decision rules, but the direct generation of rules is not required. Instead of this, for any new object the considered algorithms extract from a given decision table efficiently some information about the set of rules. Next, this information is used by a decision-making procedure. The reported results of experiments show that the algorithms based on inhibitory decision rules are often better than those based on deterministic decision rules.

KW - Decision tables

KW - Deterministic decision rules

KW - Inhibitory decision rules

KW - Rough sets

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

U2 - 10.1007/978-3-540-79721-0_13

DO - 10.1007/978-3-540-79721-0_13

M3 - Conference contribution

AN - SCOPUS:44649202241

SN - 3540797203

SN - 9783540797203

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

SP - 55

EP - 62

BT - Rough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings

T2 - 3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008

Y2 - 17 May 2008 through 19 May 2008

ER -

Delimata P, Moshkov M, Skowron A, Suraj Z. Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules. In Rough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings. 2008. p. 55-62. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-79721-0_13

Comparison of lazy classification algorithms based on deterministic and inhibitory decision rules

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this