Learning settings are crucial for most inductive logic programming (ILP) systems to learn efficiently. Hypothesis spaces can be huge, and ILP systems take a long time to output solutions or even cannot terminate withi...
详细信息
ISBN:
(数字)9783031492990
ISBN:
(纸本)9783031492983;9783031492990
Learning settings are crucial for most inductive logic programming (ILP) systems to learn efficiently. Hypothesis spaces can be huge, and ILP systems take a long time to output solutions or even cannot terminate within time limits. Therefore, users must set suitable learning settings for each ILP task to bring the best performance of the system. However, most users struggle to set appropriate settings for the task they see for the first time. In this paper, we propose a method to make an ILP system more adaptable to tasks with weak learning biases. In particular, we attempt to learn efficient strategies for an ILP system using reinforcement learning (RL). We use Popper, a state-of-the-art ILP system that implements the concept of learning from failures (LFF). We introduce RL-Popper, which divides the hypothesis space into subspaces more minutely than Popper. RL is used to learn the efficient search order of the divided spaces. We provide the details of RL-Popper and showsome empirical results.
in this paper a learning system is presented which integrates an ECG waveform classifier (called PECG) with an interactive learner (called IMPUT). The PECG system is based on an attribute grammar specification of ECGs...
详细信息
ISBN:
(纸本)354062709X
in this paper a learning system is presented which integrates an ECG waveform classifier (called PECG) with an interactive learner (called IMPUT). The PECG system is based on an attribute grammar specification of ECGs that has been transformed to Prolog. The IMPUT system combines the interactive debugging technique IDT with the unfolding algorithm introduced in SPECTRE. Using the IMPUT system we can effectively assist in preparing the correct description of the basic structures of ECG waveforms.(4)
The rapid growth of the Web and the information overload problem demand the development of practical information extraction (IE) solutions for web content processing. Ontology Population (OP) concerns both the extract...
详细信息
ISBN:
(纸本)9781479931873
The rapid growth of the Web and the information overload problem demand the development of practical information extraction (IE) solutions for web content processing. Ontology Population (OP) concerns both the extraction and classification of instances of the concepts and relations defined by an ontology. Developing IE rules for OP is an intensive and time-consuming process. Thus, an automated mechanism, based on machine-learning techniques, able to convert textual data from web pages into ontology instances may be a crucial path. This paper presents an inductive logic programming-based method that automatic induces symbolic extraction rules, which are used for populating a domain ontology with instances of entity classes. This method uses domain-independent linguistic patterns for retrieving candidate instances from web pages, and a WordNet semantic similarity measure as background knowledge to be used as input by a generic inductive logic programming system. Experiments were conducted concerning both the instance classification problem and a comparison with other popular machine learning algorithms, with encouraging results.
inductive logic programming (ILP) is an inductive reasoning method based on the first-order predicative logic. This technology is widely used for data mining using symbolic artificial intelligence. ILP searches for a ...
详细信息
ISBN:
(纸本)9783031291258;9783031291265
inductive logic programming (ILP) is an inductive reasoning method based on the first-order predicative logic. This technology is widely used for data mining using symbolic artificial intelligence. ILP searches for a suitable hypothesis that covers positive examples and uncovers negative examples. The searching process requires a lot of execution cost to interpret many given examples for practical problems. In this paper, we propose a new hypothesis search method using particle swarm optimization (PSO). PSO is a meta-heuristic algorithm based on behaviors of particles. In our approach, each particle repeatedly moves from a hypothesis to another hypothesis within a hypothesis space. At that time, some hypotheses are refined based on the value returned by a predefined evaluation function. Since PSO just searches a part of the hypothesis space, it contributes to the speed up of the execution of ILP. In order to demonstrate the effectiveness of our method, we have implemented it on Progol that is one of the ILP systems [6], and then we conducted numerical experiments. The results showed that our method reduced the hypothesis search time compared to another conventional Progol.
Automating the learning of context specific robust rules from an evolving scene has been a research challenge in the area of cognitive vision systems. A research has been conducted to develop a system that learns cont...
详细信息
ISBN:
(纸本)9781424403219
Automating the learning of context specific robust rules from an evolving scene has been a research challenge in the area of cognitive vision systems. A research has been conducted to develop a system that learns context specific rules from an evolving scene by abstracting a model of human visual learning. Our system treats a set of symbolic data generated from an evolving real world scene and background knowledge as input to the system and inductive logic programming techniques are used to learn rules of the scene. The observed visual scene is represented in terms of qualitative spatial and temporal relations and these learnt relations are considered as input examples for inductive learning. A prototype has been developed for learning from various scenes of setting dinner tables. Currently the system is being tested to incorporate learning from different real world scenes thus improving the generalization power as well as combine more spatial and temporal representation and reasoning mechanisms to further enhance human like learning. This work can be adopted in automating a robot learning of object manipulation based on a visual scene.
Despite the impressive performance of Deep Neural Networks (DNNs), they usually lack the explanatory power of disciplines such as logicprogramming. Even though they can learn to solve very difficult problems, the lea...
详细信息
Despite the impressive performance of Deep Neural Networks (DNNs), they usually lack the explanatory power of disciplines such as logicprogramming. Even though they can learn to solve very difficult problems, the learning is usually implicit and it is very difficult, if not impossible, to interpret and decipher the underlying explanations that is implicitly stored in the weights of the neural network models. On the other hand, standard logicprogramming is usually limited in scope and application compared to the DNNs. The objective of this dissertation is to bridge the gap between these two disciplines by presenting a novel paradigm for learning algorithmic and discrete tasks via neural networks. This novel approach, uses the differentiable neural network to design interpretable and explanatory models that can learn and represent Boolean functions efficiently. We will investigate the application of these differentiable Neural logic (dNL) networks in disciplines such as inductive logic programming, Relational Reinforcement Learning, as well as in discrete algorithmic tasks such as decoding LDPC codes over Binary erasure Channels. inductive logic programming (ILP) is an important branch of machine learning that uses formal logic to define and solve problems. Compared to the DNNs, ILP provides high degree of interpretability and can learn from small number of examples and has superior generalization ability. However, standard ILP solvers are not differentiable and cannot benefit from the impressive power of DNNs. In this dissertation, we reformulate the ILP as a differentiable neural network by exploiting the explanatory power of dNL networks. This novel neural based ILP solver (dNL-ILP) is capable of learning auxiliary and invented predicates as well as learning complex recursive predicates. We show that dNL-ILP outperforms the current state of the art ILP solvers in a variety of benchmark algorithmic tasks as well as larger scale relational classification tasks. In
Noisy (uncertain, missing, or inconsistent) information, typical of many real-world domains, may dramatically affect the performance of logic-based Machine Learning. Multistrategy Learning approaches have been tried t...
详细信息
ISBN:
(纸本)9783030038403;9783030038397
Noisy (uncertain, missing, or inconsistent) information, typical of many real-world domains, may dramatically affect the performance of logic-based Machine Learning. Multistrategy Learning approaches have been tried to solve this problem by coupling inductive logic programming with other kinds of inference. While uncertainty has been tackled using probabilistic approaches, and abduction has been used to deal with missing data, inconsistency is still an open problem. In the Multistrategy Learning perspective, this paper proposes to attack this latter kind of noise using (abstract) Argumentation, an inferential strategy aimed at handling conflicting information. More specifically, it defines a pre-processing operator based on abstract argumentation that can detect and remove noisy atoms from the observations before running the learning system on the polished data. Quantitative and qualitative experiments point out some strengths and weaknesses of the proposed approach, and suggest lines for future research on this topic.
Modern search techniques either cannot efficiently incorporate human feedback to refine search results or cannot express structural or semantic properties of desired code. The key insight of our interactive code searc...
详细信息
ISBN:
(纸本)9781728108698
Modern search techniques either cannot efficiently incorporate human feedback to refine search results or cannot express structural or semantic properties of desired code. The key insight of our interactive code search technique ALICE is that user feedback can be actively incorporated to allow users to easily express and refine search queries. We design a query language to model the structure and semantics of code as logic facts. Given a code example with user annotations, ALICE automatically extracts a logic query from code features that are tagged as important. Users can refine the search query by labeling one or more examples as desired (positive) or irrelevant (negative). ALICE then infers a new logic query that separates positive examples from negative examples via active inductive logic programming. Our comprehensive simulation experiment shows that ALICE removes a large number of false positives quickly by actively incorporating user feedback. Its search algorithm is also robust to user labeling mistakes. Our choice of leveraging both positive and negative examples and using nested program structure as an inductive bias is effective in refining search queries. Compared with an existing interactive code search technique, ALICE does not require a user to manually construct a search pattern and yet achieves comparable precision and recall with much fewer search iterations. A case study with real developers shows that ALICE is easy to use and helps express complex code patterns.
This study presents a review of applications of inductive logic programming (ILP) for robotic systems. The aim of the paper is to demonstrate the different methods of applying ILP to a robotic system and to also highl...
详细信息
ISBN:
(数字)9783031492990
ISBN:
(纸本)9783031492983;9783031492990
This study presents a review of applications of inductive logic programming (ILP) for robotic systems. The aim of the paper is to demonstrate the different methods of applying ILP to a robotic system and to also highlight some of the limitations that already exist. ILP can aid in the development of explainable and trustworthy robotics systems.
inductive logic programming (ILP) is a generic tool aiming at learning rules from relational databases. Introducing fuzzy sets and fuzzy implication connectives in this framework allows us to increase the expressive p...
详细信息
ISBN:
(纸本)0780391586
inductive logic programming (ILP) is a generic tool aiming at learning rules from relational databases. Introducing fuzzy sets and fuzzy implication connectives in this framework allows us to increase the expressive power of the induced rules while keeping the readability of the rules. Moreover, fuzzy sets facilitate the handling of numerical attributes by avoiding crisp and arbitrary transitions between classes. In this paper, the meaning of a fuzzy rule is encoded by its implication operator, which is to be determined in the learning process. An algorithm is proposed for inducing first order rules having fuzzy predicates, together with the most appropriate implication operator. The benefits of introducing fuzzy logic in ILP and the validation process of what has been learnt are discussed and illustrated on a benchmark.
暂无评论