• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.12
• /
• pp.523-530
• /
• 2014

Ontology alignment is the way to share and reuse of ontology knowledge. Because of the ambiguity of concept, most ontology alignment systems combine a set of various measures and complete enumeration to provide the satisfactory result. However, calculating process becomes more complex and required time increases exponentially since the number of concept increases, more errors can appear at the same time. Lately the focus is on meta-matching using the heuristic algorithm. Existing meta-matching system tune extra parameter and it causes complex calculating, as a consequence, the results in the various data of specific domain are not good performed. In this paper, we propose a high performance algorithm by using DCS that can solve ontology alignment through simple process. It provides an efficient search strategy according to distribution of Levy Flight. In order to evaluate the approach, benchmark data from the OAEI 2012 is employed. Through the comparison of the quality of the alignments which uses DCS with state of the art ontology matching systems.

• Journal of Information Technology Services
• /
• v.8 no.1
• /
• pp.203-215
• /
• 2009

This paper illustrates the application of co-occurrence theory to generate lightweight ontologies semi-automatically. The proposed model includes three steps of a (Semi-) Automatic creation of Ontology; (they are conceptually named as) the Syntactic-based Ontology, the Semantic-based Ontology and the Ontology Refinement. Each of these three steps are designed to interactively work together, so as to generate Lightweight Ontologies. The Syntactic-based Ontology step includes generating Association words using co-occurrence in web documents. The Semantic-based Ontology step includes the Alignment large Association words with small Ontology, through the process of semantic relations by contextual terms. Finally, the Ontology Refinement step includes the domain expert to refine the lightweight Ontologies. We also conducted a case study to generate lightweight ontologies in specific domains(news domain). In this paper, we found two directions including (1) employment co-occurrence theory to generate Syntactic-based Ontology automatically and (2) Alignment large Association words with small Ontology to generate lightweight ontologies semi-automatically. So far as the design and the generation of big Ontology is concerned, the proposed research will offer useful implications to the researchers and practitioners so as to improve the research level to the commercial use.

• Journal of KIISE:Software and Applications
• /
• v.36 no.4
• /
• pp.329-334
• /
• 2009

The ontology alignment has two kinds of major problems. First, the features used for ontology alignment are usually defined by experts, but it is highly possible for some critical features to be excluded from the feature set. Second, the semantic and the structural similarities are usually computed independently, and then they are combined in an ad-hoc way where the weights are determined heuristically. This paper proposes the modified parse tree kernel (MPTK) for ontology alignment. In order to compute the similarity between entities in the ontologies, a tree is adopted as a representation of an ontology. After transforming an ontology into a set of trees, their similarity is computed using MPTK without explicit enumeration of features. In computing the similarity between trees, the approximate string matching is adopted to naturally reflect not only the structural information but also the semantic information. According to a series of experiments with a standard data set, the kernel method outperforms other structural similarities such as GMO. In addition, the proposed method shows the state-of-the-art performance in the ontology alignment.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.23-30
• /
• 2004

Ontologies play an important role in the Semantic Web by providing well-defined meaning to ontology consumers. But as the ontologies are authored in a bottom-up distributed mimer, a large number of overlapping ontologies are created and used for the similar domains. Ontology sharing and reuse have become a distinguished topic, and ontology merging and alignment are the solutions for the problem. Ontology merging and alignment algorithms previously proposed detect conflicts between concepts by making use of only local syntactic information of concept names. And they depend only on a semi-automatic approach, which makes ontology engineers tedious. Consequently, the quality of merging and alignment tends to be unsatisfying. To remedy the defects of the previous algorithms, we propose a new algorithm for ontology merging and alignment which uses local and global semantic set of a concept. We evaluated our algorithm with several pairs of ontologies written in OWL, and achieved around 91% of precision in merging and alignment. We expect that, with the widespread use of web ontology, the need for ontology sharing and reuse ill become higher, and our proposed algorithm can significantly reduce the time required for ontology development. And also, our algorithm can easily be applied to various fields such as ontology mapping where semantic information exchange is a requirement.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.834-851
• /
• 2017

