• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.386-390
• /
• 2007

In this paper we present an Ontology Instance Management Tool. OntoManager is a user-friendly interactive ontology Instance management tool with webpage annotation tool and an image annotation tool. It supports the user with the task of creating and maintaining ontology-based OWL-markup, creating of OWL-instances, attributes and relationships. It include an ontology browser for the exploration of the ontology and instances and a HTML browser that will display the annotated parts of the text. And OntoManager is an image annotation tool that allows users to markup regions of an image with respect to concepts in an ontology. It provides the functionality to import images, ontologies, instance bases, perform markup, and export the resulting annotations to disk or the Web.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2005.10a
• /
• pp.450-455
• /
• 2005

Effective information "query and retrieval" process is one of the fundamental problems in the field communication and information science and has become especially important due to dramatic increase in magnitude of information to be processed in modern era. Of particular importance at information exchange process, our study focuses on compositions of proper queries and retrieval of rural amenity resources. This particular task has been difficult because the rural amenity resources does not necessarily carry measurable traits and also contains huge amount of data. In this Letter, we propose an alternative approach to the architecture of the resource information system by use of a noble retrieval algorithm based on ontology. Test of efficiency and applicability of this new scheme was conducted, and it showed that this has possibility to be effective information retrieval process of rural amenity resources.

• Journal of Information Technology Services
• /
• v.9 no.3
• /
• pp.179-191
• /
• 2010

Service identification and composition is one of the key characteristics for a successful Service-Oriented Computing, being receiving a lot of attention from researchers in recent years. In the Service-Oriented Analysis, the identification of business services has to be preceded before application services are identified. Most approaches addressing the derivation of business services are based on heuristic methods and human experts. The manual identification of business services is highly expensive and ambiguous task, and it may result in the service design with bad quality because of errors and misconception. Although a few of approaches of automatic service identification are proposed, most of them are in focus on technical architectures and application services. In this paper, we propose a model on the automatic identification of business services by horizontal and vertical service alignment using Enterprise Architecture as an ontology. We verify the effectiveness of the proposed model of business services identification through a case study based on Department of Defense Enterprise Architecture.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.663-667
• /
• 2010

A simple approach to semantic document-retrieval is to measure document similarity based on the bag-of-words representation, e.g., cosine similarity between two document vectors. However, such a syntactic method hardly considers the semantic similarity between documents, often producing semantically-unsound search results. We circumvent such a problem by combining supervised machine learning techniques with ontology information based on Markov logic. Specifically, Markov logic networks are learned from similarity-tagged documents with an ontology representing the diverse relationship among words. The learned Markov logic networks, the ontology, and the training documents are applied to the semantic document-retrieval task by inferring similarities between a query document and the training documents. Through experimental evaluation on real world question-answering data, the proposed method has been shown to outperform the simple cosine similarity-based approach in terms of retrieval accuracy.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1496-1515
• /
• 2017

One of the most visible developments in Decision Support Systems (DSS) was the emergence of rule-based expert systems. Hence, despite their success in many sectors, developers of Medical Rule-Based Systems have met several critical problems. Firstly, the rules are related to a clearly stated subject. Secondly, a rule-based system can only learn by updating of its rule-base, since it requires explicit knowledge of the used domain. Solutions to these problems have been sought through improved techniques and tools, improved development paradigms, knowledge modeling languages and ontology, as well as advanced reasoning techniques such as case-based reasoning (CBR) which is well suited to provide decision support in the healthcare setting. However, using CBR reveals some drawbacks, mainly in its interrelated tasks: the retrieval and the adaptation. For the retrieval task, a major drawback raises when several similar cases are found and consequently several solutions. Hence, a choice for the best solution must be done. To overcome these limitations, numerous useful works related to the retrieval task were conducted with simple and convenient procedures or by combining CBR with other techniques. Through this paper, we provide a combining approach using the multi-criteria analysis (MCA) to help, the traditional retrieval task of CBR, in choosing the best solution. Afterwards, we integrate this approach in a decision model to support medical decision. We present, also, some preliminary results and suggestions to extend our approach.

• Journal of Information Processing Systems
• /
• v.3 no.1
• /
• pp.38-42
• /
• 2007

