Entropy Measures of Flow Graphs with Applications to Decision Trees

  • Authors:
  • Puntip Pattaraintakorn

  • Affiliations:
  • Department of Mathematics and Computer Science, Faculty of Science, King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand 10520

  • Venue:
  • RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Entropy is a fundamental principle in many disciplines such as information theory, thermodynamics, and more recently, artificial intelligence. In this article, a measure of entropy on Pawlak's mathematical flow graph is introduced. The predictability and quality of a flow graph can be derived directly from the entropy. An application to decision tree generation from a flow graph is examined. In particular, entropy measures on flow graphs lead to a new methodology of reasoning from data and shows rigorous relationships between flow graphs, entropy and decision trees.