• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.147-150
• /
• 2007

본 논문에서는 토픽맵 기반의 온톨로지 병합 과정에서 발생할 수 있는 충돌의 유형을 트리 구조로 정의하고 충돌 탐지 및 해결을 통하여 두 온톨로지를 하나로 병합하는 기법을 제안한다. 병합충돌은 의미적 대응 요소들의 유사값에 기반하여 엘리먼트기반, 구조기반 임시기반의 트리 구조로 분류되고 이 충돌 트리를 이용하여 두 매핑 요소사이의 병합충돌을 탐지하고 해결한다. 실험을 위해 토픽맵 질의언어 tolog를 사용하여 동서양 철학온톨로지 및 독일 문학온톨로지들의 병합 전과 후의 질의 결과를 비교하고 이를 정확율과 재현율로 병합 성능을 평가하였으며 그 결과 손실없는 병합이 가능함을 보였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.971-978
• /
• 2008

This paper designs a service-oriented wireless sensor network ontology model which can be used as a knowledge base in future ubiquitous computing. In contrast to legacy approaches, this paper defines the new service classes (ServiceProperty, LocationProperty, and PhysicalProperty), as well as their properties and constraints that enable the service-oriented service based on service items. The service item merging between the proposed model and the legacy ontology was processed using the "equivalentClass" object property of OWL. The Protege 3.3.1 and RACER 1.9.0 inference tools were used for the validation and consistency check of the proposed ontology model, respectively, and the results of service query was applied to the newly defined property in SPARQL language without reference to the properties of legacy ontology.

• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.359-367
• /
• 2007

The ontology is the underlying knowledge base to create the semantic web. Prerequisites for the success of the semantic web include widespread uses/sharing/merging of ontologies. In addition, it is very crucial to secure the integrity of ontology instances such as instance-identifying/referring integrity, and attribute domain constraints. In terms of ensuring instance-identifying integrity, OWL provides owl:sameAs property which is used to connect two separate ontology instances in order to represent that the two instances are the same. Recent semantic web works, however, have not sufficiently investigated the issues one may face in applying owl:sameAs to real semantic web applications. This study introduces our experiences of sameAs in developing a semantic web service framework for a research domain.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.528-545
• /
• 2007

Recently ontology has been an attractive technology along with the business strategy of providing a plenty of more intelligent services. The essential problem in application domains using ontology is that all members, agents, and application programs in the domains must share the same ontology concepts. However, a variety of mobile devices, sensing devices, and network components manufactured by various companies, a variety of common carriers, and a variety of contents providers make multiple heterogeneous ontologies more likely to coexist. We can see many past researches fallen into resolving this semantic interoperability. Such methods can be broadly classified into by-mapping, by-merging, and by-translation. In this research, we focus on by-translation among them which uses a translation rule directly made between two heterogeneous ontology data like OntoMorph. However, the manual composition of the direct translation rule is not convenient by itself and if there are N ontologies, the direct method has the rule composition complexity of $O(N^2)$ in the worst case. Therefore, in this paper we introduce the cascade composition of translation rules based on web openness in order to improve the complexity. The research result made us recognize some important factors in an ontology translation system, that is speediness of translation, and conveniency of translation rule composition, and some experiments and comparing analysis with existing methods showed that our cascade method has more conveniency with insuring the speediness and the correctness.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.33-48
• /
• 2006

The Semantic Web and its related technologies have been opening the era of information sharing via the Web. There are, however, several huddles still to overcome in the new era, and one of the major huddles is the issue of information integration, unless a single unified and huge ontology could be built and used which could address everything in the world. Particularly in the e-business area, the problem of information integration is of a great concern for product search and comparison at various Internet shopping sites and e-marketplaces. To overcome this problem, we proposed an ontology-driven mapping algorithm between heterogeneous product classification and description frameworks. We also peformed a comparative evaluation of the proposed mapping algorithm against a well-Down ontology mapping tool, PROMPT.

