Abstract
The principle of discernibility matrix serves as a tool to discuss and analyze two algerithms of traditional inductive machine learning, AQ11 and ID3. The results are: (1) AQ11 and its family can be completely specified by the principle of discernibility matrix; (2) ID3 can be partly, but not naturally, specified by the principle of discernibility matrix; and (3) The principle of discernibility matrix is employed to analyze Cendrowska sample set, and it shows the weaknesses of knowledge representation style of decision tree in theory.
Similar content being viewed by others
References
Michalski R S, Chilausky R L. Learning by being told and learning from examples: An experimental comparison of two methods of knowledge acquisition in context of developing on expert system for soybean disease diagnosis.Policy Analysis and Information Systems, June 1980, 4(2): 125–150.
Quinlan J. Induction of decision trees.Machine Learning, 1, 1986, pp. 81–106.
Guo M, Wang J. Data mining and database knowledge discovery: Summary.Pattern Recognition and Artificial Intelligence, 1998, 11(3): 292–299.
Skowron A, Rauszer C. The Discernibility Matrices and Functions in Information Systems. In Intelligent Decision Support—Handbook of Applications and Advances of the Rough Sets Theory, Slowinski R (ed.), 1991., pp 331–362.
Hong J. Inductive Machine Learning—Algorithms. In Theory and Application, Beijing: Science Press, 1997.
Hunt E B, Marin J, Stone P J. Experiments in Induction. New York: Academic Press, 1966.
Cendrowska J. PRISM: An algorithm for inducing modular rules. In Knowledge Acquisition Tools for Expent Systems, Boose J, Gaines B (eds.), Academic Press, 1988, 1: 255–276.
Lu R. Artificial Intelligence. Beijing: Science Press, 1996.
Pawlak Z. Rough Set—Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dorderecht, Boston, London, 1991.
Polkowski L, Skowron A. Rough, sets: perspectives. In Rough Sets in Knowledge Discovery 1, Polkowski L, Skowron A (eds.), Physica-Verlag, 1998, 1: 1–27.
Zhang B, Zhang L. Problem Solving Theory and Application. Beijing: Tsinghua Univ. Press. 1990.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research is partly supported by the National ‘863’ High-Tech Programme (No. 863-306-ZT06-07-1) and NKPSF (G1998030508).
WANG Jue is a professor at Institute of Automation, the Chinese Academy of Sciences, and IEEE Senior Member. His research interests are knowledge representation, ANN, GA, multi-agent system, machine learning and data mining.
CUI Jia received her B.S. degree from University of Science and Technology of China in 1997. She is currently an M.S. candidate at Institute of Automation, the Chinese Academy of Sciences. Her research interests are rough sets, association rules.
ZHAO Kai received his B.S. degree from Beijing Institute of Technology in 1993, and Ph.D. degree from Institute of Automation, the Chinese Academy of Sciences in 1999. His research interests are adaptation systems, genetic programming and data mining.
Rights and permissions
About this article
Cite this article
Wang, J., Cui, J. & Zhao, K. Investigation on AQ11, ID3 and the principle of discernibility matrix. J. Comput. Sci. & Technol. 16, 1–12 (2001). https://doi.org/10.1007/BF02948848
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948848