• Information Systems Review
• /
• v.12 no.2
• /
• pp.89-104
• /
• 2010

Recently, ubiquitous sensor network (USN) has been applied to many areas including environment monitoring. A few studies applied the USN to disaster prevention and emergency management, in particular, aiming to conserve cultural heritage. USN is an useful technology to do online real-time monitoring for the purpose of early detection of the fire which is a critical cause of damage and destruction of cultural heritages. It is necessary to online monitor the cultural heritages that human has a difficulty to access or their external appearance and beauty are important, by using the USN. However, there exists false warning from USN-based monitoring systems without human intervention. In this paper, we presented an alternative to resolve the problem by applying ontology. Our intelligent fire early detection systems for conserving cultural heritages are based on ontology and inference rules, and tested under laboratory environments.

• Annual Conference on Human and Language Technology
• /
• 2009.10a
• /
• pp.111-115
• /
• 2009

현재 Open API는 프로그램 개발 및 정보의 제공 등 다양한 방향에서 많이 활용 되고 있다. Open API는 개발된 기술을 웹으로 공개하여 네트워크가 연결된 곳이라면 어디서든지 그 기술을 활용할 수 있다. 잘 개발된 Open API는 매쉬업을 통해 또 다른 기술과 합쳐 새로운 서비스를 개발하는 등 그 활용빈도가 높다. 이미 개발된 기술을 활용할 수 있어서 개발 속도가 단축되고 새로운 서비스를 개발하면서 기존의 부족한 부분을 합쳐 더욱 창의적인 정보 제공이 가능하다. 이러한 Open API의 특성을 이용하여 시맨틱 기술 개발을 지원할 수 있으며, 개발 시간 단축 및 관계 설정, 온톨로지 제공 등을 네트워크를 통해 사용자들에게 제공하고 활용할 수 있는 방법을 제시한다. 시맨틱 기술은 사람이 글을 읽고 의미를 이해하는 것처럼 컴퓨터가 이해할 수 있는 언어와 규칙들을 정해 놓아 컴퓨터 사이의 의사소통을 가능하게 하는 지능형 기술이다. 이런 시맨틱 기술 개발을 지원하기 위하여 Open API를 통해 온톨로지의 개념 및 속성, 관계 설정, 코퍼스 등을 제공하기 하기 위해 CoreOnto API라는 것을 구축했다. CoreOnto API는 네트워크에서 사용할 수 있는 Open API로 세가지의 큰 형태의 Open API를 제공하고 있다. 첫 번째, 온톨로지에 대한 클래스, 속성, 관계를 제공하는 APIs, 두 번째, 트리플(두개의 용어가 어떤 관계인지를 표현한 형태로 구성(용어1, 관계, 용어2)) 생성 및 구축된 트리플을 검색할 수 APIs, 세 번째, 온톨로지를 생성하기 위해 필요한 자원(온톨로지 명, 개체명, 관계, 코퍼스 등)을 제공하는 APIs로 구성했다. 이상과 같이 시맨틱 기술 개발을 지원하기 위한 큰 형태의 세 가지 APIs를 구축하는 방법과 APIs의 활용, 그리고 서비스를 테스트한 결과를 제시한다.

• Journal of Intelligence and Information Systems
• /
• v.19 no.1
• /
• pp.19-33
• /
• 2013

