• Annual Conference on Human and Language Technology
• /
• 2007.10a
• /
• pp.290-294
• /
• 2007

온톨로지가 점점 복잡한 스키마와 많은 인스턴스를 갖고있지만 아직까지 수천만개 이상의 인스턴스를 가지는 온톨로지에 대해서는 고려되고 있지 않은 현실이다. 인스턴스 생성 도구의 경우 독립적 인스턴스를 생성하거나 인스턴스 생성을 지원하는 기능에 초점을 두고 있다. 하지만 관리되는 인스턴스의 수가 늘어남에 따라 기존과 같은 인스턴스 생성 방법은 인스턴스간의 관계를 맺을 때 많은 어려움을 초래하게 된다. 따라서 우리는 계층적으로 인스턴스를 생성할 수 있는 히스토리 기반의 온톨로지 인스턴스 관리 도구를 구현하였다. 예를 들어 기존의 도구들은 도메인과 레인지로 연결된 두 클래스의 인스턴스간 관계를 맺을 때는 레인지에 해당하는 인스턴스가 존재할 경우에만 가능하다. 만약 인스턴스가 존재하지 않는다면 그에 해당하는 인스턴스 생성 작업을 먼저 거친 후, 다시 이전의 생성 작업을 되풀이해야한다. 이런 번거로움을 없애고자 우리는 히스토리를 통해 현재 뷰에서 흐트러지지 않고 새로운 인스턴스를 생성하고 자동 연결할 수 있는 기능을 제공한다. 히스토리를 제공하여 현재 작업하고 있는 상태를 사용자가 인지할 수 있으며 신규 생성되는 인스턴스들을 자동으로 연결할 수 있어서 복잡한 관계의 온톨로지 인스턴스를 생성하고 관리하는데 많은 도움을 준다.

• The Journal of Society for e-Business Studies
• /
• v.9 no.4
• /
• pp.85-102
• /
• 2004

Currently, developed technologies for semantic web services discovery are based on ontologies. These ontologies are DAML-S(DARPA Agent Markup Language for Services) and Process Handbook Project of MIT. These technologies have some problems for intelligent web services discovery. So, in this paper we analyzed those ontologies and proposed TM-S, Topic Maps for Services. TM-S is the presentation model for semantic web services. And TM-S includes benefits and complements weaknesses of those ontologies. And we proposed TMS-QL, TM-S Query Language. TMS-QL is query language for intelligent web services discovery. At last, we designed and implemented intelligent web service discovery system that deals TM-S ontology and TMS-QL

• Journal of Internet Computing and Services
• /
• v.7 no.2
• /
• pp.9-21
• /
• 2006

Researches on enhancing the searching function of the web service using the ontology concept have been studying. One of them suggests a searching method for UDDI using DAML and DAML+OIL. However this approach has inconveniences to use operations proper to the circumstance and to define respective ontologies according to them. To solve these problems, we introduce an effective method of dealing with N-Triple, filtering care Triples, merging Triples, semantic connection between Triples and searching Triples for searching information and recommending the results in semantic web environment. Furthermore, we implement this proposed method in a system to test it. Finally, we test the system in the virtual semantic web environment for out research analysis.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.87-99
• /
• 2009

The top-down method for SOA delivery is recommended as a best way to take advantage of SOA. The core step of SOA delivery is the step of service modeling including service analysis and design based on ontology. Most enterprises know that the top-down approach is the best but they are hesitant to employ it because it requires them to invest a great deal of time and money without it showing any immediate results, particularly because they use well-defined component based systems. In this paper, we propose a service identification method to use a well-defined components maximally as a bottom-up approach. We assume that user's inputs generates events on a GUI and the approximate business process can be obtained from concatenating the event paths. We first find the core GUIs which have many outgoing event calls and form event paths by concatenating the event calls between the GUIs. Next, we adapt sequential pattern mining algorithms to find the maximal frequent event paths. As an experiment, we obtained business services with various granularity by applying a cohesion metric to extracted frequent event paths.

