• Journal of the Korean Society for Library and Information Science
• /
• v.53 no.1
• /
• pp.57-81
• /
• 2019

An ontology is a complex structure dictionary that defines the relationship between terms and terms related to specific knowledge in a particular field. There have been attempts to construct various ontologies in Korea and abroad, but there has not been a case in which a large scale crime investigation record is constructed as an ontology and a service is implemented through the ontology. Therefore, this paper describes the process of constructing an ontology based on information extracted from instrusion theft field of unstructured data, a crime investigation document, and implementing an ontology-based search service and a crime spot recommendation service. In order to understand the performance of the search service, we have tested Top-K accuracy measurement, which is one of the accuracy measurement methods for event search, and obtained a maximum accuracy of 93.52% for the experimental data set. In addition, we have obtained a suitable clue field combination for the entire experimental data set, and we can calibrate the field location information in the database with the performance of F1-measure 76.19% Respectively.

• The Journal of Korean Institute of Information Technology
• /
• v.17 no.7
• /
• pp.31-45
• /
• 2019

The core technologies for intelligent services today are deep learning, that is neural networks, and parallel and distributed processing technologies such as GPU parallel computing and big data. However, for intelligent services and knowledge sharing services through globally shared ontologies in the future, there is a technology that is better than the neural networks for representing and reasoning knowledge. It is a knowledge representation of IF-THEN in RIF or SWRL, which is the standard rule language of the Semantic Web, and can be inferred efficiently using the rete algorithm. However, when the number of rules processed by the rete algorithm running on a single computer is 100,000, its performance becomes very poor with several tens of minutes, and there is an obvious limitation. Therefore, in this paper, we analyze the past and current studies on parallel and distributed processing of rete algorithm, and examine what aspects should be considered to implement an efficient rete algorithm.

• Journal of Korea Entertainment Industry Association
• /
• v.13 no.8
• /
• pp.335-343
• /
• 2019

Healthy living is an essential element of human happiness. Quality eating provides the basis for life, and the health of livestock, which provides meat and dairy products, has a direct impact on human health. In the case of calves, diarrhea is the cause of all diseases.In this paper, we use a sensor to measure calf 's biometric data to diagnose calf diarrhea. The collected biometric data is subjected to a preprocessing process for use as meaningful information. We measure calf birth history and calf biometrics. The ontology is constructed by inputting environmental information of housing and biochemistry, immunity, and measurement information of human body for disease management. We will build a knowledge base for predicting calf diarrhea by predicting calf diarrhea through logical reasoning. Predict diarrhea with the knowledge base on the name of the disease, cause, timing and symptoms of livestock diseases. These knowledge bases can be expressed as domain ontologies for parent ontology and prediction, and as a result, treatment and prevention methods can be suggested.

• Journal of KIISE:Software and Applications
• /
• v.37 no.6
• /
• pp.430-445
• /
• 2010

Effective service description and modeling methodologies are essential for dynamic service composition to provide autonomous services for users in ubiquitous computing environments. In our previous research, we proposed a 'u-Service' as an abstract and structured concept for operations of devices in ubiquitous environments. In addition, we established the mechanism to structure u-Services as an ontology and the description specification to represent attributes of u-Services. However, it did not provide enough methods or standards to analyze and evaluate the effectiveness of the u-Service ontology in the design time. Since existing quality models for software products or computing systems cannot consider characteristics of ubiquitous services, they are not suitable for ubiquitous service ontology. Therefore, in this paper, we propose a quality evaluation model to design and modeling a good ubiquitous service ontology, based on our u-Service ontology building process. We extract modeling goals and evaluation indicators according to characteristics of ubiquitous service ontology, and establish quality metrics to quantify each quality sub-characteristics. The experiment result of the proposed quality evaluation model for u-Service ontologies which are constructed for our previous works shows that we can analyze the design of ubiquitous service ontology from various angles, and indicate recommendations for improvement.

• Journal of Digital Convergence
• /
• v.10 no.10
• /
• pp.215-220
• /
• 2012

This paper proposes a ontology of tree structure approach for adaptive object recognition in a situation-variant environment. In this paper, we introduce a new concept, ontology of tree structure ontology, for context sensitivity, as we found that many developed systems work in a context-invariant environment. Due to the effects of illumination on a supreme obstinate designing context-sensitive recognition system, we have focused on designing such a context-variant system using ontology of tree structure. Ontology can be defined as an explicit specification of conceptualization of a domain typically captured in an abstract model of how people think about things in the domain. People produce ontologies to understand and explain underlying principles and environmental factors. In this research, we have proposed context ontology, context modeling, context adaptation, and context categorization to design ontology of tree structure based on illumination criteria. After selecting the proper light-ontology domain, we benefit from selecting a set of actions that produces better performance on that domain. We have carried out extensive experiments on these concepts in the area of object recognition in a dynamic changing environment, and we have achieved enormous success, which will enable us to proceed on our basic concepts.

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

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.231-242
• /
• 2008