• The Journal of Society for e-Business Studies
• /
• v.11 no.3
• /
• pp.53-71
• /
• 2006

In order to cope with the rapidly changing product development environment, individual manufacturing enterprises are forced to collaborate with each other through establishing a virtual organization. In collaboration, designated organizations work together for mutual gain based on product data interoperability. However, product data interoperability is not fully facilitated due to semantic inconsistency among product data models of individual enterprises. In order to overcome the semantic inconsistency problem, this paper proposes a reference ontology, Reference Domain Ontology(RDO), and a methodology for product data interoperability with semantic consistency using RDO. RDO describes semantics of product data model and metamodel for all application domains in a virtual organization. Using RDO, application domains in a virtual organization can easily understand the product data models of others. RDO is agile and temporal such that it is created with the formation of a virtual organization, copes with changes of the organization, and disappears with the vanishment of the organization. RDO is built by a hybrid approach of top-down using a upper ontology and bottom-up based on the merging of ontologies of application domains in a virtual organization. With this methodology, every domain in a virtual organization can achieve product data model interoperability without model transformation.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2010.08a
• /
• pp.41-44
• /
• 2010

본 논문은 토픽맵 기반 온톨로지 시스템의 통합효과 측정을 위한 연구에 앞서 통합의 가능성과 통합 성능을 측정하기 위한 프로토타입 시스템 구축에 관한 연구이다. 프로토타입 시스템 구축을 통해 자동 통합 툴의 성능을 측정하고자 한다. 이를 위해 통합 전의 단일 토픽맵에서의 검색 결과와 통합 토픽맵에서의 검색 결과를 비교하여 정답율과 재현율을 평가함으로써 통합 토픽맵이 정보의 손실 없이 단일 토픽맵들을 완전히 통합한 것인지 확인할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.115-117
• /
• 2003

최근 시맨틱 웹의 중요성이 부각되면서 다양한 분야에서 이와 관련된 연구가 활발히 진행되고 있다. 시맨틱 웹과 관련된 연구 중 중요한 부분이 은톨로지와 규칙 및 추론이며, 이들 연구가 실용적인 측면에서 빠르게 진행되기 위해서는 연구를 위해 사용가능한 온톨로지가 많이 구축되어 있어야 한다. 그러나, 온톨로지의 구축은 많은 노력과 시간을 요하기 때문에 온톨로지 합병을 통한 기존 온톨로지의 재사용이 반드시 필요하다. 이미 온톨로지 합병을 위한 도구가 다수 존재하나 이들이 시멘틱 웹에서의 온톨로지 언어인 OWL을 직접적으로 지원하지 않는다는 단점이 있다. 본 논문에서는 기존 온톨로지 합병도구의 분석을 통해 OWL 온톨로지 합병도구 개발을 위해 필요한 기본적인 기능들을 추출하고, 이를 설계 및 구현하였다. 기존 온톨로지를 OWL로 변환해 주는 도구와 개발된 도구를 사용하여 현재 다수 존재하는 기존 온톨로지를 재활용함으로써 시맨틱 웹의 활용 촉진에 기여할 수 있을 것으로 기대된다.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.404-407
• /
• 2010

일반적으로 온톨로지는 관심 있는 특정 도메인에 대해 생성되므로 넓은 문제 영역에서 단일 온톨로지가 응답하는 것을 기대할 수 없다. 이것은 큰 작업에서 상이한 온톨로지의 데이터를 사용할 필요가 있음을 의미한다. 또한 대부분의 온톨로지는 한 사람이나 작은 그룹에 의해 개발되고, 그래프가 아닌 트리로 생각할 수 있다. 본 논문에서는 트리를 이용하여 온톨로지를 구축하고, 이해하고, 처리하는 효율적인 방법을 보이고자 한다. 온톨로지 병합 오퍼레이션의 정의를 위해 온톨로지의 구조, 구성 요소, 표현을 자세하게 정의하고, 두 온톨로지를 병합하는 방법에 대한 세부 사항을 보인다.

• 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.