Abstract
Computational knowledge discovery can be considered to be a complicated human activity concerned with searching for something new from data with computer systems. The optimization of theentire process of computational knowledge discovery is a big challenge in computer science. If we had an atlas of hypothesis classes which describes prior and basic knowledge on relative relationship between the hypothesis classes, it would be helpful in selecting hypothesis classes to be searched in discovery processes. In this paper, to give a foundation for an atlas of various classes of hypotheses, we have defined a measure of approximation of a hypothesis class C 1 to another class C 2. The hypotheses we consider here are restricted to m-ary Boolean functions. For 0 ≤ ∈ ≤ 1, we say that C 1 is (1-∈)-approximated to C 2 if, for every distribution Dover (0, 1)m, and for each hypothesis h 1 ∈ C 1, there exists a hypothesis h 2 ∈ C 2 such that, with the probability at most ∈, we have h 1 x) ≠ h 2 x) where x ∈ { 0, 1 } m is drawn randomly and independently according to D. Thus, we can use the approximation ratio of C 1 to C 2 as an index of how similar C 1 is to C 2. We discuss lower bounds of the approximation ratios among representative classes of hypotheses like decision lists, decision trees, linear discriminant functions and so on. This prior knowledge would come in useful when selecting hypothesis classes in the initial stage and the sequential stages involved in the entire discovery process.
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
Brachman, R., and Anand, T. The process of human-centered approach. In Advances in Knowledge Discovery and Data Mining. AAAI Press, 1996, pp. 37–58.
Cheeseman, P., and Stutz, J. Bayesian classification (AutoClass): Theory and results. In Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press, 1996.
Duda, R. O., Hart, P. E., and Stork, D. G. Pattern Classification, second ed. John Wiley & Sons, Inc, 2001.
Fayyad, U., Piatetsky-Shapiro, G., and Smyth, P. From data mining to knowledge discovery in databases.AI Magazine 17, 3 (1996), 37–54.
Kearns, M. J., and Vazirani, U. V. An Introduction to Computational Learning Theory. The MIT Press, 1994.
Langley, P. The computer-aided discovery of scientific knowledge. In Discovery Science (1998), vol. 1532 of Lecture Notes in Artificial Intelligence, pp. 25–39.
Maruyama, O., and Miyano, S. Design aspects of discovery systems. IEICE Transactions on Information and Systems E83-D (2000), 61–70.
Munakata, T. Knowledge discovery. Commun. ACM 42 (1999), 26–29.
Natarajan, B. K. Machine Learning: A Theoretical Approach. Morgan Kaufmann Publishers, Inc., 1991.
Quinlan, J. Induction of decision trees. Machine Learning 1 (1986), 81–106.
Valdés-Pérez, R. Principles of human computer collaboration for knowledge discovery. Artificial Intelligence 107 (1999), 335–346.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maruyama, O., Shoudai, T., Miyano, S. (2002). Toward Drawing an Atlas of Hypothesis Classes: Approximating a Hypothesis via Another Hypothesis Model. In: Lange, S., Satoh, K., Smith, C.H. (eds) Discovery Science. DS 2002. Lecture Notes in Computer Science, vol 2534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36182-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-36182-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00188-1
Online ISBN: 978-3-540-36182-4
eBook Packages: Springer Book Archive