W3C has selected OWL as a standard for Web ontology description and a necessity of research on storage models that can store OWL ontologies effectively has been issued. Until now, relational model-based storage systems such as Jena, Sesame, and DLDB, have been developed, but there still remain several issues. Especially, they lead inefficient query processing performance. The structural problems of their low query processing performance are as follow: Jena has a simple structure which is not normalized and also stores most information in a single table. It exponentially decreases the performance because of comparison with unnecessary information for processing queries requiring join operations as well as simple search. The structures of storages(e.g., Sesame) have been completely normalized. Therefore it executes many join operations for query processing. The storages require many join operations to find simply a specific class. This paper proposes a storage model to resolve the problems that the query processing performance is decreased because of non-normalization or complete normalization of the existing storages. To achieve this goal, we analyze the problems of existing storage models as well as relations of OWL elements and query patterns. The proposed model, defined with the analysis results, provides an optimal normalized structure to minimize join operations or unnecessary information comparison. For the experiment of query processing performance, a LUBM data sets are used and query patterns are defined considering search targets and their hierarchical relations. In addition, this paper conducts experiments on correctness and completeness of query results to verify data loss of the proposed model, and the results are described. With the comparative evaluation results, our proposal showed a better performance than the existing storage models.

• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.282-296
• /
• 2010

OWL is an ontology language for the Semantic Web, and suited to modelling the knowledge of a specific domain in the real-world. Ontology also can infer new implicit knowledge from the explicit knowledge. However, the modeled knowledge cannot be complete as the whole of the common-sense of the human cannot be represented totally. Ontology do not concern handling nonmonotonic reasoning to detect incomplete modeling such as the integrity constraints and exceptions. A default rule can handle the exception about a specific class in ontology. Integrity constraint can be clear that restrictions on class define which and how many relationships the instances of that class must hold. In this paper, we propose a practical reasoning system for open and closed-world reasoning that supports a novel hybrid integration of ontology based on open world assumption (OWA) and non-monotonic rule based on closed-world assumption (CWA). The system utilizes a method to solve the problem which occurs when dealing with the incomplete knowledge under the OWA. The method uses the answer set programming (ASP) to find a solution. ASP is a logic-program, which can be seen as the computational embodiment of non-monotonic reasoning, and enables a query based on CWA to knowledge base (KB) of description logic. Our system not only finds practical cases from examples by the Protege, which require non-monotonic reasoning, but also estimates novel reasoning results for the cases based on KB which realizes a transparent integration of rules and ontologies supported by some well-known projects.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.92-103
• /
• 2010

The Web Ontology Language (OWL) has become the W3C recommendation for publishing and sharing ontologies on the Semantic Web. To derive hidden information from OWL data, a number of OWL reasoners have been proposed. Since OWL reasoners are memory-based, they cannot handle large-sized OWL data. To overcome the scalability problem, RDBMS-based systems have been proposed. These systems store OWL data into a database and perform reasoning by incorporating the use of a database. However, they do not consider complete reasoning on all types of properties defined in OWL and the database schemas they use are ineffective for reasoning. In addition, they do not manage updates to the OWL data which can occur frequently in real applications. In this paper, we compare various database schemas used by RDBMS-based systems and propose an improved schema for efficient reasoning. Also, to support reasoning for all the types of properties defined in OWL, we propose a complete and efficient reasoning algorithm. Furthermore, we suggest efficient approaches to managing the updates that may occur on OWL data. Experimental results show that our schema has improved performance in OWL data storage and reasoning, and that our approaches to managing updates to OWL data are more efficient than the existing approaches.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.83-91
• /
• 2011

Much research has been conducted on the e-learning systems for recommending a learning content to a student based on the difficulty of it. The difficulty is one of the most important factors for selecting a learning content. In the existing learning content recommendation systems, the difficulty of a learning content is determined by the creator. Therefore, it is not easy to apply a standard rule to the difficulty as it is determined by a subjective method. In this paper, we propose an ontology-based method for determining the difficulty of a learning content in order to provide an objective measurement. Previously, ontologies and knowledge maps have been used to recommend a learning content. However, their methods have the same problem because the difficulty is also determined by the creator. In this research, we use an ontology representing the IS-A relationships between words. The difficulty of a learning content is the sum of the weighted path lengths of the words in the learning content. By using this kind of difficulty, we can provide an objective measurement and recommend the proper learning content most suitable for the student's current level.