One-sided instance-based boundary sets

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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 useful1 version-space representations for instance retraction. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Smirnov, E. N., Sprinkhuizen-Kuyper, I. G., & Van Den Herik, H. J. (2004). One-sided instance-based boundary sets. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2682, 270–288. https://doi.org/10.1007/978-3-540-44497-8_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free