Inductive Logic Programming: 6th International Workshop, ILP-96, Stockholm, Sweden, August 26-28, 1996, Selected Papers: Lecture Notes in Computer Science, cartea 1314
Editat de Stephen Muggletonen Limba Engleză Paperback – 3 sep 1997
The 21 full papers were carefully reviewed and selected for inclusion in the book in revised version. Also included is the invited contribution "Inductive logic programming for natural language processing" by Raymond J. Mooney. Among the topics covered are natural language learning, drug design, NMR and ECG analysis, glaucoma diagnosis, efficiency measures for implementations and database interaction, program synthesis, proof encoding and learning in the absence of negative data, and least generalizations under implication ordering.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 338.16 lei
Preț vechi: 422.70 lei
-20% Nou
Puncte Express: 507
Preț estimativ în valută:
64.72€ • 66.76$ • 54.77£
64.72€ • 66.76$ • 54.77£
Carte tipărită la comandă
Livrare economică 05-19 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540634942
ISBN-10: 3540634940
Pagini: 412
Ilustrații: X, 402 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540634940
Pagini: 412
Ilustrații: X, 402 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Inductive logic programming for natural language processing.- An initial experiment into stereochemistry-based drug design using inductive logic programming.- Applying ILP to diterpene structure elucidation from 13C NMR spectra.- Analysis and prediction of piano performances using inductive logic programming.- Noise detection and elimination applied to noise handling in a KRK chess endgame.- Feature construction with inductive logic programming: A study of quantitative predictions of biological activity by structural attributes.- Polynomial-time learning in logic programming and constraint logic programming.- Analyzing and learning ECG waveforms.- Learning rules that classify ocular fundus images for glaucoma diagnosis.- A new design and implementation of progol by bottom-up computation.- Inductive logic program synthesis with DIALOGS.- Relational knowledge discovery in databases.- Efficient ?-subsumption based on graph algorithms.- Integrity constraints in ILP using a Monte Carlo approach.- Restructuring chain datalog programs.- Top-down induction of logic programs from incomplete samples.- Least generalizations under implication.- Efficient proof encoding.- Learning Logic programs with random classification noise.- Handling Quantifiers in ILP.- Learning from positive data.- ?-Subsumption and its application to learning from positive-only examples.