• Journal of Information Management
• /
• v.37 no.2
• /
• pp.1-20
• /
• 2006

It has lately been recognized that the sharing and exchanging of the research results information is the critical factor to improve the research productivity. So many institutions are planning or developing the information systems which provide the research information services for researcher. But it has very difficulty in integrating the research resources information due to the dispersion and heterogeneity in data sources, and semantic and structural difference in describing data. We propose the semantic web based methodology and conceptual framework for raising the interoperability of metadata about research results information, which will support the integration of the distributed research data for information services in the end. We first introduce the ontology which is developed based on Standard Metadata of Research Results Information published by STISC. Then to show the applicability in real-world environment, we express the metadata of research information in RDF/RDFS according to ontology. Finally we proposed the conceptual architecture of research information service system which shows the main components, the functional requirements, and the principal and design direction at implementing the system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.111-124
• /
• 2011

The apartment' share of the housing has steadily increased and property assets have been valued in importance as the one of asset value. Information retrieval system using internet is particularly active in the real estate market. However, user satisfaction on real estate information system is not very high, and there is a lack of research on real estate retrieval to increasing efficiency until now. This study presents a new knowledge information system developed to consider region-related factor and individual-related factor in the real estate market. In addition it enables a real estate knowledge system to search various preferential requirements for buyers such as school district, living convenience, easy maintenance as well as price. We made a survey of the search condition preference of experts on 30 real estate agents and then analyzed the result using AHP methodology. Furthermore, this research is to build apartment ontology using semantic web technologies to standardize various terminologies of apartment information and to show how it can be used to help buyers find apartments of the interest. After designing architecture of a real estate knowledge information system, this system is applied to the Busan real estate market to estimate the solutions of retrieval through Multi-Attribute Decision Making(MADM). Based on the results of the analysis, we endowed the buyer and expert's selected factors with weights in the system. Evaluation results indicate that this new system is to raise not only the value satisfaction of user, but also make it possible to effectively search and analyze the real estate through entropy analysis of MADM. This new system is to raise not only the value satisfaction of buyer's real estate, but also make it possible to effectively search and analyze the related real estate, consequently saving the searching cost of the buyers.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.269-276
• /
• 2007

온톨로지 매핑 기술은 시맨틱 웹을 비롯한 여러 분야에서 중요한 기술 중 하나이다. 온톨로지 매핑은 두 개의 온톨로지를 입력으로 받고, 이를 몇 개의 매개변수로 구성된 특정 알고리즘을 이용하여 두 온톨로지 간의 매칭 관계를 알아내고 이를 표현하는 절차를 말한다. 온톨로지 매핑을 이용하여 대용량 온톨로지의 통합이나, 지능화된 통합 검색을 구현할 수 있고, 여러 응용프로그램이 하나의 도메인을 공유하는 등 여러가지 방안으로 사용할 수 있다. 일반적으로 온톨로지 매핑의 성능을 판단하는데 있어서 매핑 결과를 측정하는 방법론의 측정 값을 주로 고려해왔다. 본 연구에서는 매핑을 수행할 때 두 개의 파라미터를 사용하였는데 하나는 알파이고 하나는 Threshold이다. 이것은 매핑의 정확성을 판단하는데 많은 영향을 미친다. 앞서 언급했듯이 매핑결과에 대한 측정값을 중요하게 여기기 때문에 많은 매핑관련 연구에서 알고리즘이 좋은 측정값을 도출할 수 있도록 파라미터를 조절하는 것에 초점을 맞춰왔다. 본 연구에서 측정방법에 따른 높은 측정결과를 지향하는 것이 아닌 온톨로지의 성격과 매핑결과의 사용처에 따라 파라미터를 적절히 변화시켜야 한다는 점에 주목하고, 주어진 환경과 매핑의 사용처에 알맞게 파라미터를 조정하는 방법론을 제안하고자 한다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.4
• /
• pp.325-331
• /
• 2013

This paper a framework and method for resolving word sense disambiguation and present the results. In this work, WordNet is used for two different purposes: one as a dictionary and the other as an ontology, containing the hierarchical structure, representing hypernym-hyponym relations. The advantage of this approach is twofold. First, it provides a very simple method that is easily implemented. Second, we do not suffer from the lack of large corpus data which would have been necessary in a statistical method. In the future this can be extended to incorporate other relations, such as synonyms, meronyms, and antonyms.

• Journal of the Korean Society for information Management
• /
• v.28 no.4
• /
• pp.263-278
• /
• 2011

This study analyzed the level of 326 academic librarians awareness, usability and counter strategies on the Library 3.0. The results revealed the awareness level in the following order: that (1) Mobile Library (2) Semantic Search (3) AI(Artificial Intelligent) (4) Cloud Computing (5) Ontology (6) Linked Data. The order of the future usability for the Library 3.0 was ranked (1) Mobile Library (2) Linked Data (3) Semantic Search (4) Cloud Computing (5) AI and (6) Ontology. To conclude, the level of awareness and the usability of Library 3.0 were shown to be statistically significant. There are, however, some discrepancies in awareness differ across librarians and regions. Moreover, the level of awareness for the Library 3.0 did influence the library's organizational performance but the individual librarian's competences only.

• 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 the Korea Institute of Information Security & Cryptology
• /
• v.18 no.2
• /
• pp.49-63
• /
• 2008

RDF is the base ontology model which is used in Semantic Web defined by W3C. OWL expands the RDF base model by providing various vocabularies for defining much more ontology relationships. Recently Jain and Farkas have suggested an RDF access control model based on RDF triple. Their research point is to introduce an authorization conflict problem by RDF inference which must be considered in RDF ontology data. Due to the problem, we cannot adopt XML access control model for RDF, although RDF is represented by XML. However, Jain and Farkas did not define the authorization propagation over the RDF upper/lower ontology concepts when an RDF authorization is specified. The reason why the authorization specification should be defined clearly is that finally, the authorizatin conflict is the problem between the authorization propagation in specifying an authorization and the authorization propagation in inferencing authorizations. In this article, first we define an RDF access authorization specification based on RDF triple in detail. Next, based on the definition, we analyze the authoriztion conflict problem by RDF inference in detail. Next, we briefly introduce a method which can quickly find an authorization conflict by using graph labeling techniques. This method is especially related with the subsumption relationship based inference. Finally, we present a comparison analysis with Jain and Farkas' study, and some experimental results showing the efficiency of the suggested conflict detection method.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.35-45
• /
• 2008

In order to constructan ubiquitous computing environment, it is necessary to develop a technology that can recognize users and circumstances. In this regard, the question of recognizing and expressing user Context regardless of computer and language types has emerged as an important task under the heterogeneous distributed processing system. As a means to solve this task of representing user Context in the ubiquitous environment, this paper proposes to describe user Context as the most similar form of human thinking by using semantic web and fuzzy concept independentof language and computer types. Because the conventional method of representing Context using an usual collection has some limitations in expressing the environment of the real world, this paper has chosen to use Fuzzy OWL language, a fusion of fuzzy concept and standard web ontology language OWL. Accordingly, this paper suggests the following method. First we represent user contacted environmental information with a numerical value and states, and describe it with OWL. After that we transform the converted OWL Context into Fuzzy OWL. As a last step, we prove whether the automatic circumstances are possible in this procedure when we use fuzzy inference engine FiRE. With use the suggested method in this paper, we can describe Context which can be used in the ubiquitous computing environment. This method is more effective in expressing degree and status of the Context due to using fuzzy concept. Moreover, on the basis of the stated Context we can also infer the user contacted status of the environment. It is also possible to enable this system to function automatically in compliance with the inferred state.

• The Korean Journal of Archival Studies
• /
• no.19
• /
• pp.57-102
• /
• 2009

Recently, distribution of record via web and coefficient of utilization are increase. so, Archival information service using website becomes essential part of record center. The main point of archival information service by website is making record information retrieval easy. It has need of matching user's request and representation of record resources correctly to making archival information retrieval easy. Archivist and record manager have used various information representation tools from taxonomy to recent thesaurus, still, the accuracy of information retrieval has not solved. This study constructed record retrieval system based on Topic Map by modeling record resources which focusing on description metadata of the records to improve this problem. The target user of the system is general web users and its range is limited to the president related sources in the National Archives Portal Service. The procedure is as follows; 1) Design an ontology model for archival information service based on topic map which focusing on description metadata of the records. 2) Buildpractical record retrieval system with topic map that received information source list, which extracted from the National Archives Portal Service, by editor. 3) Check and assess features of record retrieval system based on topic map through user interface. Through the practice, relevance navigation to other record sources by semantic inference of description metadata is confirmed. And also, records could be built up as knowledge with result of scattered archival sources.