A new genetic inductive logic programming (GILP for short) algorithm named PT-NFF-GILP (Phase Transition and New Fitness Function based Genetic inductive logic programming) is proposed in this paper. Based on phase tr...
详细信息
ISBN:
(纸本)9781467315098
A new genetic inductive logic programming (GILP for short) algorithm named PT-NFF-GILP (Phase Transition and New Fitness Function based Genetic inductive logic programming) is proposed in this paper. Based on phase transition of the covering test, PT-NFF-GILP randomly generates initial population in phase transition region instead of the whole space of candidate clauses. Moreover, a new fitness function, which not only considers the number of examples covered by rules, but also considers the ratio of the examples covered by rules to the training examples, is defined in PT-NFF-GILP. The new fitness function measures the quality of first-order rules more precisely, and enhances the search performance of algorithm. Experiments on ten learning problems show that: 1) the new method of generating initial population can effectively reduce iteration number and enhance predictive accuracy of GILP algorithm;2) the new fitness function measures the quality of first-order rules more precisely and avoids generating over-specific hypothesis;3) The performance of PT-NFF-GILP is better than other algorithms compared with it, such as G-NET, KFOIL and NFOIL.
Artificial society is a discipline to study mechanisms of social system and phenomena which the mechanisms make. Emergence is global phenomena occurred by local mechanisms, such as, by collective behavior of autonomou...
详细信息
ISBN:
(纸本)9781479941735
Artificial society is a discipline to study mechanisms of social system and phenomena which the mechanisms make. Emergence is global phenomena occurred by local mechanisms, such as, by collective behavior of autonomous agents. Understanding of emergence phenomena is a challenging subject. In this paper we use the framework of inductive logic programming (ILP) for artificial society and emergence behavior study. ILP is a branch of machine learning based on logicprogramming and inductive inference. We investigate the possibility of ILP in artificial society study. ILP and logicprogramming technique are applied to representation of an artificial society model, called Sugarscape, and to rule learning for agent behavior. Although classical ILP algorithms target classification problems, the proposed algorithm grows behavior rule for an evaluation measurement. Phenomena which this paper treate is limited but we showed that ILP technique can be applied to study in the field of artificial society.
This paper presents an approach to infer UI patterns existent in a web application. This reverse engineering process is performed in two steps. First, execution traces are collected from user interactions using the Se...
详细信息
ISBN:
(纸本)9789899843400
This paper presents an approach to infer UI patterns existent in a web application. This reverse engineering process is performed in two steps. First, execution traces are collected from user interactions using the Selenium software. Second, the existing UI patterns within those traces are identified using Machine Learning inference with the Aleph ILP system. The paper describes and illustrates the proposed methodology on a case study over the Amazon web site.
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)
Grid computing systems are extremely large and complex so, manually dealing with its failures becomes impractical. Recently, it has been proposed that the systems themselves should manage their own failures or malfunc...
详细信息
ISBN:
(纸本)9781424450824
Grid computing systems are extremely large and complex so, manually dealing with its failures becomes impractical. Recently, it has been proposed that the systems themselves should manage their own failures or malfunctions. This is referred as self-healing. To deal with this challenging, is required to predict and control the process through a number of automated learning and proactive actions. In this paper, we proposed inductive logic programming, a relational machine learning method, for prediction and root causal analysis that makes it possible the development of a self-healing component.
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.
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.
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.
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.
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
暂无评论