Abstract
The appraisement of rules and rule sets is very important in data mining. The information content of rules is discussed in this paper and is categorized into inner mutual information and outer impartation information. We put forward the viewpoint that the outer impartation information content of rules and rule sets can be represented by relations from input universe to output universe. Then, the interaction of rules in a rule set can be represented by the union and intersection of binary relations expediently. Based on the entropy of relations, the outer impartation information content of rules and rule sets are well measured. Compared with the methods which appraise rule sets by their overall performance (accuracy, error rate) on the given test data sets, the outer impartation information content of rule sets is more objective and convenient because of the absence of test data sets.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Yao, Y.Y., Zhong, N.: An analysis of quantitative measures associated with rules. In: Proceedings of Pacific-Aisa Conference on Knowledge Discovery and Data Mining, pp. 479–488 (1999)
Hilderman, R.J., Hamilton, H J.: Knowledge Discovery and Measures of interest. Kluwer Academic Publishers, Dordrecht (2001)
Ohsaki, M., Sato, Y.: Investigation of rule interestingness in medical data mining. In: Tsumoto, S., Yamaguchi, T., Numao, M., Motoda, H. (eds.) AM 2003. LNCS (LNAI), vol. 3430, Springer, Heidelberg (2005)
Balaji, P., Alexander, T.: Unexpectedness as a measure of interestingness in knowledge discovery. Decision Support Systems 27, 303–318 (1999)
Liu, B., Hsu, W.: Post-Analysis of learned rules. In: proceedings of AAAI, pp. 828–834 (1996)
Ailberschatz, A., Tuzhilin, A.: What makes patterns interesting in knowledge discovery systems. IEEE Transact on knowledge and Data Engineer 8(6), 970–974 (1996)
Ohsaki, M., Sato, Y.: Evaluation of rule interestingness measures with a clinical data set on hepatitis. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, Springer, Heidelberg (2004)
Hamilton, H.J., Shan, N.: Machine Learning of credible classifications. In: Proceedings of Australian Conference on Artificial Intelligence, pp. 330–339 (1997)
Shapiro, G.S.: Discovery, analysis and presentation of strong Rules. Knowledge Discovery in Databases, AAAI/MIT press, pp. 229–248 (1991)
Gago, P., Bento, C.: A metric for selection of the most promising rules. In: Proceedings of European Conference on the Principle of Data Ming and Knowledge Discovery, pp. 19–27 (1998)
Zhong, N., Yao, Y.Y.: Peculiarity oriented multi-database mining. In: Proceedings of European Conference on Principles of data Mining and Knowledge Discovery, pp. 136–146 (1999)
Hamilton, H.J., Fudger, D.F.: Estimationg DBLearn’s potential for knowledge discovery in databases. Computational Intelligence 11(2), 280–296 (1995)
Symth, P., Goodman, R.M.: Rule induction using information theory. Knowledge Discovery in Databases, AAAI/MIT press (1991)
Shore, J.E., Johnson, R.W.: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy. IEEE transactions on Information Theory 26(1), 26–37 (1980)
Hu, D., Li, H.X.: The entropy of relations and a new approach for decision tree learning. In: Wang, L., Jin, Y. (eds.) FSKD 2005. LNCS (LNAI), vol. 3614, pp. 378–388. Springer, Heidelberg (2005)
Castro, J.L., Castro-Schez, J.J.: Learning maximal structure rules in fuzzy logic for knowledge acquisition in expert systems. Fuzzy Sets and Systems 101, 331–342 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, D., Feng, Y. (2007). The Outer Impartation Information Content of Rules and Rule Sets. In: Yin, H., Tino, P., Corchado, E., Byrne, W., Yao, X. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2007. IDEAL 2007. Lecture Notes in Computer Science, vol 4881. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77226-2_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-77226-2_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77225-5
Online ISBN: 978-3-540-77226-2
eBook Packages: Computer ScienceComputer Science (R0)