Post-Processing of Data Mining Results

  • Oded Maimon
  • Mark Last
Chapter
Part of the Massive Computing book series (MACO, volume 1)

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:
$$ w_z^{ij} = P({V_{ij;}}z) \bullet \log \frac{{P({V_{ij}}/z)}}{{P({V_{ij}})}} $$

Keywords

Mutual Information Hide Node Terminal Node Connection Weight Target Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Oded Maimon
    • 1
  • Mark Last
    • 2
  1. 1.Tel-Aviv UniversityTel-AvivIsrael
  2. 2.University of South FloridaTampaUSA

Personalised recommendations