Lazy classification algorithms based on deterministic and inhibitory association rules

Pawel Delimata, Mikhail Ju Moshkov, Andrzej Skowron, Zbigniew Suraj

Research output: Contribution to journalArticlepeer-review

Abstract

In this chapter, we consider the same classification problem as in Chap. 5: for a given decision table T and a new object v it is required to generate a value of the decision attribute on v using values of conditional attributes on v. To this end, we divide the decision table T into a number of information systems Si, i ∈ Dec (T), where Dec (T) is the set of values of the decision attribute in T. For i ∈ Dec (T), the information system Si contains only objects (rows) of T with the value of the decision attribute equal to i. © 2009 Springer-Verlag Berlin Heidelberg.
Original languageEnglish (US)
Pages (from-to)87-97
Number of pages11
JournalStudies in Computational Intelligence
Volume163
DOIs
StatePublished - Jan 1 2009
Externally publishedYes

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Lazy classification algorithms based on deterministic and inhibitory association rules'. Together they form a unique fingerprint.

Cite this