• Journal of KIISE:Software and Applications
• /
• v.36 no.5
• /
• pp.401-410
• /
• 2009

In order to derive hidden information (concept subsumption, concept satisfiability and realization) of OWL ontology, a number of OWL reasoners have been introduced. The most of these ontology reasoners were implemented using the tableau algorithm. However most reasoners simply report this information without providing a justification for any arbitrary entailment and unsatisfiable concept derived from OWL ontologies. The purpose of this paper is to investigate an optimized method for non-deterministic rule of the tableau algorithm and finding axioms to cause inconsistency in ontology. In this paper, therefore, we propose an optimized method for non-deterministic rule and finding axiom to cause inconsistency using NATMS. In the first place, we introduce Dependency Directed Backtracking to deal non-deterministic rule, a tableau-based decision procedure to find unsatisfiable axiom Furthermore we propose an improved method adapting NATMS.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.1-17
• /
• 2007

A virtual enterprise (VE) can be mapped into a multi-agent system (MAS) that consists of various agents with specific role(s), communicating with each other to accomplish common goal(s). However, a MAS for enacting VE requires more advanced mechanism such as context that can guarantee autonomy and dynamism of VE members considering heterogeneity and complex structure of them. This paper is to suggest a context-based MAS as a platform for constructing and managing virtual enterprises. In the Context-based MAS a VE is a collection of Actor, Interaction (among Actors), Actor Context, and Interaction Context. It can raise the speed and correctness of decision-making and operation of VE enactment using context, i.e., information about the situation (e.g., goal, role, task, time, location, media) of Actors and Interactions, as well as simple data of their properties. The Context-based MAS for VE we proposed('VECoM') may consists of Context Ontology, Context Model, Context Analyzer, and Context Reasoner. The suggested approach and system is validated through an example where a VE tries to find a partner that could join co-development of new technology.

• Journal of KIISE
• /
• v.45 no.3
• /
• pp.224-233
• /
• 2018

Recently, there are many of studies on SWRL reasoning engine based on user-defined rules in a distributed environment using a large-scale ontology. Unlike the schema based axiom rules, efficient inference orders cannot be defined in SWRL rules. There is also a large volumet of network shuffled data produced by unnecessary iterative processes. To solve these problems, in this study, we propose a method that uses Map-Reduce algorithm and distributed in-memory framework to deduce multiple rules simultaneously and minimizes the volume data shuffling occurring between distributed machines in the cluster. For the experiment, we use WiseKB ontology composed of 200 million triples and 36 user-defined rules. We found that the proposed reasoner makes inferences in 16 minutes and is 2.7 times faster than previous reasoning systems that used LUBM benchmark dataset.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.2
• /
• pp.53-60
• /
• 2020

Sentiment analysis is the automated process of understanding attitudes and opinions about a given topic from written or spoken text. One of the sentiment analysis approaches is a dictionary-based approach, in which a sentiment dictionary plays an much important role. In this paper, we propose a method to automatically generate Korean sentiment lexicon from the well-known English sentiment lexicon called VADER (Valence Aware Dictionary and sEntiment Reasoner). The proposed method consists of three steps. The first step is to build a Korean-English bilingual lexicon using a Korean-English parallel corpus. The bilingual lexicon is a set of pairs between VADER sentiment words and Korean morphemes as candidates of Korean sentiment words. The second step is to construct a bilingual words graph using the bilingual lexicon. The third step is to run the label propagation algorithm throughout the bilingual graph. Finally a new Korean sentiment lexicon is generated by repeatedly applying the propagation algorithm until the values of all vertices converge. Empirically, the dictionary-based sentiment classifier using the Korean sentiment lexicon outperforms machine learning-based approaches on the KMU sentiment corpus and the Naver sentiment corpus. In the future, we will apply the proposed approach to generate multilingual sentiment lexica.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.2
• /
• pp.225-238
• /
• 2012

Among the various security threats in online games, the use of game bots is the most serious problem. In this paper, we propose a framework for user behavior analysis for bot detection in online games. Specifically, we focus on party play that reflects the social activities of gamers: In a Massively Multi-user Online Role Playing Game (MMORPG), party play log includes a distinguished information that can classify game users under normal-user and abnormal-user. That is because the bot users' main activities target on the acquisition of cyber assets. Through a statistical analysis of user behaviors in game activity logs, we establish the threshold levels of the activities that allow us to identify game bots. Also, we build a knowledge base of detection rules based on this statistical analysis. We apply these rule reasoner to the sixth most popular online game in the world. As a result, we can detect game bot users with a high accuracy rate of 95.92%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.2
• /
• pp.370-396
• /
• 2024

COVID-19 was declared a pandemic by the World Health Organization (WHO) on 30 January 2020. The lifestyle of people all over the world has changed since. In most cases, the pandemic has appeared to create severe mental disorders, anxieties, and depression among people. Mostly, the researchers have been conducting surveys to identify the impacts of the pandemic on the mental health of people. Despite the better quality, tailored, and more specific data that can be generated by surveys,social media offers great insights into revealing the impact of the pandemic on mental health. Since people feel connected on social media, thus, this study aims to get the people's sentiments about the pandemic related to mental issues. Word Cloud was used to visualize and identify the most frequent keywords related to COVID-19 and mental health disorders. This study employs Majority Voting Ensemble (MVE) classification and individual classifiers such as Naïve Bayes (NB), Support Vector Machine (SVM), and Logistic Regression (LR) to classify the sentiment through tweets. The tweets were classified into either positive, neutral, or negative using the Valence Aware Dictionary or sEntiment Reasoner (VADER). Confusion matrix and classification reports bestow the precision, recall, and F1-score in identifying the best algorithm for classifying the sentiments.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1195-1206
• /
• 2015

For the management of a knowledge system, systems that automatically infer and manage scalable knowledge are required. Most of these systems use ontologies in order to exchange knowledge between machines and infer new knowledge. Therefore, approaches are needed that infer new knowledge for scalable ontology. In this paper, we propose an approach to perform rule based reasoning for scalable SHIF ontologies in a spark framework which works similarly to MapReduce in distributed memories on a cluster. For performing efficient reasoning in distributed memories, we focus on three areas. First, we define a data structure for splitting scalable ontology triples into small sets according to each reasoning rule and loading these triple sets in distributed memories. Second, a rule execution order and iteration conditions based on dependencies and correlations among the SHIF rules are defined. Finally, we explain the operations that are adapted to execute the rules, and these operations are based on reasoning algorithms. In order to evaluate the suggested methods in this paper, we perform an experiment with WebPie, which is a representative ontology reasoner based on a cluster using the LUBM set, which is formal data used to evaluate ontology inference and search speed. Consequently, the proposed approach shows that the throughput is improved by 28,400% (157k/sec) from WebPie(553/sec) with LUBM.