Learning Pretopological Spaces for Lexical Taxonomy Acquisition

International audienceIn this paper, we propose a new methodology for semi-supervised acquisition of lexical taxonomies from a list of existing terms. Our approach is based on the theory of pretopology that offers a powerful formalism to model semantic relations and transform a list of terms into a structured term space by combining different discriminant criteria. In order to learn a parameterized pretopological space, we define the Learning Pretopological Spaces strategy based on genetic algorithms. The rare but accurate pieces of knowledge given by an expert (semi-supervision) or automatically extracted with existing linguistic patterns (auto-supervision) are used to parameterize the different features defining the pretopological term space. Then, a structuring algorithm is used to transform the pretopological space into a lexical taxonomy, i.e. a direct acyclic graph. Results over three standard datasets (two from WordNet and one from UMLS) evidence improved performances against existing associative and pattern-based state-of-the-art approaches

Topological Relations.

A family of constructs is proposed that generalizes the notion of closure operator associated to a partial order. The constructs of the family (and some of its sub constructs) hold adjoint relations with Gconv which ensure a topological resemblance; furthermore, it is shown that the constructs are topological categories.Se propone una familia de constructos que generaliza la noción de operador clausura asociado a un orden parcial. Los constructos de la familia (y algunos de sus subconstructos) cumplen relaciones de adjunción con Gconv lo que nos asegura un símil topológico; aún más, se demuestra que los constructos son categorías topológicas

Results of Approximation and Measure on Mutational Spaces

This thesis extends the machinery of Mutational Analysis to accommodate numerical methods that are commonly used today, such as the Midpoint Method, Heun Method, and Runge-Kutta Methods. This is done by developing Taylor expansions in Mutational Spaces of Higher Order. Another extension of Mutational Analysis to Stochastic Mutational Analysis is considered. This extension is used to accommodate more realistic and robust models than the deterministic counterpart. A biologically relevant model is used as an illustration of this extension

A modular genetic programming system

Genetic Programming (GP) is an evolutionary algorithm for the automatic discovery of symbolic expressions, e.g. computer programs or mathematical formulae, that encode solutions to a user-defined task. Recent advances in GP systems and computer performance made it possible to successfully apply this algorithm to real-world applications. This work offers three main contributions to the state-of-the art in GP systems: (I) The documentation of RGP, a state-of-the art GP software implemented as an extension package to the popular R environment for statistical computation and graphics. GP and RPG are introduced both formally and with a series of tutorial examples. As R itself, RGP is available under an open source license. (II) A comprehensive empirical analysis of modern GP heuristics based on the methodology of Sequential Parameter Optimization. The effects and interactions of the most important GP algorithm parameters are analyzed and recommendations for good parameter settings are given. (III) Two extensive case studies based on real-world industrial applications. The first application involves process control models in steel production, while the second is about meta-model-based optimization of cyclone dust separators. A comparison with traditional and modern regression methods reveals that GP offers equal or superior performance in both applications, with the additional benefit of understandable and easy to deploy models. Main motivation of this work is the advancement of GP in real-world application areas. The focus lies on a subset of application areas that are known to be practical for GP, first of all symbolic regression and classification. It has been written with practitioners from academia and industry in mind

Semantic Systems. The Power of AI and Knowledge Graphs

This open access book constitutes the refereed proceedings of the 15th International Conference on Semantic Systems, SEMANTiCS 2019, held in Karlsruhe, Germany, in September 2019. The 20 full papers and 8 short papers presented in this volume were carefully reviewed and selected from 88 submissions. They cover topics such as: web semantics and linked (open) data; machine learning and deep learning techniques; semantic information management and knowledge integration; terminology, thesaurus and ontology management; data mining and knowledge discovery; semantics in blockchain and distributed ledger technologies