Lazy classification algorithms based on deterministic and inhibitory association rules

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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.

Original languageEnglish (US)
Title of host publicationInhibitory Rules in Data Analysis
Subtitle of host publicationA Rough Set Approach
Pages87-97
Number of pages11
Volume163
DOIs
StatePublished - 2009
Externally publishedYes

Publication series

NameStudies in Computational Intelligence
Volume163
ISSN (Print)1860-949X

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this