出版時(shí)間:2003-12 出版社:北京燕山出版社 作者:Horvath, Tamas; Yamamoto, Akihiro; Horvth, Tamas 頁(yè)數(shù):400
Tag標(biāo)簽:無(wú)
內(nèi)容概要
This book constitutes the refereed proceedings of the 13th International Conference on Inductive Logic Programming, ILP 2003, held in Szeged, Hungary in September/October 2003. The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. Among the topics addressed are multirelational data mining, complexity issues, theory revision, clustering, mathematical discovery, relational reinforcement learning, multirelational learning, inductive inference, description logics, grammar systems, and inductive learning.
書(shū)籍目錄
Invited Papers A Personal View of How Best to Apply ILP Agents that Reason and LearnResearch 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 ALog 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 DataAuthor Index
圖書(shū)封面
圖書(shū)標(biāo)簽Tags
無(wú)
評(píng)論、評(píng)分、閱讀與下載
Inductive Logic Programming 歸納邏輯編程 PDF格式下載
250萬(wàn)本中文圖書(shū)簡(jiǎn)介、評(píng)論、評(píng)分,PDF格式免費(fèi)下載。 第一圖書(shū)網(wǎng) 手機(jī)版