License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2012.14
URN: urn:nbn:de:0030-drops-36049
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3604/
Go to the corresponding LIPIcs Volume Portal


Blockeel, Hendrik ; Bogaerts, Bart ; Bruynooghe, Maurice ; De Cat, Broes ; De Pooter, Stef ; Denecker, Marc ; Labarre, Anthony ; Ramon, Jan ; Verwer, Sicco

Modeling Machine Learning and Data Mining Problems with FO(·)

pdf-format:
4.pdf (0.5 MB)


Abstract

This paper reports on the use of the FO(·) language and the IDP framework for modeling and solving some machine learning and data mining tasks. The core component of a model in the IDP framework is an FO(·) theory consisting of formulas in first order logic and definitions; the latter are basically logic programs where clause bodies can have arbitrary first order formulas. Hence, it is a small step for a well-versed computer scientist to start modeling. We describe some models resulting from the collaboration between IDP experts and domain experts solving machine learning and data mining tasks. A first task is in the domain of stemmatology, a domain of philology concerned with the relationship between surviving variant versions of text. A second task is about a somewhat similar problem within biology where phylogenetic trees are used to represent the evolution of species. A third and final task is about learning a minimal automaton consistent with a given set of strings. For each task, we introduce the problem, present the IDP code and report on some experiments.

BibTeX - Entry

@InProceedings{blockeel_et_al:LIPIcs:2012:3604,
  author =	{Hendrik Blockeel and Bart Bogaerts and Maurice Bruynooghe and Broes De Cat and Stef De Pooter and Marc Denecker and Anthony Labarre and Jan Ramon and Sicco Verwer},
  title =	{{Modeling Machine Learning and Data Mining Problems with FO(·)}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{14--25},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Agostino Dovier and V{\'i}tor Santos Costa},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3604},
  URN =		{urn:nbn:de:0030-drops-36049},
  doi =		{10.4230/LIPIcs.ICLP.2012.14},
  annote =	{Keywords: Knowledge representation and reasoning, declarative modeling, logic programming, knowledge base systems, FO(·), IDP framework, stemmatology, phylogene}
}

Keywords: Knowledge representation and reasoning, declarative modeling, logic programming, knowledge base systems, FO(·), IDP framework, stemmatology, phylogene
Collection: Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)
Issue Date: 2012
Date of publication: 05.09.2012


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI