Inductive Logic Programming / Najlacnejšie knihy
Inductive Logic Programming

Code: 10929259

Inductive Logic Programming

by Katsumi Inoue, Hayato Ohwada, Akihiro Yamamoto

This book constitutes the thoroughly refereed post-conference proceedings of the 25th International Conference on Inductive Logic Programming, ILP 2015, held in Kyoto, Japan, in August 2015.§§The 14 revised papers presented were c ... more

55.93


Low in stock at our supplier
Shipping in 11 - 15 days

Potřebujete více kusů?Máte-li zájem o více kusů, prověřte, prosím, nejprve dostupnost titulu na naši zákaznické podpoře.


Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

More about Inductive Logic Programming

You get 135 loyalty points

Book synopsis

This book constitutes the thoroughly refereed post-conference proceedings of the 25th International Conference on Inductive Logic Programming, ILP 2015, held in Kyoto, Japan, in August 2015.§§The 14 revised papers presented were carefully reviewed and selected from 44 submissions. The papers focus on topics such as theories, algorithms, representations and languages, systems and applications of ILP, and cover all areas of learning in logic, relational learning, relational data mining, statistical relational learning, multi-relational data mining, relational reinforcement learning, graph mining, connections with other learning paradigms, among others.§

Book details

Book category Books in English Computing & information technology Databases Data mining

55.93

Trending among others



Collection points Bratislava a 12122 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: