Generalized subsumption and its applications to induction and redundancy

Fvsoomm a Fuzzy Vectorial Space Model and Method of Personality, Cognitive Dissonance and Emotion in Decision Making

The purpose of this extension of the ESM’2019 conference paper is to propose some means to implement an artificial thinking model that simulates human psychological behavior. The first necessary model is the time fuzzy vector space model (TFVS). Traditional fuzzy logic uses fuzzification/defuzzification, fuzzy rules and implication to assess and combine several significant attributes to make deductions. The originality of TFVS is not to be another fuzzy logic model but rather a fuzzy object-oriented model which implements a dynamic object structural, behavior analogy and which encapsulates time fuzzy vectors in the object components and their attributes. The second model is a fuzzy vector space object oriented model and method (FVSOOMM) that describes how-to realize step by step the appropriate TFVS from the ontology class diagram designed with the Unified Modeling Language (UML). The third contribution concerns the cognitive model (Emotion, Personality, Interactions, Knowledge (Connaissance) and Experience) EPICE the layers of which are necessary to design the features of the artificial thinking model (ATM). The findings are that the TFVS model provides the appropriate time modelling tools to design and implement the layers of the EPICE model and thus the cognitive pyramids of the ATM. In practice, the emotion of cognitive dissonance during buying decisions is proposed and a game addiction application depicts the gamer decision process implementation with TFVS and finite state automata. Future works propose a platform to automate the implementation of TFVS according to the steps of the FVSOOMM method. An application is a case-based reasoning temporal approach based on TFVS and on dynamic distances computing between time resultant vectors in order to assess and compare similar objects’ evolution. The originality of this work is to provide models, tools and a method to design and implement some features of an artificial thinking model.

Pattern Based Feature Construction in Semantic Data Mining

The authors propose a new method for mining sets of patterns for classification, where patterns are represented as SPARQL queries over RDFS. The method contributes to so-called semantic data mining, a data mining approach where domain ontologies are used as background knowledge, and where the new challenge is to mine knowledge encoded in domain ontologies, rather than only purely empirical data. The authors have developed a tool that implements this approach. Using this the authors have conducted an experimental evaluation including comparison of our method to state-of-the-art approaches to classification of semantic data and an experimental study within emerging subfield of meta-learning called semantic meta-mining. The most important research contributions of the paper to the state-of-art are as follows. For pattern mining research or relational learning in general, the paper contributes a new algorithm for discovery of new type of patterns. For Semantic Web research, it theoretically and empirically illustrates how semantic, structured data can be used in traditional machine learning methods through a pattern-based approach for constructing semantic features.

AL-QuIn

Onto-Relational Learning is an extension of Relational Learning aimed at accounting for ontologies in a clear, well-founded and elegant manner. The system -QuIn supports a variant of the frequent pattern discovery task by following the Onto-Relational Learning approach. It takes taxonomic ontologies into account during the discovery process and produces descriptions of a given relational database at multiple granularity levels. The functionalities of the system are illustrated by means of examples taken from a Semantic Web Mining case study concerning the analysis of relational data extracted from the on-line CIA World Fact Book.

A unifying framework for concept-learning algorithms

A unifying framework for concept-learning, derived from Mitchell's Generalization as Search-paradigm, is presented. Central to the framework is the generic algorithm Gencol. Gencol forms a synthesis of existing concept-learning algorithms as it identifies the key issues in concept-learning: the representation of concepts and examples, the search strategy and heuristics, and the operators that transform one concept-description into another one when searching the concept description space. Gencol is relevant for practical purposes as it offers a solid basis for the design and implementation of concept-learning algorithms. The presented framework is quite general as seemingly disparate algorithms such as TDIDT, AQ, MIS and version spaces fit into Gencol.

Automatic inference of indexing rules for MEDLINE

BACKGROUND

Indexing is a crucial step in any information retrieval system. In MEDLINE, a widely used database of the biomedical literature, the indexing process involves the selection of Medical Subject Headings in order to describe the subject matter of articles. The need for automatic tools to assist MEDLINE indexers in this task is growing with the increasing number of publications being added to MEDLINE.

METHODS

In this paper, we describe the use and the customization of Inductive Logic Programming (ILP) to infer indexing rules that may be used to produce automatic indexing recommendations for MEDLINE indexers.

RESULTS

Our results show that this original ILP-based approach outperforms manual rules when they exist. In addition, the use of ILP rules also improves the overall performance of the Medical Text Indexer (MTI), a system producing automatic indexing recommendations for MEDLINE.

CONCLUSION

We expect the sets of ILP rules obtained in this experiment to be integrated into MTI.

Multi-relational data mining

Data mining algorithms look for patterns in data. While most existing data mining approaches look for patterns in a single data table, multi-relational data mining (MRDM) approaches look for patterns that involve multiple tables (relations) from a relational database. In recent years, the most common types of patterns and approaches considered in data mining have been extended to the multi-relational case and MRDM now encompasses multi-relational (MR) association rule discovery, MR decision trees and MR distance-based methods, among others. MRDM approaches have been successfully applied to a number of problems in a variety of areas, most notably in the area of bioinformatics. This article provides a brief introduction to MRDM, while the remainder of this special issue treats in detail advanced research topics at the frontiers of MRDM.

CORA--a knowledge-based system for the analysis of case-control studies

Carrying out a statistical analysis, the researcher is concerned with the problem of choosing an appropriate statistical technique from a large number of competing methods. Most common statistical software offer different methods for analysing the data without giving any support regarding the adequacy of a method for a particular data set. This paper outlines the main features of the computer system CORA which provides a statistical analysis of stratified contingency tables and additionally supports the researcher at the different steps of this analysis. Here, the support given by the system consists of two different aspects. On the one hand, the help system of CORA contains general information on the implemented statistical methods which can be obtained on request. On the other hand, an advice tool recommends an adequate statistical method which depends on the actual empirical case-control data to be analysed. To build up the advice tool, a set of rules being discovered by machine learning from simulation studies is integrated into the system CORA.

Inductive logic programming and learnability

The paper gives an overview of theoretical results in the rapidly growing field of inductive logic programming (ILP). The ILP learning situation (generality model, background knowledge, examples, hypotheses) is formally characterized and various restrictions of it are discussed in the light of their impact on learnability. The two dominant models of learnability, PAC-learning and identification in the limit, are extended to take into account the ILP learning situation. Several learnability results for logic programs are then presented, both positive and negative.