Knowledge representation for inductive learning

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

Abstract

Traditionally, inductive learning algorithms such as decision tree learners have employed attribute-value representations, which are essentially propositional. While learning in rst-order logic has been studied for almost 20 years, this has mostly resulted in completely new learning algorithms rather than rst-order upgrades of propositional learning algorithms. To re-establish the link between propositional and first-order learning, we have to focus on individual-centered representations. This short paper is devoted to the nature of first-order individual-centered representations for inductive learning. I discuss three possible perspectives: representing individuals as Herbrand interpretations, representing datasets as an individual-centered database, and representing individuals as terms.

Cite

CITATION STYLE

APA

Flach, P. A. (1999). Knowledge representation for inductive learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1638, pp. 160–167). Springer Verlag. https://doi.org/10.1007/3-540-48747-6_15

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