Watson, P. (1999) Inductive Learning with Corroboration. In: Watanabe, O. and Yokomori, T., eds. Algorithmic Learning Theory, Proceedings of the 10th International Conference. Lecture Notes in Artificial Intelligence, 1720. Springer Verlag pp. 145-156. ISBN 3-540-66748-2.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
The basis of inductive learning is the process of generating and refuting hypotheses. Natural approaches to this form of learning assume that a data item that causes refutation of one hypothesis opens the way for the introduction of a new (for now unrefuted) hypothesis, and so such data items have attracted the most attention. Data items that do not cause refutation of the current hypothesis have until now been largely ignored in these processes, but in practical learning situations they play the key role of em corroborating those hypotheses that they do not refute. We formalise a version of K.R. Popper's concept of em degree of corroboration for inductive inference and utilise it in an inductive learning procedure which has the natural behaviour of outputting the most strongly corroborated (non-refuted) hypothesis at each stage. We demonstrate its utility by providing characterisations of several of the commonest identification types in the case of learning from text over class-preserving hypothesis spaces and proving the existence of canonical learning strategies for these types. In many cases we believe that these characterisations make the relationships between these types clearer than the standard characterisations. The idea of learning with corroboration therefore provides a unifying approach for the field.
|Item Type:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||Degree of corroboration, inductive inference; philosophy of science|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||03 Sep 2009 09:00|
|Last Modified:||21 May 2011 23:50|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/21723 (The current URI for this page, for reference purposes)|
- Depositors only (login required):