ON Case-Based Representability and Learnability of Languages ?
- Within the present paper we investigate case-based representability as well as case-based learnability of indexed families of uniformly recursive languages. Since we are mainly interested in case-based learning with respect to an arbitrary fixed similarity measure, case-based learnability of an indexed family requires its representability, first. We show that every indexed family is case- based representable by positive and negative cases. If only positive cases are allowed the class of representable families is comparatively small. Furthermore, we present results that provide some bounds concerning the necessary size of case bases. We study, in detail, how the choice of a case selection strategy influences the learning capabilities of a case-based learner. We define different case selection strategies and compare their learning power to one another. Furthermore, we elaborate the relations to Gold-style language learning from positive and both positive and negative examples.
|Author:||Christoph Globig, Steffen Lange|
|URN (permanent link):||urn:nbn:de:hbz:386-kluedo-906|
|Language of publication:||English|
|Year of Completion:||1994|
|Year of Publication:||1994|
|Publishing Institute:||Technische Universität Kaiserslautern|
|Date of the Publication (Server):||2000/04/03|
This work has been supported by the Deutsche Forschungsgemeinschaft (DFG) within the project Ind-Cbl.
|Faculties / Organisational entities:||Fachbereich Informatik|
|DDC-Cassification:||0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik|
|Licence (German):||Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011|