Bounded Least General Generalization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00213332" target="_blank" >RIV/68407700:21230/13:00213332 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007/978-3-642-38812-5_9" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-642-38812-5_9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-38812-5_9" target="_blank" >10.1007/978-3-642-38812-5_9</a>
Alternative languages
Result language
angličtina
Original language name
Bounded Least General Generalization
Original language description
We study a generalization of Plotkin?s least general generalization. We introduce a novel concept called bounded least general generalization w.r.t. a set of clauses and show an instance of it for which polynomial-time reduction procedures exist. We demonstrate the practical utility of our approach in experiments on several relational learning datasets.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP103%2F10%2F1875" target="_blank" >GAP103/10/1875: Learning from Theories</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Inductive Logic Programming, 22nd International Conference, ILP 2012, Dubrovnik, Croatia, September 17-19, 2012, Revised Selected Papers
ISBN
978-3-642-38811-8
ISSN
0302-9743
e-ISSN
—
Number of pages
14
Pages from-to
116-129
Publisher name
Springer
Place of publication
Berlin
Event location
Dubrovnik
Event date
Sep 17, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—