04682nam 22007575 450 99646580000331620200701202804.03-540-39917-810.1007/b13700(CKB)1000000000212199(SSID)ssj0000323942(PQKBManifestationID)11285440(PQKBTitleCode)TC0000323942(PQKBWorkID)10318949(PQKB)10768884(DE-He213)978-3-540-39917-9(MiAaPQ)EBC3087700(PPN)15518198X(EXLCZ)99100000000021219920121227d2003 u| 0engurnn|008mamaatxtccrInductive Logic Programming[electronic resource] 13th International Conference, ILP 2003, Szeged, Hungary, September 29 - October 1, 2003, Proceedings /edited by Tamas Horváth, Akihiro Yamamoto1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (X, 406 p.) Lecture Notes in Artificial Intelligence ;2835Bibliographic Level Mode of Issuance: Monograph3-540-20144-0 Includes bibliographical references at the end of each chapters and index.Invited 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.Lecture Notes in Artificial Intelligence ;2835Software engineeringArtificial intelligenceComputer scienceComputer programmingMathematical logicSoftware Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Computer Science, generalhttps://scigraph.springernature.com/ontologies/product-market-codes/I00001Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Software engineering.Artificial intelligence.Computer science.Computer programming.Mathematical logic.Software Engineering/Programming and Operating Systems.Artificial Intelligence.Computer Science, general.Programming Techniques.Mathematical Logic and Formal Languages.05.115Horváth Tamasedthttp://id.loc.gov/vocabulary/relators/edtYamamoto Akihiroedthttp://id.loc.gov/vocabulary/relators/edtILP (Conference)MiAaPQMiAaPQMiAaPQBOOK996465800003316Inductive Logic Programming772244UNISA