• 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 the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.11-18
• /
• 2016

Linked Data is a web standard data definition method devised to connect, expand resources with a standardized type. Linked Data built in various areas expands existing knowledge through an open data cloud like LOD(Linked Open Data). A project to link and service existing knowledge through LOD is under way worldwide. However, LOD project in domestic is being participated in a specific field to the level of research. In this paper, we suggests a method to build the area of technical knowledge like legislations in type of Linked Data, and distribute such Linked Data built to LOD. The construction method suggested by this paper divides knowledge of legislations in structural, semantic, and integrated perspective, and builds each of them by converting to Linked Data according to the perspective. Also, such built Linked Legal Data prepares to link knowledge in a standardized type by distributing them onto LOD. Built Linked Legal Data are equipped with schema for link service in various types, and give help increase understand the access type to existing legal information.

• Korean Journal of Cognitive Science
• /
• v.15 no.3
• /
• pp.35-44
• /
• 2004

As the use of internet becomes proliferated, a great amount of information is provided through diverse channels. Users require effective information providing service and we have studied the conversational agent that exchanges information between users and agents using natural language dialogue. In this paper, we develop a question answering agent providing the corresponding answer by analyzing the user's intention using artificial intelligence techniques such as pattern matching and Bayesian network We work out various problems in knowledge representation of users by constructing keyword synonym database. The proposed method is applied to designing an agent for the introduction of a fashion web site, which confirms that it responds more flexibly to the user's queries.

• Journal of Digital Convergence
• /
• v.12 no.7
• /
• pp.229-237
• /
• 2014

Today, the development and performance of a variety of smart phones is increasing with the number of smart phone users were. Advances in mobile networks and devices are spread smart phones. Smart home was increasing the interest. But until now, the study of user-centric services that the service was not implemented. Therefore, in this paper, the situation of the user, the user-centric service model that provides a smart home provisioning system OWL modeling is proposed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.623-625
• /
• 2003

The Semantic Web stands out in the next generation web, recently. In the Semantic Web, any information resources is defined by semantics and semantic links is given among these. It is different from existing web service environment. RDF (Resource Description Framework) is the data model to describe metadata of web resource and is to support for semantic links. And it is much the same as WSDL (Web Serice Description Language). In theis paper, we propose the RDF design method to improve the search performance by integrating RDF data unit with WSDL. We confirm the performance and efficiency of search will be improved by using the proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2008.04a
• /
• pp.190-193
• /
• 2008

사용자의 '참여'를 지향하는 웹2.0 서비스들은 사람간이나 정보간의 '관계'에 대한 문제에 주목하고 있다. 대표적인 서비스인 블로그는 엮인글을 통해 사용자들의 참여를 이끌고 문서를 연결하고 있으나 이를 악용하는 사례들이 발생하고 있어 이에 대한 해결을 위해 연결에 대한 분석이 요구되고 있다. 사람의 개인 정보와 친구 관계 및 주변 사물과의 관계를 모델링하는 방식인 FOAF(Friend of a Friend)는 이러한 사회연결망 분석을 가능케 하는 수단으로써 연구되고 있다. FOAF는 단순화되고 이해하기 쉬운 용어를 사용하여, 복잡하고 이해하기 어려운 시맨틱 웹의 단점을 극복하기 위한 발판으로서 또한 주목 받고 있다. 본 연구에서는 여러 웹 사이트를 하나의 ID로 이용하기 위한 OpenID를 통해 FOAF에 정보 관리 능력을 부여하여 개인정보 유출 문제를 해결하기 위한 방안을 제시한다. 또한 실제 운영되는 관리 능력을 부여하여 개인정보 유출 문제를 해결하기 위한 방안을 제시한다. 또한 실제 운영되는 사회연결망 서비스의 분석을 통해 OpenID의 정보에 따라 자동으로 사회연결망 정보를 수집하는 성장형 FOAF 프레임워크를 설계하였으며, 쉬운 FOAF를 보급하기 위한 발판을 마련하였다.