Multi-relational data mining, using UML for ILP

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Although there is a growing need for multi-relational data mining solutions in KDD, the use of obvious candidates from the field of Inductive Logic Programming (ILP) has been limited. In our view this is mainly due to the variation in ILP engines, especially with respect to input specification, as well as the limited attention for relational database issues. In this paper we describe an approach which uses UML as the common specification language for a large range of ILP engines. Having such a common language will enable a wide range of users, including non-experts, to model problems and apply different engines without any extra effort. The process involves transformation of UML into a language called CDBL, that is then translated to a variety of input formats for different engines.

Cite

CITATION STYLE

APA

Knobbe, A. J., Siebes, A., Blockeel, H., & Van Der Wallen, D. (2000). Multi-relational data mining, using UML for ILP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1910, pp. 1–12). Springer Verlag. https://doi.org/10.1007/3-540-45372-5_1

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