• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1195-1207
• /
• 2004

Schema matching is prerequisite to an automated transformation of XML documents. Because previous works about schema matching compute all semantically-possible matchings, they produce many-to-many matching relationships. Such imprecise matchings are inappropriate for an automated transformation of XML documents. This paper presents an efficient schema matching algorithm that computes precise one-to-one matchings between two schemas. The proposed algorithm consists of two steps: preliminary matching relationships between leaf nodes in the two schemas are computed and one-to-one matchings are finally extracted based on a proposed path similarity. Specifically, for a sophisticated schema matching, the proposed algorithm is based on a domain ontology as well as a lexical database that includes abbreviations and synonyms. Experimental results with real schemas from an e-commerce field show that the proposed method is superior to previous works, resulting in an accuracy of 97% in average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.145-155
• /
• 2010

In this paper, we suggest a fish drug domain ontology to show an associated information and hierarchy together through concept-relation and inference mechanism instead of keyword matching. First, we investigate competency questions from workers of fishery industry and then we derive concepts and terminologies. Next, we present a process of fish drug ontology modelling using Protege-OWL editor, which is an extension of Protege that supports the Web Ontology Language(OWL). Last, we suggest the user interface of semantic web-based fish drug information system to search easily associated informations of fish drug using this ontology. It is to provide an effective search method that fish disease manager, fish farmer, and students majoring in fisheries can confirm details of diseases, fish, and drug evaluations associated with fish drug within one screen without moving to another position.

• Journal of KIISE:Software and Applications
• /
• v.33 no.9
• /
• pp.787-801
• /
• 2006

Ontology merging describes the process of integrating two ontologies into a new ontology. How this is done best is a subject of ongoing research in the Semantic Web, Data Integration, Knowledge Management System, and other ontology-related application systems. Earlier research on ontology merging, however, has studied for developing effective ontology matching approaches but missed analyzing and solving methods of problems of merging two ontologies given correspondences between them. In this paper, we propose a specific ontology merging process and a generic operator, T-MERGE, for integrating two source ontologies into a new ontology. Also, we define a taxonomy of merging conflicts which is derived from differing representations between input ontologies and a method for detecting and resolving them. Our T-MERGE operator encapsulates the process of detection and resolution of conflicts and merging two entities based on given correspondences between them. We define a data structure, MergeLog, for logging the execution of T-MERGE operator. MergeLog is used to inform detailed results of execution of merging to users or recover errors. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Naver philosophy dictionary as input ontologies. Our experiments show that the automatic merging module compared with manual merging by a expert has advantages in terms of time and effort.

• Journal of Digital Convergence
• /
• v.11 no.2
• /
• pp.271-277
• /
• 2013

Typical semantic search query for Semantic search promises to provide more accurate result than present-day keyword matching-based search by using the knowledge base represented logically. Existing keyword-based retrieval system is Preference for the semantic interpretation of a user's query is not the meaning of the user keywords of interconnect, you can not search. In this paper, we propose a method that can provide accurate results to meet the user's search intent to user preference based evaluation by ranking search. The proposed scheme is Integrated ontology-based knowledge base built on the formal structure of the semantic interpretation process based on ontology knowledge base system.

• Genomics & Informatics
• /
• v.18 no.2
• /
• pp.23.1-23.6
• /
• 2020

The Human Phenotype Ontology (HPO) is the de facto standard ontology to describe human phenotypes in detail, and it is actively used, particularly in the field of rare disease diagnoses. For clinicians who are not fluent in English, the HPO has been translated into many languages, and there have been four initiatives to develop Japanese translations. At the Biomedical Linked Annotation Hackathon 6 (BLAH6), a rule-based approach was attempted to determine the preferable Japanese translation for each HPO term among the candidates developed by the four approaches. The relationship between the HPO and Mammalian Phenotype translations was also investigated, with the eventual goal of harmonizing the two translations to facilitate phenotype-based comparisons of species in Japanese through cross-species phenotype matching. In order to deal with the increase in the number of HPO terms and the need for manual curation, it would be useful to have a dictionary containing word-by-word correspondences and fixed translation phrases for English word order. These considerations seem applicable to HPO localization into other languages.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.94-106
• /
• 2014

Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.202-214
• /
• 2005

The semantic web is the web paradigm that represents not general link of documents but semantics and relation of document. In addition it enables software agents to understand semantics of documents. We propose a semantic search based on inference with ontologies, which has the following characteristics. First, our search engine enables retrieval using explicit ontologies to reason though a search keyword is different from that of documents. Second, although the concept of two ontologies does not match exactly, can be found out similar results from a rule based translator and ontological reasoning. Third, our approach enables search engine to increase accuracy and precision by using explicit ontologies to reason about meanings of documents rather than guessing meanings of documents just by keyword. Fourth, domain ontology enables users to use more detailed queries based on ontology-based automated query generator that has search area and accuracy similar to NLP. Fifth, it enables agents to do automated search not only documents with keyword but also user-preferable information and knowledge from ontologies. It can perform search more accurately than current retrieval systems which use query to databases or keyword matching. We demonstrate our system, which use ontologies and inference based on explicit ontologies, can perform better than keyword matching approach .

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.37-39
• /
• 2004

본 논문은 점증적으로 갱신되는 온톨로지에 기반한 스키마 매칭 알고리즘을 제안한다. 스키마 매칭에 사용되는 온톨로지는 전운가에 의하여 작성된 정적인 것으로 모든 어휘관계를 포괄하기는 힘들다. 제안된 방법은 이전의 매칭 결과와 사용자 피드백에 따라 점증적으로 온틀로지를 갱신하여 매칭의 성능을 향상시킨다. 특히, 제안된 온톨로지는 분할, 병합 관계를 기술하고 있어 단순한 애칭관계분만 아니라 복합매칭관계 추출을 가능케 한다. 성능평가를 위한 실험결과 점증적 온틀로지의 적용이 매칭 성능을 매우 향상시킴을 알 수 있었다.

• Annual Conference of KIPS
• /
• 2009.04a
• /
• pp.483-486
• /
• 2009

본 논문은 클러스터링 탐색 방법과 온톨로지 학습 방법을 융합하여 보다 더 효율적인 검색 방안을 제안한다. 이를 통해 키워드가 정확하게 일치하지 않더라도 사용자가 원하는 웹 서비스를 검색할 수 있고, 반대로 키워드가 일치하지만 사용자가 의도하지 않은 웹 서비스는 검색 결과에서 제거할 수 있다. 주된 아이디어는 매개변수들 사이의 숨은 시맨틱 개념을 찾아내어 온톨로지를 학습하고, 확장된 키워드 탐색 방법과 온톨로지 활용 방법을 혼합 사용하여 보다 지능적인 웹 서비스 매칭을 수행하는 것이다.

• Korean Journal of Construction Engineering and Management
• /
• v.12 no.5
• /
• pp.137-145
• /
• 2011

BIM Data exchange using standard format can provide a user friendly and practical way of integrating the BIM tools in the life cycle of a building on the currently construction industry which is participated various stakeholder. It used IFC format to exchange the BIM data from Design software to energy analysis software. However, since we can not use the material name data in the library of an energy analysis directly, it is necessary to input the material property data for building energy analysis. In this paper, to matching the material named of name of DOE-2 default library, rhe extracted material names from BIM file are inferred by the ontology With this we can make the reliable input data of the engine by development a standard data and also increase the efficient of building energy analysis process. The methodology can enable to provide a direction of BIM-based information management system as a conceptual study of using ontology in the construction industry.