概念的最小上近似

The Least Upper Approximation of Concept

近似信息检索方法通过找到概念的最小上界,然后求出概念的上近似来解决本体异构问题.现有方法只考虑包含独立概念的最小上界,无法找到概念的最小上近似.引入概念的析取定义概念的多元最小上界,证明了基于多元最小上界得到的近似是概念的最小上近似.多元最小上界通常会存在大量的冗余,从而增加概念最小上近似表达式的复杂性.为此给出概念的最简多元最小上界的定义,并提供了寻找最简多元最小上界的有效算法.

The approximate information retrieval approach finds least upper bounds of a concept and then uses them to get upper approximation of the concept to solve this problem of ontology heterogeneity. However, the current method considers the bounds only containing separate concepts, so it cannot get the least upper approximation of the concept. In this paper,disjunction of the concepts is introduced to define muldelement least upper bounds, and the approximation based on them is proved the least upper approximation of a concept. In general, multielement least upper bounds may contain much redundancy, which will increase the expression complexity of the least upper approximation of a concept. We also define the simplified multielement least upper bounds and provide effective algorithm to find them last.