Microarray data includes tens of thousands of gene expressions simultaneously, so it can be effectively used in identifying the phenotypes of diseases. However, the retrieval of functional information from a large corpus of gene expression data is still a time-consuming task. In this paper, we propose an efficient method for identifying functional categories of differentially expressed genes from a micro-array experiment by using Gene Ontology (GO). Our method is as follows: (1) The expression data set is first filtered to include only genes with mean expression values that differ by at least 3-fold between the two groups. (2) The genes are then ranked based on the t-statistics. The 100 most highly ranked genes are selected as informative genes. (3) The t-value of each informative gene is imposed as a score on the associated GO terms. High-scoring GO terms are then listed with their associated genes and represent the functional category information of the micro-array experiment. A system called HMDA (Hallym Micro-array Data analysis) is implemented on publicly available micro-array data sets and validated. Our results were also compared with the original analysis.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.1
• /
• pp.86-99
• /
• 2011

Due to the uncertainty of intention recognition for behaviors of users, the intention is differently recognized according to the situation for the same behavior by the same user, the accuracy of user intention recognition by minimizing the uncertainty is able to be improved. This paper suggests a novel ontology-based method to recognize user intentions, and able to minimize the uncertainties that are the obstacles against the precise recognition of user intention. This approach creates ontology for user intention, makes a hierarchy and relationship among user intentions by using RuleML as well as Dynamic Bayesian Network, and improves the accuracy of user intention recognition by using the defined RuleML as well as the gathered sensor data such as temperature, humidity, vision, and auditory. To evaluate the performance of robot proactive planning mechanism, we developed a simulator, carried out some experiments to measure the accuracy of user intention recognition for all possible situations, and analyzed and detailed described the results. The result of our experiments represented relatively high level the accuracy of user intention recognition. On the other hand, the result of experiments tells us the fact that the actions including the uncertainty get in the way the precise user intention recognition.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.60-67
• /
• 2009

Analyzing protein-protein interactions(PPI) is an important task in bioinformatics as it can help in new drugs' discovery process. However, due to vast amount of PPI data and their complexity, efficient visualization of the data is still remained as a challenging problem. We have developed efficient and effective visualization system that integrates Gene Ontology(GO) and PPI network to provide better insights to scientists. To provide efficient data visualization, we have employed dynamic interactive graph drawing methods and context-based browsing strategy. In addition, quick and flexible cross-reference system between GO and PPI; LCA(Least Common Ancestor) finding for GO; and etc are supported as special features. In terms of interface, our visualization system provides two separate graphical windows side-by-side for GO graphs and PPI network, and also provides cross-reference functions between them.

• The Journal of Society for e-Business Studies
• /
• v.21 no.4
• /
• pp.1-14
• /
• 2016

Semantic search is known as a series of activities and techniques to improve the search accuracy by clearly understanding users' search intent without big cognitive efforts. Usually, semantic search engines requires ontology and semantic metadata to analyze user queries. However, building a particular ontology and semantic metadata intended for large amounts of data is a very time-consuming and costly task. This is why commercialization practices of semantic search are insufficient. In order to resolve this problem, we propose a novel semantic search method which takes advantage of our previous semantic tensor space model. Since each term is represented as the 2nd-order 'document-by-concept' tensor (i.e., matrix), and each concept as the 2nd-order 'document-by-term' tensor in the model, our proposed semantic search method does not require to build ontology. Nevertheless, through extensive experiments using the OHSUMED document collection and SCOPUS journal abstract data, we show that our proposed method outperforms the vector space model-based search method.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.114-129
• /
• 2006

Ontology mapping is the task of finding semantic correspondences between two ontologies. In order to improve the effectiveness of ontology mapping, we need to consider the characteristics and constraints of data models used for implementing ontologies. Earlier research on ontology mapping, however, has proven to be inefficient because the approach should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. In this paper, we propose a multi-strategic mapping approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constraints of the topic maps. Our multi-strategic mapping approach includes a topic name-based mapping, a topic property-based mapping, a hierarchy-based mapping, and an association-based mapping approach. And it also uses a hybrid method in which a combined similarity is derived from the results of individual mapping approaches. In addition, we don't need to generate a cross-pair of all topics from the ontologies because unmatched pairs of topics can be removed by characteristics and constraints of the topic maps. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Yahoo german literature dictionary as input ontologies. Our experiments show that the automatically generated mapping results conform to the outputs generated manually by domain experts, which is very promising for further work.