2019
Refining concepts by machine learning
MENŠÍK, Marek; Marie DUŽÍ; Adam ALBERT; Vojtěch PATSCHKA; Miroslav PAJR et al.Basic information
Original name
Refining concepts by machine learning
Authors
MENŠÍK, Marek; Marie DUŽÍ; Adam ALBERT; Vojtěch PATSCHKA and Miroslav PAJR
Edition
Computacion y Sistemas, Centro de Investigacion en Computacion (CIC) del Instituto Politecnico Nacional (IPN), 2019, 1405-5546
Other information
Language
English
Type of outcome
Article in a journal
Field of Study
10200 1.2 Computer and information sciences
Country of publisher
Mexico
Confidentiality degree
is not subject to a state or trade secret
References:
Marked to be transferred to RIV
Yes
RIV identification code
RIV/47813059:19240/19:A0000487
Organization unit
Faculty of Philosophy and Science in Opava
UT WoS
EID Scopus
Keywords in English
generalization; heuristics; machine learning; specialization; TIL; transparent intensional logic
Tags
Tags
International impact, Reviewed
Changed: 21/4/2020 11:14, Ing. Petra Skoumalová
Abstract
In the original language
In this paper we deal with machine learning methods and algorithms applied in learning simple concepts by their refining or explication. The method of refining a simple concept of an object O consists in discovering a molecular concept that defines the same or a very similar object to the object O. Typically, such a molecular concept is a professional definition of the object, for instance a biological definition according to taxonomy, or legal definition of roles, acts, etc. Our background theory is Transparent Intensional Logic (TIL). In TIL concepts are explicated as abstract procedures encoded by natural language terms. These procedures are defined as six kinds of TIL constructions. First, we briefly introduce the method of learning with a supervisor that is applied in our case. Then we describe the algorithm ‘Framework’ together with heuristic methods applied by it. The heuristics is based on a plausible supply of positive and negative (near-miss) examples by which learner’s hypotheses are refined and adjusted. Given a positive example, the learner refines the hypothesis learnt so far, while a near-miss example triggers specialization. Our heuristic methods deal with the way refinement is applied, which includes also its special cases generalization and specialization.