• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.155-158
• /
• 2010

시맨틱 웹 기술을 활용한 OpenAPI 의미 기반 검색 시스템에서 설명정보페이지에 의미정보를 가진 메타데이터를 첨가하기 위해 RDFa 기술을 이용한 태깅을 하였다. 하지만 태깅 시 사람이 수작업을 통해 입력하기 때문에 시간소모가 크고 오류 위험이 높다는 제약사항이 있다. 이러한 제약사항을 해결하기 위해 본 논문에서는 XML/XHTML 편집도구를 이용한 향상된 RDFa 태깅을 제안한다. 이는 속도향상과 오류 감소의 방법으로 XML/XHTML 편집도구에서 제공하는 자동완성 기능을 제안하고 있다. 그리고 자동완성 기능을 사용하기 위해 DTD를 수정하여 적용하였고 수정된 방법을 테스트한 결과 기존의 수동 태깅 기법보다 걸리는 시간이 단축됐고, 오류를 줄일 수 있음이 확인되었다. 결과를 얻을 수 있었다.

• Journal of the Korean Society for information Management
• /
• v.30 no.1
• /
• pp.259-284
• /
• 2013

Public information has been collected in various fields with huge costs in order to serve public purposes such as public agencies' policy-making. However, the collected public information has been overlooked as silos. In korea, many attempts have been made to open the public information to the public only to result in limited extent, where OpenAPI data is being presented by some agencies. Recently, at the national level, the LOD(Linking Open Data) project has built the national DB, initiating the ground on which the linked data will be based for their active availability. This study has outlined overall problems in earlier projects which have built up national linking systems based on linked data for public data use. A possible solution has been proposed with a real experience of having set up an existing national DB of Korean public agencies.

• The Journal of the Korea Contents Association
• /
• v.16 no.2
• /
• pp.374-386
• /
• 2016

Provenance means the meta data that represents the history or lineage of a data in collaboration storage environments. Therefore, as provenance has been accruing over time, it takes several ten times as large as the original data. The schemes for effciently compressing huge amounts of provenance are required. In this paper, we propose a provenance compression scheme considering the RDF graph patterns. The proposed scheme represents provenance based on a standard PROV model and encodes provenance in numeric data through the text encoding. We compress provenance and RDF data using the graph patterns. Unlike conventional provenance compression techniques, we compress provenance by considering RDF documents on the semantic web. In order to show the superiority of the proposed scheme, we compare it with the existing scheme in terms of compression ratio and the processing time.

• Journal of Korean Library and Information Science Society
• /
• v.50 no.3
• /
• pp.97-116
• /
• 2019

This study is to analyze the characteristics of 2019 revised RDA and suggest the consideration in aspects of cataloging using the literature reviews. The following 3 things are suggested with analyzing the revised RDA. First, high quality data such as supplementing cataloging data and constructing vocabulary encoding schemes should be needed to transform bibliographic data to linked data for the semantic web. Second, MARC should be expanded to accept the new conept of LRM and linked data being reflected in revised RDA because MARC is the unique encoding format untile linked data will be transformed from MARC data. Third, the policy statement and the application profile are needed for describing resource consistently because each entity and element has own condition and option, and there are different elements for applying rules in revised RDA. Based on this study, the RDA related researches should be in progress such as exapanding BIBFRAME as well as MARC to accept the new concepts in revised RDA, and, also, reflecting and accepting RDA being able to use revised RDA rules and registries in libraries and nations that have been faced to revise their own cataloging rules.

• Annual Conference of KIPS
• /
• 2016.10a
• /
• pp.412-415
• /
• 2016

본 연구에서는 학술정보의 효율적 관리 및 서비스 체제를 수립하고 활용성을 강화하기 위해 논문 자동 수집 및 구축, 논문 투고 및 심사, 전자출판, XML 자동 구축에 이르기까지 전주기 기능 구현에 방안을 제시하고 이를 구현한 사례를 소개하고자 한다. 기존 Peer-Review 시스템은 데이터 수집 및 변환파트와 투고 및 심사, 전자출판 파트, XML 구축 파트 등으로 분리되거나 별도로 운영되어 왔다. 본 연구에서는 이러한 기능을 통합적으로 구현하기 위해 KISTI의 Peer-Review 시스템인 ACOMS와 XML 기반 학술정보서비스 시스템(KpubS) 기능 및 프로세스를 통합한 구현 방안을 제시하고 이를 시스템으로 구현하였다. 그러나 아직까지 원문 PDF를 XML로 완전 자동 변환할 수 있는 기술은 없는 상태로써 반자동 변환 기능을 탑재하였다. 본 연구 내용은 다양한 수집 채널을 통해 입수된 학술정보 및 XML 자료에 대한 입력체계를 제공하고, XML 본문으로부터 메타데이터를 자동 식별 및 추출하여 학술정보 DB를 구축 저장하며, 구축된 DB 및 XML 기반의 전자출판 기능 제공과 함께 웹서비스 단계까지의 전주기 공정에 대한 프로세스 모델 및 시스템에 관한 것이다. 이에 데이터베이스 구축을 위한 시간 및 비용을 절감할 수 있을뿐만 아니라, 시맨틱 태깅 및 수식, 표, 그림 정보 제공 등 이용자에게 다양한 형태의 서비스를 제공할 수 있게 되었다.

