the proceedings contain 28 papers. the topics discussed include: probabilistic relational learning and inductivelogicprogramming at a global scale;practical probabilistic programming;learning multi-class theories in...
ISBN:
(纸本)9783642212949
the proceedings contain 28 papers. the topics discussed include: probabilistic relational learning and inductivelogicprogramming at a global scale;practical probabilistic programming;learning multi-class theories in ilp;a numerical refinement operator based on multi-instance learning;not far away from home: a relational distance-based approach to understanding images of houses;approximate inference for logic programs with annotated disjunctions;approximate Bayesian computation for the parameters of PRISM programs;probabilistic rule learning;interactive discriminative mining of chemical fragments;MMRF for proteome annotation applied to human protein disease prediction;multivariate prediction for learning on the semantic web;hypothesizing about causal networks with positive and negative effects by meta-level abduction;BET: an inductivelogicprogramming workbench;and seeing the world through homomorphism: an experimental study on reducibility of examples.
the proceedings contain 24 papers. the topics discussed include: knowledge-directed theory revision;towards clausal discovery for stream mining;on the relationship between logical Bayesian networks and probabilistic l...
ISBN:
(纸本)364213839X
the proceedings contain 24 papers. the topics discussed include: knowledge-directed theory revision;towards clausal discovery for stream mining;on the relationship between logical Bayesian networks and probabilistic logicprogramming based on the distribution semantics;induction of relational algebra expressions;a logic-based approach to relation extraction from texts;discovering rules by meta-level abduction;inductive generalization of analytically learned goal hierarchies;nonmonotonic onto-relational learning;cp-logictheory inference with contextual variable elimination and comparison to BDD based inference methods;speeding up inference in statistical relational learning by clustering similar query literals;an inductivelogicprogramming approach to validate hexose binding biochemical knowledge;boosting first-order clauses for large, skewed data sets;and transfer learning via relational templates.
the proceedings contain 20 papers. the topics discussed include: building theories of the world: human and machine learning perspectives;SRL without tears: an ilp perspective;semantic web meets ilp: unconsumated love,...
ISBN:
(纸本)3540859276
the proceedings contain 20 papers. the topics discussed include: building theories of the world: human and machine learning perspectives;SRL without tears: an ilp perspective;semantic web meets ilp: unconsumated love, or no love lost?;learning expressive models of gene regulation;information overload and FP7 funding opportunities in 2009-10;a model to study phase transition and plateaus in relational learning;top-down induction of relational model trees in multi-instance learning;challenges in relational learning for real-time systems applications;discriminative structure learning of Markov logic networks;an experiment in robot discovery withilp;using the bottom clause and mode declarations on FOL theory revision from examples;DL-FOIL: concept learning in description logics;feature discovery with type extension trees;and feature construction using theory-guided sampling and randomised search.
Weather forecasting is important for saving lives, protecting property, and supporting economic activities. It provides timely warnings for severe weather, improves agricultural planning, and aids in disaster manageme...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Weather forecasting is important for saving lives, protecting property, and supporting economic activities. It provides timely warnings for severe weather, improves agricultural planning, and aids in disaster management. Neural networks and deep learning methods can achieve impressive accuracy in weather prediction, but their black-box nature lacks in explainability. To address this limitation, we investigated the potential of FastLAS, an inductivelogicprogramming (ilp) framework, to produce reliable and, more important, explainable weather predictions. FastLAS learns ASP programs whose syntax and structural semantics resemble natural human language, making them easily understandable and interpretable by humans. the supportedness of stable models allows a clear explanation of the predictions. Our empirical evaluation on data from an Italian weather forecasting center shows that our approach is capable of learning predictive models from small dataset (a few samples instead of the thousands needed by neural networks) achieving an accuracy higher than statistical machine learning base lines.
inductivelogicprogramming (ilp) systems use logicprogramming languages like Prolog as computational models. Expressivity of these languages is often built on fixed Herbrand vocabulary, thus requires encoding a...
详细信息
In this paper we investigate the lack of reliability and consistency of those binary rule learners in ilpthat employ the one-vs-rest binarisation technique when dealing with multi-class domains. We show that we can l...
详细信息
ISBN:
(纸本)9783642212949;9783642212956
In this paper we investigate the lack of reliability and consistency of those binary rule learners in ilpthat employ the one-vs-rest binarisation technique when dealing with multi-class domains. We show that we can learn a simple, consistent and reliable multi-class theory by combining the rules of the multiple one-vs-rest theories into one rule list or set. We experimentally show that our proposed methods produce coherent and accurate rule models from the rules learned by a well known ilp learner Aleph.
Existing ilp (inductivelogicprogramming) systems are implemented in different languages namely C, Progol, etc. Also, each system has its customized format for the input data. this makes it very tedious and time cons...
详细信息
ISBN:
(纸本)9783642212949;9783642212956
Existing ilp (inductivelogicprogramming) systems are implemented in different languages namely C, Progol, etc. Also, each system has its customized format for the input data. this makes it very tedious and time consuming on the part of a user to utilize such a system for experimental purposes as it demands a thorough understanding of that system and its input specification. In the spirit of Weka [1], we present a relational learning workbench called BET(Background + Examples = theories), implemented in Java. the objective of BET is to shorten the learning curve of users (including novices) and to facilitate speedy development of new relational learning systems as well as quick integration of existing ilp systems. the standardized input format makes it easier to experiment with different relational learning algorithms on a common dataset.
logic Programs with Annotated Disjunctions (LPADs) are a promising language for Probabilistic inductivelogicprogramming. In order to develop efficient learning systems for LPADs, it is fundamental to have high-perfo...
详细信息
ISBN:
(纸本)9783642212949;9783642212956
logic Programs with Annotated Disjunctions (LPADs) are a promising language for Probabilistic inductivelogicprogramming. In order to develop efficient learning systems for LPADs, it is fundamental to have high-performing inference algorithms. the existing approaches take too long or fail for large problems. In this paper we adapt to LPAD the approaches for approximate inference that have been developed for ProbLog, namely k-best and Monte Carlo. k-Best finds a lower bound of the probability of a query by identifying the k most probable explanations while Monte Carlo estimates the probability by smartly sampling the space of programs. the two techniques have been implemented in the cplint suite and have been tested on real and artificial datasets representing graphs. the results show that both algorithms are able to solve larger problems often in less time than the exact algorithm.
We present a novel approach to non-monotonic ilp and its implementation called TAL (Top-directed Abductive Learning). TAL overcomes some of the completeness problems of ilp systems based on Inverse Entailment and is t...
详细信息
ISBN:
(纸本)9783939897170
We present a novel approach to non-monotonic ilp and its implementation called TAL (Top-directed Abductive Learning). TAL overcomes some of the completeness problems of ilp systems based on Inverse Entailment and is the first top-down ilp system that allows background theories and hypotheses to be normal logic programs. the approach relies on mapping an ilp problem into an equivalent ALP one. this enables the use of established ALP proof procedures and the specification of richer language bias with integrity constraints. the mapping provides a principled search space for an ilp problem, over which an abductive search is used to compute inductive solutions.
As a form of Machine Learning the study of inductivelogicprogramming (ilp) is motivated by a central belief: relational description languages are better tin terms of accuracy and understandability) than propositiona...
详细信息
As a form of Machine Learning the study of inductivelogicprogramming (ilp) is motivated by a central belief: relational description languages are better tin terms of accuracy and understandability) than propositional ones for certain real-world applications. this claim is investigated here for a particular application in structural molecular biology, that of constructing readable descriptions of the major protein folds. To the authors' knowledge Machine Learning has not previously been applied systematically to this task. In this application, the domain expert (third author) identified a natural divide between essentially propositional features and more structurally-oriented relational ones. the following null hypotheses are tested: 1) for a given ilp system (Progol) provision of relational background knowledge does not increase predictive accuracy, 2) a good propositional learning system (C5.0) without relational background knowledge will outperform Progol with relational background knowledge, 3) relational background knowledge does not produce improved explanatory insight. Null hypotheses 1) and 2) are both refuted on cross-validation results carried out over 20 of the most populated protein folds. Hypothesis 3 is refuted by demonstration of various insightful rules discovered only in the relationally-oriented learned rules.
暂无评论