Abstract
Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided instance-based boundary sets. They are correct and efficiently computable representations for admissible concept languages. Compared to other representations, they are the most efficient useful version-space representations for instance retraction.
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
Haussler, D.: Quantifying Inductive Bias: AI Learning Algorithms and Valiants Learning Framework. Artificial Intelligence 36, 177–221 (1988)
Hirsh, H.: Polynomial-Time Learning with Version Spaces. In: Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 117–122. AAAI Press, Menlo Park (1992)
Hirsh, H., Mishra, N., Pitt, L.: Version Spaces without Boundary Sets. In: Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 491–496. AAAI Press, Menlo Park (1997)
Idemstam-Almquist, P.: Demand Networks: An Alternative Representation of Version Spaces. Master’s Thesis, Department of Computer Science and Systems Sciences, Stockholm University, Stockholm, Sweden (1990)
De Raedt, L.: Query Evaluation and Optimisation for Inductive Databases using Version Spaces. In: Online Proceedings of the International Workshop on Database Technologies for Data Mining, Prague, Czech Republic (2002)
De Raedt, L., Jaeger, M., Lee, S., Mannila, H.: A Theory of Inductive Query Answering. In: Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 123–128. IEEE Publishing, Los Alamitos (2002)
Mitchell, T.: Version Spaces: An Approach to Concept Learning. Ph.D. Thesis, Electrical Engineering Department, Stanford Univeristy, Stanford, CA (1978)
Mitchell, T.: Machine Learning. McGraw-Hill, New York (1997)
Sablon, G., De Raedt, L., Bruynooghe, L.: Iterative Versionspaces. Artificial Intelligence 69, 393–410 (1994)
Sebag, M., Rouveirol, C.: Resource-bounded Relational Reasoning: Induction and Deduction through Stochastic Matching. Machine Learning 38, 41–62 (2000)
Smirnov, E.N.: Conjunctive and Disjunctive Version Spaces with Instance-Based Boundary Sets. Ph.D. Thesis, Department of Computer Science, Universiteit Maastricht, Maastricht, The Netherlands (2001)
Smirnov, E.N., Braspenning, P.J.: Version Space Learning with Instance-Based Boundary Sets. In: Proceedings of The Thirteenth European Conference on Artificial Intelligence, pp. 460–464. John Wiley and Sons, Chichester (1998)
Smith, B.D., Rosenbloom, P.S.: Incremental Non-Backtracking Focusing: A Polynomially Bounded Generalization Algorithm for Version Spaces. In: Proceedings of the Eight National Conference on Artificial Intelligence, pp. 848–853. MIT Press, MA (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Smirnov, E.N., Sprinkhuizen-Kuyper, I.G., van den Herik, H.J. (2004). One-Sided Instance-Based Boundary Sets. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds) Database Support for Data Mining Applications. Lecture Notes in Computer Science(), vol 2682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44497-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-44497-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22479-2
Online ISBN: 978-3-540-44497-8
eBook Packages: Springer Book Archive