000 | 03815nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-39917-9 | ||
003 | DE-He213 | ||
005 | 20240423132540.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540399179 _9978-3-540-39917-9 |
||
024 | 7 |
_a10.1007/b13700 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
072 | 7 |
_aUMZ _2thema |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aInductive Logic Programming _h[electronic resource] : _b13th International Conference, ILP 2003, Szeged, Hungary, September 29 - October 1, 2003, Proceedings / _cedited by Tamas Horváth, Akihiro Yamamoto. |
250 | _a1st ed. 2003. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
300 |
_aX, 406 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v2835 |
|
505 | 0 | _aInvited Papers -- A Personal View of How Best to Apply ILP -- Agents that Reason and Learn -- Research Papers -- Mining Model Trees: A Multi-relational Approach -- Complexity Parameters for First-Order Classes -- A Multi-relational Decision Tree Learning Algorithm – Implementation and Experiments -- Applying Theory Revision to the Design of Distributed Databases -- Disjunctive Learning with a Soft-Clustering Method -- ILP for Mathematical Discovery -- An Exhaustive Matching Procedure for the Improvement of Learning Efficiency -- Efficient Data Structures for Inductive Logic Programming -- Graph Kernels and Gaussian Processes for Relational Reinforcement Learning -- On Condensation of a Clause -- A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting -- Comparative Evaluation of Approaches to Propositionalization -- Ideal Refinement of Descriptions in -Log -- Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms? -- Improved Distances for Structured Data -- Induction of Enzyme Classes from Biological Databases -- Estimating Maximum Likelihood Parameters for Stochastic Context-Free Graph Grammars -- Induction of the Effects of Actions by Monotonic Methods -- Hybrid Abductive Inductive Learning: A Generalisation of Progol -- Query Optimization in Inductive Logic Programming by Reordering Literals -- Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data -- Relational IBL in Music with a New Structural Similarity Measure -- An Effective Grammar-Based Compression Algorithm for Tree Structured Data. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aMachine theory. | |
650 | 1 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aComputer Science. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
700 | 1 |
_aHorváth, Tamas. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aYamamoto, Akihiro. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540201441 |
776 | 0 | 8 |
_iPrinted edition: _z9783662186466 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v2835 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b13700 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188988 _d188988 |