• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.901-910
• /
• 2003

Generally, most commercial retrieval engines adopt boolean query as user's query type. Although boolean query is useful to retrieval engines that need fast retrieval, it is not easy for user to express his demands with boolean operators. So, many researches have been studied for decades about information retrieval systems using natural language query that is convenient for user. To retrieve documents that are suitable for user's demands, they have to express their demands correctly, So, this thesis proposes interactive query process agent using natural language. This agent expresses demands concrete through gradual interaction with user, When users input a natural language Query, this agent analyzes the query and generates boolean query by selecting proper keyword and feedbacks the state of the keyword selected. If the keyword is a synonymy or a polysemy, the agent expands or limits the keyword through interaction with user. It makes user express demands more concrete and improve system performance. So, this agent can improve the precision of Information Retrieval.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.148-150
• /
• 2003

최근 부각되고 있는 이동체 위치 중심의 서비스는 이동체 데이터를 효율적으로 관리하기 위한 이동체 데이터베이스를 요구하고 있으며, 이러한 이동체 데이터베이스에서는 데이터의 효율적인 저장. 관리, 질의, 표현, 가공을 위하여 이동체 질의어가 지원되어야 한다. 이동체 질의어는 LBS 뿐만 아니라 Telematics. ITS, 물류 관련 이동체 관리 시스템 등과 같이 특화된 서비스를 제공하기 위하여 필요한 데이터를 획득할 수 있는 질의구문을 포함하고 있어야 한다. 이 논문에서는 이동체 관련 서비스에서 요구하는 구문을 지원 할 수 있는 이동체 질의어를 정의하고, SQL2의 문법을 확장하여 이동체 질의 구문의 구조를 설계한다. 이동체 질의어는 사용자가 이동체 데이터베이스의 복잡한 스키마 구조를 이해하지 않더라도 원하는 데이터를 검색하기 위한 질의문을 쉽게 작성할 수 있도록 해준다.

• Journal of Information Management
• /
• v.29 no.1
• /
• pp.20-39
• /
• 1998

In order to index documents, a thesaurus which consists of terms and relationships between terms is used. When an index term is selected, retrieval performance in the information retrieval system could be improved by using the relationship between the terms in the thesaurus. Recently, the usage of a thesaurus are extended from information retrieval to language and knowledge engineering, but term relationships in a thesaurus are simply represented in equivalence, hierarchy, and association. Particularly the associative relationship is vague in its definition and range as compared with the other relationships, i.e. equivalence, hierarchy, therefore the terms that are selected through associative relationship aren't well controlled. This study examines the relationships of existing thesauri, especially the types and ranges of associative relationship, and suggests the adequate type of associative relationship.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.79-81
• /
• 2006

최근 이질 분산형태를 갖는 정보를 통합하는 방법으로서 웹 서비스 기술을 이용한 바이오 정보 시스템이 개발 구축되고 있다. 이러한 웹 서비스 기반 바이오 정보 시스템으로 Bio-MOBY. DDBJ, MyGrid Project 등을 들 수 있다. 그러나 이들 기존 시스템에서는 선택한 DB에 대한 accession 번호 검색을 지원하거나. 시스템에 등록된 서비스의 선택만이 허용되는 등 이용형태가 매우 제한적이다. 또한 서비스의 품질 평가 기능이 제공되지 않아 서비스의 관련성을 판별하지 못하며, 심지어 링크가 바르게 연결되지 않았거나, 작동하지 않는 서비스의 분별조차 불가능한 실정이다. 본 논문에서는 이러한 문제점을 해결하고자 서비스 검색과정에서 웹 서비스의 품질을 평가하고 평가된 품질을 기반으로 웹 서비스를 순위화해 사용자에게 제공하는 품질기반 UDDI를 제안한다. 이를 위해 우리는 Gene Ontology를 이용한 연관 키워드 검색방식과 키워드 기반의 서비스 품질 평가 방법을 제안하고, 본 방식의 유용성을 보인다.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.50-59
• /
• 2007

This paper describes a question analysis and expansion based on semantics for on efficient information retrieval. Results of all information retrieval systems include many non-relevant documents because the index cannot naturally reflect the contents of documents and because queries used in information retrieval systems cannot represent enough information in user's question. To solve this problem, we analyze user's question semantically, determine the answer type, and extract semantic features. And then we expand user's question using them and syntactic structures which are used to represent the answer. Our similarity is to rank documents which include expanded queries in high position. Especially, we found that an efficient document retrieval is possible by a question analysis and expansion based on semantics on natural language questions which are comparatively short but fully expressing the information demand of users.

