Lazy Classification Algorithms Based on Deterministic and Inhibitory Association Rules
- 328 Downloads
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 S i , i ∈ Dec(T), where Dec(T) is the set of values of the decision attribute in T. For i ∈ Dec(T), the information system S i contains only objects (rows) of T with the value of the decision attribute equal to i.
Unable to display preview. Download preview PDF.