In this research, a proposed Dynamic Virtual Ontology using Tags (DyVOT) supports dynamic search of resources depending on user's requirements using tags from social web driven resources. It is general that the tags are defined by annotations of a series of described words by social users who usually tags social information resources such as web-page, images, u-tube, videos, etc. Therefore, tags are characterized and mirrored by information resources. Therefore, it is possible for tags as meta-data to match into some resources. Consequently, we can extract semantic relationships between tags owing to the dependency of relationships between tags as representatives of resources. However, to do this, there is limitation because there are allophonic synonym and homonym among tags that are usually marked by a series of words. Thus, research related to folksonomies using tags have been applied to classification of words by semantic-based allophonic synonym. In addition, some research are focusing on clustering and/or classification of resources by semantic-based relationships among tags. In spite of, there also is limitation of these research because these are focusing on semantic-based hyper/hypo relationships or clustering among tags without consideration of conceptual associative relationships between classified or clustered groups. It makes difficulty to effective searching resources depending on user requirements. In this research, the proposed DyVOT uses tags and constructs ontologyfor effective search. We assumed that tags are extracted from user requirements, which are used to construct multi sub-ontology as combinations of tags that are composed of a part of the tags or all. In addition, the proposed DyVOT constructs ontology which is based on hierarchical and associative relationships among tags for effective search of a solution. The ontology is composed of static- and dynamic-ontology. The static-ontology defines semantic-based hierarchical hyper/hypo relationships among tags as in (http://semanticcloud.sandra-siegel.de/) with a tree structure. From the static-ontology, the DyVOT extracts multi sub-ontology using multi sub-tag which are constructed by parts of tags. Finally, sub-ontology are constructed by hierarchy paths which contain the sub-tag. To create dynamic-ontology by the proposed DyVOT, it is necessary to define associative relationships among multi sub-ontology that are extracted from hierarchical relationships of static-ontology. The associative relationship is defined by shared resources between tags which are linked by multi sub-ontology. The association is measured by the degree of shared resources that are allocated into the tags of sub-ontology. If the value of association is larger than threshold value, then associative relationship among tags is newly created. The associative relationships are used to merge and construct new hierarchy the multi sub-ontology. To construct dynamic-ontology, it is essential to defined new class which is linked by two more sub-ontology, which is generated by merged tags which are highly associative by proving using shared resources. Thereby, the class is applied to generate new hierarchy with extracted multi sub-ontology to create a dynamic-ontology. The new class is settle down on the ontology. So, the newly created class needs to be belong to the dynamic-ontology. So, the class used to new hyper/hypo hierarchy relationship between the class and tags which are linked to multi sub-ontology. At last, DyVOT is developed by newly defined associative relationships which are extracted from hierarchical relationships among tags. Resources are matched into the DyVOT which narrows down search boundary and shrinks the search paths. Finally, we can create the DyVOT using the newly defined associative relationships. While static data catalog (Dean and Ghemawat, 2004; 2008) statically searches resources depending on user requirements, the proposed DyVOT dynamically searches resources using multi sub-ontology by parallel processing. In this light, the DyVOT supports improvement of correctness and agility of search and decreasing of search effort by reduction of search path.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.129-143
• /
• 2012

Recently, the rapid progress of a number of standardized web technologies and the proliferation of web users in the world bring an explosive increase of producing and consuming information documents on the web. In addition, most companies have produced, shared, and managed a huge number of information documents that are needed to perform their businesses. They also have discretionally raked, stored and managed a number of web documents published on the web for their business. Along with this increase of information documents that should be managed in the companies, the need of a solution to locate information documents more accurately among a huge number of information sources have increased. In order to satisfy the need of accurate search, the market size of search engine solution market is becoming increasingly expended. The most important functionality among much functionality provided by search engine is to locate accurate information documents from a huge information sources. The major metric to evaluate the accuracy of search engine is relevance that consists of two measures, precision and recall. Precision is thought of as a measure of exactness, that is, what percentage of information considered as true answer are actually such, whereas recall is a measure of completeness, that is, what percentage of true answer are retrieved as such. These two measures can be used differently according to the applied domain. If we need to exhaustively search information such as patent documents and research papers, it is better to increase the recall. On the other hand, when the amount of information is small scale, it is better to increase precision. Most of existing web search engines typically uses a keyword search method that returns web documents including keywords which correspond to search words entered by a user. This method has a virtue of locating all web documents quickly, even though many search words are inputted. However, this method has a fundamental imitation of not considering search intention of a user, thereby retrieving irrelevant results as well as relevant ones. Thus, it takes additional time and effort to set relevant ones out from all results returned by a search engine. That is, keyword search method can increase recall, while it is difficult to locate web documents which a user actually want to find because it does not provide a means of understanding the intention of a user and reflecting it to a progress of searching information. Thus, this research suggests a new method of combining ontology-based search solution with core search functionalities provided by existing search engine solutions. The method enables a search engine to provide optimal search results by inferenceing the search intention of a user. To that end, we build an ontology which contains concepts and relationships among them in a specific domain. The ontology is used to inference synonyms of a set of search keywords inputted by a user, thereby making the search intention of the user reflected into the progress of searching information more actively compared to existing search engines. Based on the proposed method we implement a prototype search system and test the system in the patent domain where we experiment on searching relevant documents associated with a patent. The experiment shows that our system increases the both recall and precision in accuracy and augments the search productivity by using improved user interface that enables a user to interact with our search system effectively. In the future research, we will study a means of validating the better performance of our prototype system by comparing other search engine solution and will extend the applied domain into other domains for searching information such as portal.

• Journal of Intelligence and Information Systems
• /
• v.24 no.1
• /
• pp.253-266
• /
• 2018

