Inductive Logic Programming
Editat de Nada Lavra¿, Saso Dzeroskien Limba Engleză Paperback – 3 sep 1997
The volume presents revised versions of nine papers in long version and 17 short papers accepted after a thorough reviewing process. Also included are three invited papers by Usama Fayyad, Jean-Francois Puget, and Georg Gottlob. Among the topics addressed are various logic programming issues, natural language processing, speech processing, abductive learning, data mining, knowledge discovery, and relational database systems.
Preț: 322.61 lei
Preț vechi: 403.26 lei
-20% Nou
Puncte Express: 484
Preț estimativ în valută:
57.08€ • 66.50$ • 49.84£
57.08€ • 66.50$ • 49.84£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540635147
ISBN-10: 3540635149
Pagini: 328
Ilustrații: X, 318 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.5 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540635149
Pagini: 328
Ilustrații: X, 318 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.5 kg
Ediția:1997
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Knowledge discovery in databases: An overview.- On the complexity of some Inductive Logic Programming problems.- Inductive logic programming and constraint logic programming (abstract).- Learning phonetic rules in a speech recognition system.- Cautious induction in inductive logic programming.- Generating numerical literals during refinement.- Lookahead and discretization in ILP.- Data mining via ILP: The application of Progol to a database of enantioseparations.- Part-of-speech tagging using Progol.- Maximum Entropy modeling with Clausal Constraints.- Mining association rules in multiple relations.- Using logical decision trees for clustering.- Induction of Slovene nominal paradigms.- Normal forms for inductive logic programming.- On a sufficient condition for the existence of most specific hypothesis in progol.- Induction of logic programs with more than one recursive clause by analyzing saturations.- A logical framework for graph theoretical decision tree learning.- Learning with abduction.- Systematic Predicate Invention in Inductive Logic Programming.- Learning programs in the event calculus.- Distance between Herbrand interpretations: A measure for approximations to a target concept.- Realizing Progol by forward reasoning.- Probabilistic first-order classification.- Learning Horn definitions with equivalence and membership queries.- Using abstraction schemata in inductive logic programming.- Distance induction in first order logic.- Carcinogenesis predictions using ILP.- Discovery of first-order regularities in a relational database using ofine candidate determination.- Which hypotheses can be found with inverse entailment?.