• The Journal of Society for e-Business Studies
• /
• v.19 no.1
• /
• pp.131-143
• /
• 2014

A triple database consisting of a number of three-column tables require high cost of query processing, whereby building a shortcut is known as an effective way to reduce the cost. It is important to figure out what shortcuts needs to be selectively built. Most shortcut selection algorithms make use of a benefit model that considers the query frequency. However they work poor to reflect the database update. In this paper, we consider a benefit model for triple databases. The model considers not only the profit of query response times but also the building and maintenance costs of the shortcuts. We apply the model to design a benefit function which can be plugged in a greedy-based shortcut selection algorithm. We perform the empirical experiments on a real-world dataset and analyze the effect of each factor employed in the benefit function.

• Journal of Intelligence and Information Systems
• /
• v.15 no.1
• /
• pp.87-102
• /
• 2009

With the growth of Web 2.0, lots of services allow yours to post their personal information and useful knowledges on networked information spaces such as blogs and online communities etc. As the services are generalized, recent researches related to social network have gained momentum. However, most social network services do not support machine-processable semantic knowledge, so that the information cannot be shared and reused between different domains. Moreover, as explicit definitions of relationships between individual social entities do not be described, it is difficult to analyze social network for inferring unknown semantic relationships. To overcome these limitations, in this paper, we propose a social network analysis system with personal photographic data up-loaded by virtual community users. By using ontology, an informative connectivity between a face entity extracted from photo data and a person entity which already have social relationships was defined clearly and semantic social links were inferred with domain rules. Then the inferred links were provided to yours as a visualized graph. Based on the graph, more efficient social network analysis was achieved in online community.

• Journal of KIISE:Databases
• /
• v.37 no.6
• /
• pp.333-342
• /
• 2010

Building ontology is the key factor to construct semantic web. However, this is time-consuming process. Hence, there are several approaches which automatically generate the ontologies from relational databases. Current studies on the automatic generation of the ontologies from relational database are focused on generating the ontology by analyzing the database schema and stored data. These studies generate the ontology by analyzing only tables and constraints in the schema and ignore view definitions. However, view definitions are defined by a database designer considering the domain of the database. Hence, by considering view definitions, additional classes and hierarchical relationships can be generated. And these are useful in answering queries and integration of ontologies. In this paper, we formalize the generation of classes and hierarchical relationships by analyzing existing methods, and we propose the method which generates additional classes and hierarchical relationships by analyzing view definitions. Finally, we analyze the generated ontology by applying our method to synthetic data and real-world data. We show that our method generates meaningful classes and hierarchical relationships using view definitions.

• Korean Journal of Construction Engineering and Management
• /
• v.24 no.1
• /
• pp.51-60
• /
• 2023

This paper aims to propose a method for the systematic management of construction information using ontology. In particular, it was intended to propose a method to systematically manage the construction method information required by designers and constructors. The information used in this paper is a case of test-bed construction resulting from 10 years of modernized Hanok technology development research. The new construction methods of modernized Hanok were organized using the ontology editor, Protege. To this end, the concept of ontology and the process of constructing ontology have been summarized through a review of existing research first. A conceptual diagram for constructing a domain ontology of the modernized Hanok construction methods was then proposed, and the effectiveness of the proposed domain ontology was verified using the SPARQL Query function of Protege. Finally, the defined classes and construction method metadata were published on the web using ontology web language (OWL).

• The Journal of the Korea Contents Association
• /
• v.16 no.6
• /
• pp.205-214
• /
• 2016

As a large amount of graph-structured data is widely used in various applications such as social networks, semantic web, and bio-informatics, keyword-based search over graph data has been getting a lot of attention. In this paper, we propose an efficient method for keyword search over graph data to find a set of top-k answers that are relevant as well as non-redundant in structure. We define a non-redundant answer structure for a keyword query and a relevance measure for the answer. We suggest a new indexing scheme on the relevant paths between nodes and keyword terms in the graph, and also propose a query processing algorithm to find top-k non-redundant answers efficiently by exploiting the pre-calculated indexes. We present effectiveness and efficiency of the proposed approach compared to the previous method by conducting an experiment using a real dataset.