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 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Delimata, P., Moshkov, M.J., Skowron, A., Suraj, Z. (2009). Lazy Classification Algorithms Based on Deterministic and Inhibitory Association Rules. In: Inhibitory Rules in Data Analysis. Studies in Computational Intelligence, vol 163. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85638-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-85638-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85637-5
Online ISBN: 978-3-540-85638-2
eBook Packages: EngineeringEngineering (R0)