• Journal of Information Management
• /
• v.39 no.4
• /
• pp.173-186
• /
• 2008

We propose a mash-up system for searching herb, which can search the herbal information in oriental medicine fields using the various Open APIs. We in particular developed and opened two Open APIs which enable to search papers and projects in oriental medicine fields with the general Open APIs. These Open APIs can share and provide the expert knowledge in oriental medicine fields. The information for a herb in oriental medicine fields has various names and descriptions according to their sources unlike other fields. Thus, it is hard to get the results using one or two keywords such as the general search engines. To solve this problem, we in this paper propose a way to provide the more exact and extensive search results using the herb ontology with one hundred herbal information in oriental medicine fields.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.350-352
• /
• 1998

최근 들어서 사무자동화 시스템(Office Information System), 디지털 도서관(Digital Library), WWW(WorldWideWeb)등의 응용에서는 대량의 문서들의 정보를 효율적으로 저장하고 처리, 검색할 수 있는 기능을 요구하고 있다. 이에 대해 최근에 인터넷 기반의 무서 표준인 XML(eXtensible Markup Language)이 제시되었고, 이러한 XML 문서를 저장하고 처리, 검색하기 위한 다양한 연구들이 진행되고 있다. 그러나, 이러한 대부분의 연구들은 XML 문서의 구조적 정보만을 저장하고 검색하도록 설계되어 지고 있으며, XML 문서가 지닌 또 다른 정보인 링크 정보를 저장하고 검색하는 기능을 제공되지 않고 있다. 본 논문에서는 현재 파서나 브라우저 수준에서 제공해 주는 링크의 브라우징을 확장하여 데이터베이스로 수많은 XML문서의 링크 정부들을 저장하고 저장된 링크 정보들에 대해 사용자들이 검색할 수 있는 시스템을 개발하고자 한다. 이를 위해 링크 정보를 지워할 수 있는 XML 문서에 대한 데이터 모델을 제시하고 이러한 데이터 모델로 지원할 수 있는 질의어들을 설계하였다.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.407-412
• /
• 2002

With the increasing availability of information in electronic form, it becomes more important and feasible to have automatic methods to retrieve relevant information in the internet. A deficiency of traditional information retrieval systems is that search terms are often different from those indexed by the systems. Thus, user may either retrieve wrong information or miss what they really want. In this paper, we used an automatic query expansion based on term distribution to enhance the performance of information retrieval. Also this thesis proposed the method for setting the threshold according to area distribution in order to choose additional terns.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.73-83
• /
• 2007

An information retrieval system, using exact match, needs preprocessing or query expansion to generate transliteration variants in order to search foreign word transliteration variants in the documents. This paper proposes an effective method to generate other transliteration variants from a given transliteration. Because simple rewriting of confused characters produces too many false variants, the proposed method controls the generation priority by learning confusion patterns from real uses and calculating their probability. Especially, the left and right context of a pattern is considered, and local rewriting probability and global rewriting probability are calculated to produce more probable variants in earlier stage. The experimental result showed that the method was very effective by showing more than 80% recall with top 20 generations for a transliteration variants set collected from KT SET 2.0.

• Journal of the Korean Society for information Management
• /
• v.18 no.1
• /
• pp.65-84
• /
• 2001

The purpose of this study was to design and evaluate a metadata system for internet-based syllabi in computer science. The study constructed two prototype systems for the experiment. One was constructed using only Dubline Core (DC) elements and the other was a DC-expanded system with additional eight elements that are not the part of DC elements. The thlrty subjects were chosen from those who majored in Computer Science. Two retrieval tasks were assigned to them. One was to find syllabi in which they are' interested and the other was to find relevant course syllabi for a given course title. After the search, they were asked to evaluate the systems in terms of efficiency, accuracy, and their satisfaction of the system. The result of the first experiment indicates that DC-based system performed significantly better in terms of search time and DC-expanded system in terms of satisfaction measure. An additional experiment was conducted to test efficiency of the browsing categories. The interview with subjects was carried out to find any difficulties associated with the current browsing scheme. The subjects expressed much1 satisfaction about assigning a course to multiple browsing categories.