Abstract
The paper considers conjunctive and disjunctive version spa- ce learning as an incomplete search in complete hypotheses spaces. The incomplete search is guided by preference biases which are implemented by procedures based on the instance-based boundary sets representation of version spaces. The conditions for tractability of this representation are defined. As a result we propose to use instance-based boundary sets as a basis for the computationally feasible application of preference biases to version spaces.
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 (1988) 177–221
Lavrac, N., Dzerovski, S.: Inductive Logic Programming: Techniques and Applications. Ellis Horwood, New York (1994)
Michalski, R.S, Tecuci, G.: Machine Learning: A Multistrategy Approach. Morgan Kaufmann, San Francisco (1994)
Mitchell, T.: Machine Learning. McGraw-Hill (1997)
Sebag, M., Rouveirol, C.: Tractable Induction and Classification in First Order Logic via Stochastic Matching. In: Proceedings of The International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Mateo (1997) 888–893
Smirnov, E. N., Braspenning, P.J.: Version Space Learning with Instance-Based Boundary Sets. In: Proceedings of The European Conference on Artificial Intelligence. Jonh Willey and Sons, Chichester (1998) 460–464
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smirnov, E.N., van den Herik, H.J. (2000). Applying Preference Biases to Conjunctive and Disjunctive Version Spaces. In: Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2000. Lecture Notes in Computer Science, vol 1904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45331-8_31
Download citation
DOI: https://doi.org/10.1007/3-540-45331-8_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41044-7
Online ISBN: 978-3-540-45331-4
eBook Packages: Springer Book Archive