Entropy

Entropy at a given node t:

(NOTE: p( j | t) is the relative frequency of class j at node t).

  • Measures homogeneity of a node.
  • Maximum (log nc) when records are equally distributed among all classes implying least information
  • Minimum (0.0) when all records belong to one class, implying most information
  • Entropy based computations are similar to the GINI index computations

Download di link berikut
Tugas Entropi (Arman)

Advertisement

~ by theagroupofbi on November 26, 2009.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Connecting to %s

 
Follow

Get every new post delivered to your Inbox.