Abstract
One of the most important problems in rule induction methods is how to estimate which method is the best to use in an applied domain. While some methods are useful in some domains, they are not useful in other domains. Therefore it is very difficult to choose one of these methods. For this purpose, we introduce multiple testing based on recursive iteration of resampling methods for rule-induction (MULT-RECITE-R). We applied this MULT-RECITE-R method to monk datasets in UCI data repository. The results show that this method gives the best selection of estimation methods in almost the all cases.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Clark, P., Niblett, T.: The CN2 Induction Algorithm. Machine Learning 3, 261–283 (1989)
Efron, B.: How biased is the apparent error rate of a prediction rule? J. Amer. Statist. Assoc. 82, 171–200 (1986)
Efron, B., Tibshirani, R.: An Introduction to the Bootstrap. Chapman and Hall, London (1994)
McLachlan, G.J.: Discriminant Analysis and Statistical Pattern Recognition. John Wiley and Sons, New York (1992)
Michalski, R.S.: A Theory and Methodology of Machine Learning. In: Michalski, R.S., Carbonell, J.G., Mitchell, T.M. (eds.) Machine Learning - An Artificial Intelligence Approach. Morgan Kaufmann, Palo Alto (1983)
Michalski, R.S., et al.: The Multi-Purpose Incremental Learning System AQ15 and its Testing Application to Three Medical Domains. In: Proceedings of AAAI 1986, pp. 1041–1045. AAAI Press, Palo Alto (1986)
Murphy, P.M., Aha, D.W.: UCI Repository of machine learning databases [Machine-readable data repository]. University of California, Department of Information and Computer Science, Irvine
Quinlan, J.R.: C4.5 - Programs for Machine Learning. Morgan Kaufmann, CA (1993)
Schaffer, C.: Overfitting Avoidance as Bias. Machine Learning 10, 153–178 (1993)
Schaffer, C.: Selecting a Classification Method by Cross-Validation. Machine Learning 13, 135–143 (1993)
Thrun, S.B., et al.: The Monk’s Problems- A performance Comparison of Different Learning algorithms. Technical Report CS-CMU-91-197, Carnegie Mellon University (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Tsumoto, S., Hirano, S., Abe, H. (2010). Automated Empirical Selection of Rule Induction Methods Based on Recursive Iteration of Resampling Methods. In: Shi, Z., Vadera, S., Aamodt, A., Leake, D. (eds) Intelligent Information Processing V. IIP 2010. IFIP Advances in Information and Communication Technology, vol 340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16327-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-16327-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16326-5
Online ISBN: 978-3-642-16327-2
eBook Packages: Computer ScienceComputer Science (R0)