Cantitate/Preț
Produs

Inductive Logic Programming

Editat de David Page
en Limba Engleză Paperback – 8 iul 1998
This book constitutes the refereed proceedings of the 8th International Conference on Inductive Logic Programming, ILP-98, held in Madison, Wisconsin, USA, in July 1998.
The 27 revised full papers presented together with the abstracts of three invited talks were carefully reviewed and selected for inclusion in the book. All relevant aspects of inductive logic programming are covered ranging from theory to implementations and applications.
Citește tot Restrânge

Preț: 32201 lei

Preț vechi: 40251 lei
-20% Nou

Puncte Express: 483

Preț estimativ în valută:
5697 6647$ 4981£

Carte tipărită la comandă

Livrare economică 17-31 ianuarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540647386
ISBN-10: 3540647384
Pagini: 316
Ilustrații: VIII, 308 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Attribute-value learning versus inductive logic programming: The missing links.- Advances in ILP theory and implementations.- Application of ILP to problems in chemistry and biology.- Relational reinforcement learning.- Learning first-order acyclic Horn programs from entailment.- Combining statistical and relational methods for learning in hypertext domains.- Application of inductive logic programming to discover rules governing the three-dimensional topology of protein structure.- Term comparisons in first-order similarity measures.- Stochastic propositionalization of non-determinate background knowledge.- A stochastic simple similarity.- Using prior probabilities and density estimation for relational classification.- Induction of Constraint Grammar-rules using Progol.- A hybrid approach to word segmentation.- Learning multilingual morphology with Clog.- Using ILP-systems for verification and validation of multi-agent systems.- Inducing shogi heuristics using inductive logic programming.- Repeat learning using predicate invention.- Normal programs and multiple predicate learning.- Strongly typed inductive concept learning.- Function-free Horn clauses are hard to approximate.- DOGMA: A GA-based relational learner.- Generalization under implication by ?-subsumption.- Prolog, refinements and RLGG's.- Learning structurally indeterminate clauses.- Completing Inverse Entailment.- Distances and limits on Herbrand interpretations.- Relational distance-based clustering.- A framework for defining distances between first-order logic objects.- Detecting traffic problems with ILP.- A comparison of ILP and propositional systems on propositional traffic data.