Myung-Joong Jeon

Large-scale incremental OWL/RDFS reasoning over fuzzy RDF data

Ontological RDF data are extracted from multiple sources on the web through mapping and alignment for various purposes, but extracting and reasoning about ontologies from different sources causes information ambiguity and uncertainty. A reasonable solution to this problem is to annotate extracted ontology data with truth values to determine the reliability of information. However, the recent growth in data has brought forth difficulties in ascertaining the credibility of numerous ontologies during OWL/RDFS reasoning. In this paper, we present a distributed and incremental reasoning approach for RDF data with uncertainty. We focused on RDFS and OWL pD* semantics and developed methods for incremental OWL reasoning with uncertainty. We also introduced parallel algorithms that resolve the scalable reasoning problem. To evaluate the efficiency of the proposed system, we conducted OWL/RDFS reasoning over fuzzy LUBM3000 and achieved a performance three times higher than that achieved with the fastest reasoning system.

Scalable Ontology Reasoning Using GPU Cluster Approach

In recent years, there has been a need for techniques for large-scale ontology inference in order to infer new knowledge from existing knowledge at a high speed, and for a diversity of semantic services. With the recent advances in distributed computing, developments of ontology inference engines have mostly been studied based on Hadoop or Spark frameworks on large clusters. Parallel programming techniques using GPGPU, which utilizes many cores when compared with CPU, is also used for ontology inference. In this paper, by combining the advantages of both techniques, we propose a new method for reasoning large RDFS ontology data using a Spark in-memory framework and inferencing distributed data at a high speed using GPGPU. Using GPGPU, ontology reasoning over high-capacity data can be performed as a low cost with higher efficiency over conventional inference methods. In addition, we show that GPGPU can reduce the data workload on each node through the Spark cluster. In order to evaluate our approach, we used LUBM ranging from 10 to 120. Our experimental results showed that our proposed reasoning engine performs 7 times faster than a conventional approach which uses a Spark in-memory inference engine.

SPARQL Query Processing System over Scalable Triple Data using SparkSQL Framework

Every year, RDFS data tends further toward scalability; hence, the manner of SPARQL processing needs to be changed for fast query. The query processing method of SPARQL has been studied using a scalable distributed processing framework. Current studies indicate that the query engine based on the scalable distributed processing framework i.e., Hadoop(MapReduce) is not suitable for real-time processing because of the repetitive tasks; in addition, it is difficult to construct a query engine based on an In-memory Distributed Query engine, because distributed structure on the low-level is required to be considered. In this paper, we proposed a method to construct a query engine for improving the speed of the query process with the mass triple data. The query engine processes the query of SPARQL using the SparkSQL, which is an In-memory based, distributed query processing framework. SparkSQL is a high-level distributed query engine that facilitates existing SQL statement. In order to process the SPARQL query, after generating the Algebra Tree using Jena, the Algebra Tree is required to be translated to Spark Algebra Tree for application in the Spark system, and construction of the system that generated the SparkSQL query. Furthermore, we proposed the design of triple property table based on DataFrame for more efficient query processing in the Spark system. Finally, we verified the validity through comparative evaluation with the query engine, which is the existing distributed processing framework.

An Approach to a Learning Prediction Model for Recognition of Daily Life Pattern based on Event Calculus

기계 학습 알고리즘의 발전에 따라 다양한 영역의 데이터에 대한 분석 및 결과를 예측하는 연구들이 진행되고 있다. 그러나 기존의 데이터 의존적인 기계 학습 기반의 의도 인지 방법론은 노이즈 처리에 대한 어려움이 존재하고, 복합적으로 발생할 수 있는 행위 의도에 대한 인지에서 한계점을 가진다. 본 한계점을 극복하기 위해 본 논문에서는 이벤트 연산(Event Calculus)을 기반으로 3단계의 행위 의도인지 방법론을 제안한다. 첫 번째 단계는 시퀀스 데이터가 어떤 의도인지를 판별하는 의도 추론 단계이다. 두 번째 단계는 새롭게 추론된 행위 의도를 기반으로 이전부터 유지됐던 행위 의도와의 병행 가능 여부를 판단하는 충돌 해결(Conflict Resolution) 단계이다. 마지막으로 많은 노이즈로 인해 발생되는 오류를 추론된 행위 의도들에 반영하는 노이즈 감소(Noise Reduction) 단계로 진행된다. 이벤트 연산 기법에 대한 성능 평가를 위해 실제 수집한 데이터를 재구축한 혼합 가우시안 모델과 휴리스틱 규칙 기반의 범용 데이터 생성 기법을 제안한다. 5개의 의도로 이루어진 약 13시간의 시퀀스 데이터 300개를 사용하여 이벤트 연산의 성능을 측정하였고, 각 의도에 대해 이벤트 연산의 예측 결과와 실제 확률 모델이 평균 89.3%의 일치 도를 보였다.

Scalable RDFS Reasoning Using the Graph Structure of In-Memory based Parallel Computing

In recent years, there has been a growing interest in RDFS Inference to build a rich knowledge base. However, it is difficult to improve the inference performance with large data by using a single machine. Therefore, researchers are investigating the development of a RDFS inference engine for a distributed computing environment. However, the existing inference engines cannot process data in real-time, are difficult to implement, and are vulnerable to repetitive tasks. In order to overcome these problems, we propose a method to construct an in-memory distributed inference engine that uses a parallel graph structure. In general, the ontology based on a triple structure possesses a graph structure. Thus, it is intuitive to design a graph structure-based inference engine. Moreover, the RDFS inference rule can be implemented by utilizing the operator of the graph structure, and we can thus design the inference engine according to the graph structure, and not the structure of the data table. In this study, we evaluate the proposed inference engine by using the LUBM1000 and LUBM3000 data to test the speed of the inference. The results of our experiment indicate that the proposed in-memory distributed inference engine achieved a performance of about 10 times faster than an in-storage inference engine.