This paper proposes a methodology applying sequence tagging methodology to improve the performance of NER(Named Entity Recognition) used in QA system. In order to retrieve the correct answers stored in the database, it is necessary to switch the user's query into a language of the database such as SQL(Structured Query Language). Then, the computer can recognize the language of the user. This is the process of identifying the class or data name contained in the database. The method of retrieving the words contained in the query in the existing database and recognizing the object does not identify the homophone and the word phrases because it does not consider the context of the user's query. If there are multiple search results, all of them are returned as a result, so there can be many interpretations on the query and the time complexity for the calculation becomes large. To overcome these, this study aims to solve this problem by reflecting the contextual meaning of the query using Bidirectional LSTM-CRF. Also we tried to solve the disadvantages of the neural network model which can't identify the untrained words by using ontology knowledge based feature. Experiments were conducted on the ontology knowledge base of music domain and the performance was evaluated. In order to accurately evaluate the performance of the L-Bidirectional LSTM-CRF proposed in this study, we experimented with converting the words included in the learned query into untrained words in order to test whether the words were included in the database but correctly identified the untrained words. As a result, it was possible to recognize objects considering the context and can recognize the untrained words without re-training the L-Bidirectional LSTM-CRF mode, and it is confirmed that the performance of the object recognition as a whole is improved.

• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.65-93
• /
• 2005

Expert system implementation of human expert's diagnosis in art psychotherapy requires extensive knowledge on: (1) characteristics in a drawing; (2) psychological symptoms in a client; (3) relationships between the characteristics and the symptoms; (4) decision process; (5) knowledge elicitation and aquisition methods. Experts from many different fields provide such knowledge, ranging from art therapists who is on the spot, psychiatrists, psychologists, artists to knowledge engineers who know how to implement the decision system to a computer. The problems that make the implementation difficult are the expert's complex decision process and the ambiguity, the inconsistency and even the contradiction in the huge volume of the knowledge. Modeling the expert's decision process, we develope a framework of the system and then analyze and classify the knowledge. With the proposed classification, we present a suitable method of knowledge elicitation and aquisition. Then, we describe the subsets of knowledge in a unified structure using the ontology concept and Protege 2000 as a tool. Finally, we apply the system to a real case to show its usability and suitability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.164-168
• /
• 2006

최근 컴퓨터 게임에 등장하는 NPC(Non-player Character)에 각종 인공지능 기법을 적용하는 연구들이 이루어지고 있다. 하지만 대부분의 연구가 플레이어를 상대하는 적대적 입장의NPC들의 움직임 조절에 초점을 맞추고 있고 아직까지 게임 상에서 등장하는 모든 NPC는 항상 같은 말과 비슷한 행동을 되풀이하는 모습만을 보여주고 있다. 이는 플레이어가 게임을 비현실적으로 느끼게 만들고 결과적으로 게임의 재미를 저하시키는 요소로 작용한다. 플레이어에게 보다 현실적인 게임 환경을 제공하기 위해서는NPC가 단순히 게임의 배경을 구성하는 오브젝트가 아니라 다양한 대화를 통해 플레이어에게 많은 영향을 주게 하여 게임의 기여도를 높여주어야 한다. 본 논문에서는 이를 위해 게임 속에서 주어지는 퀘스트를 구성하는 NPC, 몬스터, 보상 등의 속성 정보를 온톨로지화 하고, 인터넷에 존재하는 게임 커뮤니티에서 퀘스트 질의/응답 게시판의 글을 추출하여, 플레이어의 관련 질의에 응답하는 NPC를 구현하고자 한다. 이를 위해 온톨로지 정보를 이용한 검색 알고리즘을 구현하였고,시뮬레이션을 통해 NPC가 커뮤니티 게시글 정보를 이용하여 유저에게 고정되지 않은 다양한 메시지를 전달하면서 동시에 유저의 게임 진행을 도와주는 모습을 확인하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.333-336
• /
• 2011

최근 전 세계적으로 소셜 네트워크 서비스의 사용자가 많이 증가하면서 많은 사람들이 소셜 네트워크 서비스를 이용하고 있다. 그리고 소셜 네트워크 서비스를 사용하는 사용자들은 이를 이용하여 많은 정보를 공유하고 있다. 본 논문에서는 소셜 네트워크 서비스 사용자들이 공유하는 정보 중 음악과 관련된 정보와 개방형 API 를 이용하여 MP3 파일의 메타데이터인 ID3 태그 정보를 검색한다. 검색된 결과와 소셜 네트워크 서비스 사용자 정보를 이용하여 ID3 태그 온톨로지를 생성하고 생성된 온톨로지와 온톨로지 추론기를 사용하여 음악과 관련된 다양한 순위 분석 결과와 음악 및 사용자 추천 서비스를 사용자들에게 제공하기 위한 시스템의 설계를 보인다. 본 논문에서 제안한 시스템은 소셜 네트워크 서비스에 실시간으로 등록되는 글을 이용하기 때문에 최근 음악 트렌드를 쉽게 반영한다. 또한 순위 분석을 위해 수동적으로 자료를 수집하는데 들어가는 시간적 비용을 줄여준다. 그리고 제안한 시스템을 사용하여 제공된 정보는 음악 관련 산업에서 마케팅과 사업 전략자료 등 다양한 형태로 활용이 가능하다.

