Abstract
In the information-theoretic network (see Chapter 3 above), each connection between a terminal (unsplit / final layer) node and a target node represents a probabilistic rule between a conjunction of input attribute-values and a target value. An information-theoretic weight of each rule is given by:
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Maimon, O., Last, M. (2001). Post-Processing of Data Mining Results. In: Knowledge Discovery and Data Mining. Massive Computing, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3296-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3296-2_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4842-7
Online ISBN: 978-1-4757-3296-2
eBook Packages: Springer Book Archive