The amount of sources of information available on the web using ontologies as support continues to increase and is often heterogeneous and distributed. Ontology alignment is the solution to ensure semantic interoperability. In this paper, we describe a new ontology alignment approach, which consists of combining structure-based and reasoning-based approaches in order to discover new semantic correspondences between entities of different ontologies. We used the biblio test of the benchmark series and anatomy series of the Ontology Alignment Evaluation Initiative (OAEI) 2012 evaluation campaign to evaluate the performance of our approach. We compared our approach successively with LogMap and YAM++ systems. We also analyzed the contribution of our method compared to structural and semantic methods. The results obtained show that our performance provides good performance. Indeed, these results are better than those of the LogMap system in terms of precision, recall, and F-measure. Our approach has also been proven to be more relevant than YAM++ for certain types of ontologies and significantly improves the structure-based and reasoningbased methods.

• International journal of advanced smart convergence
• /
• v.12 no.3
• /
• pp.75-88
• /
• 2023

In a specific domain, experts have different understanding of domain knowledge or different purpose of constructing ontology. These will lead to multiple different ontologies in the domain. This phenomenon is called the ontology heterogeneity. For research fields that require cross-ontology operations such as knowledge fusion and knowledge reasoning, the ontology heterogeneity has caused certain difficulties for research. In this paper, we propose a novel ontology matching model that combines word embedding and a concatenated continuous bag-of-words model. Our goal is to improve word vectors and distinguish the semantic similarity and descriptive associations. Moreover, we make the most of textual and structural information from the ontology and external resources. We represent the ontology as a graph and use the SimRank algorithm to calculate the structural similarity. Our approach employs a similarity queue to achieve one-to-many matching results which provide a wider range of insights for subsequent mining and analysis. This enhances and refines the methodology used in ontology matching.

• Journal of Computing Science and Engineering
• /
• v.3 no.2
• /
• pp.90-108
• /
• 2009

In this paper, we present an ontology mediation solution based on the methods frequently used in Formal Concept Analysis. Our approach of mediation is based on the existence of instances associated to two source ontologies, then we can generate concepts in a new ontology if and only if they share the same extent. Hence our approach creates a merged ontology which captures the knowledge of these two source ontologies. The main contributions of this work are (i) to enable the creation of concepts not originally in the source ontologies, (ii) to propose a solution to label these emerging concepts and finally (iii) to optimize the resulting ontology by eliminating redundant or non pertinent concepts. Another contribution of this work is to emphasize that several forms of mediated ontology can be defined based on the relaxation of certain criteria produced from our method. The solution that we propose for tackling these issues is an automatic solution, meaning that it does not require the intervention of the end-user, excepting for the definition of the common set of ontology instances.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.72-73
• /
• 2010

• Journal of the Korean Society for information Management
• /
• v.26 no.4
• /
• pp.319-336
• /
• 2009

Semantic web technology is the evolution of current World Wide Web including a machine-understandable knowledge database, ontology, it may be enable machine and people to work together. However, problems arise when we try to communicate with different data, which are annotated by different ontologies created by different people with different concepts. Thus, to communicate between ontologies, it needs to align between heterogeneous ontologies. When it is aligned between concept nodes of heterogeneous ontologies, one of main problems is a misalignment situation caused by false negative of automatic ontology mapping. So, in this paper, we present a new method to minimize the false negative error in the process of aligning concept nodes of different ontology.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.664-667
• /
• 2014

기존 온톨로지들을 공유 및 재사용하기 위하여 온톨로지 정렬이 연구되고 있다. 기존 정렬 시스템은 온톨로지 데이터 양에 따라 매트릭스를 생성하고 과도한 계산을 통해 처리하여 대용량 데이터 집합에 대하여 공간적 및 계산적으로 부하를 발생하여 효율적이지 않다. 이를 해결하기 위하여 온톨로지 정렬을 휴리스틱 알고리즘을 적용하여 연구 진행하였다. 기존 휴리스틱 알고리즘은 계산이 간단하지만 조율해야 하는 파라미터가 많기에 특정 도메인에 최적 조합이 필요하며 만족한 성능을 얻지 못하였다. 이 논문에서는 Discrete Cuckoo Search(DCS) 기반 온톨로지 정렬 알고리즘을 제안한다. 제안한 알고리즘은 조율해야 하는 파라미터의 개수가 적고 Levy Flight 분포에 따라 탐색하여 계산이 간단하다. 제안된 알고리즘의 성능을 평가하기 위해 OAEI(Ontology Alignment Evaluation Initiative)에서 제공하는 벤치마크 데이터를 사용하여 정확률(Precision)과 재현율(Recall)을 구하고 기존 휴리스틱 정렬 알고리즘과 비교 평가하였다.