• Journal of Intelligence and Information Systems
• /
• v.27 no.4
• /
• pp.49-71
• /
• 2021

Users who intend to utilize knowledge to actively solve given problems proceed their jobs with cross- and sequential exploration of associated knowledge related each other in terms of certain criteria, such as content relevance. A knowledge map is the diagram or taxonomy overviewing status of currently managed knowledge in a knowledge-base, and supports users' knowledge exploration based on certain relationships between knowledge. A knowledge map, therefore, must be expressed in a networked form by linking related knowledge based on certain types of relationships, and should be implemented by deploying proper technologies or tools specialized in defining and inferring them. To meet this end, this study suggests a methodology for developing the knowledge graph-based knowledge map using the Graph DB known to exhibit proper functionality in expressing and inferring relationships between entities and their relationships stored in a knowledge-base. Procedures of the proposed methodology are modeling graph data, creating nodes, properties, relationships, and composing knowledge networks by combining identified links between knowledge. Among various Graph DBs, the Neo4j is used in this study for its high credibility and applicability through wide and various application cases. To examine the validity of the proposed methodology, a knowledge graph-based knowledge map is implemented deploying the Graph DB, and a performance comparison test is performed, by applying previous research's data to check whether this study's knowledge map can yield the same level of performance as the previous one did. Previous research's case is concerned with building a process-based knowledge map using the ontology technology, which identifies links between related knowledge based on the sequences of tasks producing or being activated by knowledge. In other words, since a task not only is activated by knowledge as an input but also produces knowledge as an output, input and output knowledge are linked as a flow by the task. Also since a business process is composed of affiliated tasks to fulfill the purpose of the process, the knowledge networks within a business process can be concluded by the sequences of the tasks composing the process. Therefore, using the Neo4j, considered process, task, and knowledge as well as the relationships among them are defined as nodes and relationships so that knowledge links can be identified based on the sequences of tasks. The resultant knowledge network by aggregating identified knowledge links is the knowledge map equipping functionality as a knowledge graph, and therefore its performance needs to be tested whether it meets the level of previous research's validation results. The performance test examines two aspects, the correctness of knowledge links and the possibility of inferring new types of knowledge: the former is examined using 7 questions, and the latter is checked by extracting two new-typed knowledge. As a result, the knowledge map constructed through the proposed methodology has showed the same level of performance as the previous one, and processed knowledge definition as well as knowledge relationship inference in a more efficient manner. Furthermore, comparing to the previous research's ontology-based approach, this study's Graph DB-based approach has also showed more beneficial functionality in intensively managing only the knowledge of interest, dynamically defining knowledge and relationships by reflecting various meanings from situations to purposes, agilely inferring knowledge and relationships through Cypher-based query, and easily creating a new relationship by aggregating existing ones, etc. This study's artifacts can be applied to implement the user-friendly function of knowledge exploration reflecting user's cognitive process toward associated knowledge, and can further underpin the development of an intelligent knowledge-base expanding autonomously through the discovery of new knowledge and their relationships by inference. This study, moreover than these, has an instant effect on implementing the networked knowledge map essential to satisfying contemporary users eagerly excavating the way to find proper knowledge to use.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.468-475
• /
• 2012

Nurses have performed their nursing practice according to the standard guidelines such as NANDA, NIC, and NOC, and recorded the information on nursing process into EMR system. In particular, NANDA, nursing diagnosis taxonomy, has difficulty expressing nursing diagnosis in detail because it represents abstract concepts of nursing diagnosis. So, the hospitals in KOREA have developed and used the list of nursing diagnosis on their own without referring the international standard terminologies, and it caused the delay of computerization of nursing records. Therefore, we proposed a ontology development methodology on nursing diagnosis based on NANDA and SNOMED-CT. The developed ontology, systematically developed with the frequently used nursing diagnosis terminologies in each hospital, based on the proposed methodology enables knowledge expansion and interoperable exchange of nursing records between EMR systems. We developed an ontology using the 112 nursing diagnosis terms defined by extracting and refining information on nursing diagnosis recorded in Kyungpook National University Hospital. We also confirmed the content validity and the usefulness of the developed ontology through expert assessment and experiment.