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.
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.
References
Butz, C.J., Yan, W., Yang, B.: An Efficient Algorithm for Inference in Rough Set Flow Graphs. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS (LNAI), vol. 4100, pp. 102–122. Springer, Heidelberg (2006)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Inc., New York (1991)
Chitcharone, D., Pattaraintakorn, P.: Towards Theories of Fuzzy Set and Rough Set to Flow Graphs. In: The 2008 IEEE World Congress on Computational Intelligence, pp. 1675–1682. IEEE Press, Hong Kong (2008)
Kostek, B., Czyzewski, A.: Processing of Musical Metadata Employing Pawlak’s Flow Graphs. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B.z., Świniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS (LNAI), vol. 3100, pp. 279–298. Springer, Heidelberg (2004)
Mitchell, T.M.: Machine Learning. McGraw-Hill Higher Education, New York (1997)
Pattaraintakorn, P., Cercone, N., Naruedomkul, K.: Rule Learning: Ordinal Prediction Based on Rough Set and Soft-Computing. Appl. Math. Lett. 19(12), 1300–1307 (2006)
Pawlak, Z.: Rough Sets. In: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Pawlak, Z.: In Pursuit of Patterns in Data Reasoning from Data–the Rough Set Way. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 1–9. Springer, Heidelberg (2002)
Pawlak, Z.: Decision Algorithms and Flow Graphs: a Rough Set Approach. J. of Telecom. and Inform. Tech. 3, 98–101 (2003)
Pawlak, Z.: Some Remarks on Conflict Analysis. European J. of Oper. Res. 166, 649–654 (2005)
Pawlak, Z.: Decision Trees and Flow Graphs. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS (LNAI), vol. 4259, pp. 1–11. Springer, Heidelberg (2006)
Shannon, C.E.: A Mathematical Theory of Communication. AT&T Tech. J. 27, 379–423, 623–656 (1948)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pattaraintakorn, P. (2009). Entropy Measures of Flow Graphs with Applications to Decision Trees. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_78
Download citation
DOI: https://doi.org/10.1007/978-3-642-02962-2_78
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02961-5
Online ISBN: 978-3-642-02962-2
eBook Packages: Computer ScienceComputer Science (R0)