• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.35-48
• /
• 2017

Extracting temporal information from documents is becoming more important, because it can be used to various applications such as Question-Answering (QA) systems, Recommendation systems, or Information Retrieval (IR) systems. Most previous studies only focus on English documents, and they are not applicable to the other languages due to the inherent characteristics of languages. In this paper, we propose a new system, named ExoTime, designed to extract temporal information from Korean documents. The ExoTime adopts an external Knowledge Base (KB) in order to achieve better prediction performance, and it also applies a bagging method to the temporal relation prediction. We show that the effectiveness of the proposed approaches by empirical results using Korean TimeBank. The ExoTime system works as a part of ExoBrain that is an artificial intelligent QA system.

• Journal of the Korean Society for Library and Information Science
• /
• v.23
• /
• pp.33-62
• /
• 1992

The purpose of this is to evaluate the contents through the anal us is of the merits and demerits, and its special quality of the Cutter-Sanborn Three-figure Author Table. table. The abstract of this study is as follows : With the results of the analysis of Cutter-Sanborn's Tabls, several advent-age were found in the area of enumerative-ordinal numbering system, mixed notation, and information retrieval. A defect is that each corporate author and serials and reference book's titles are difficult to be numbered, and there is serious diviation in percentages of the numbers assigned to each letter because each letter apportion rate was applied without any criteria. Such phenomenon decrease the effectiveness as author notation in several letters. The separation of headings are seriously unbalanced because the separation of heading is not consistent with actual publishing trends. This phenomenon made difficult individualization of materials in several letters.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.596-605
• /
• 2005

Conventional XML query methods such as simple keyword match or structural query expansion are not sufficient to catch the underlying information in the documents. Moreover, these methods inefficiently try to query all the documents. This paper proposes document tittering and query expansion methods that are based on ontology. Using ontology, we construct a universal DTD that can filter off unnecessary documents. Then, query expansion method is developed through the analysis of concept hierarchy and association among concepts. The proposed methods are applied on variety of sample XML documents to test the effectiveness.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.629-637
• /
• 2000

The content-based information retrieval for a multimedia database uses feature information extracted from the compressed videos. This paper presents an effective method to detect scene changes from compressed videos. Scene changes are detected with DC values of DCT coefficients in MPEG-1 encoded video sequences. Instead of decoding full frames. partial macroblocks of each frame, horizontal and vertical macroblocks, are decoded to detect scene changes. This method detects abrupt scene changes by decoding minimal number of blocks and saves a lot of computation time. The performance of the proposed algorithm is analyzed based on the precision and the recall. The experimental results show the effectiveness in computation time and detection rate to detect scene changes of various MPEG-1 video streams.

• Journal of the Korean Society for Library and Information Science
• /
• v.37 no.4
• /
• pp.178-198
• /
• 2003

Mutual information as an association measure, has been used for various purposes as well as for calculating term similarity. There we, however, some limits in mutual information. It tends to emphasize low frequency terms extremely because the marginal value of mutual information changes inversely to frequency of terms. To compensate for this limit this study suggests relative mutual information(RMI) coefficients which normalize mutual information, and examines their characteristics in some details. The RMI coefficients also improve effectiveness of global query expansion when they are adapted to three different collections.

• Journal of the Korean Society for information Management
• /
• v.13 no.1
• /
• pp.227-241
• /
• 1996

We present development results for a Hangul thesaurus which was provided to improve performance of the intelligent information retrieval system. The important stages and methods in the process of term acquisition, classification, creation of the consistency-effectiveness relationship using HiTEL menu and text of dictionary are described. To cany out our study we have built a thesaurus management system and also describe its utility functions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.481-483
• /
• 2002

본 논문에서는 데이터 결합 영역에서 문서값을 정규화 하는 기법과 결합함수에 따라 용어가중치 결합이 검색성능에 어떤 영향을 미치는가를 분석하였으며, 특히 용어가중치 결합이 실질적으로 효율적인가를 성능 향상률 측면과 검색시스템의 효율성 측면에서 검증하고, 성능이 향상된 용어가중치 결합의 특징을 분석하였다. 실헙결과 대부분의 장어가중치 결합은 문서값 정규화 기법과 실험집단에 관계없이 높은 성능 향상률을 보이지 않았다. 특히 단일가중치고 높은 검색성능을 보였던 상위 가중치 알고리즘들은 다른 가중치 알고리즘과 결합할 경우 두드러진 성능 향상률을 보이지 않았다. 검색시스템의 효율성 측면에서 용어가중치 결합을 평가한 결과 문헌 내 단어빈도를 최대단어 빈도로 정규화한 가중치 알고리즘이 코사인 정규화 기법을 적용한 가중치 알고리즘들과 결합될 때 5개 실험집안에서 최적 단일가중치 보다 2% 이상 높은 성능을 보였다. 이는 서로 다른 특성을 지니는 용어가중치 알고리즘들이 장단점을 보완하여 검색성능을 향상시킨 수 있다는 것을 의미한다. 그러나 용어가중치 결합의 효율성은 컬렉션과 가중치 알고리즘의 특성에 의존적이었으며, 비록 각 용어가중치 결합의 성능이 높게 나타날지라도 최적의 성능을 보인 달일가중치와 비교하면 그 성능 차이가 미미하거나 낮아서 대부분의 용어가중치 결합이 실질적으로 효과적이지 못하였다.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1408-1411
• /
• 2002

In this paper, we propose a method that converts motion vectors on MPEG coded domain as a uniform set, independent of the frame type and the direction of prediction, and directly utilizes these normalized motion vectors for understanding video contents. This frame-type-independent motion vectors are utilized as feature information for image retrieval or moving object tracking on compressed domain. By simulation, we evaluate the effectiveness of the proposed method and compare its performance to the conventional method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.90-99
• /
• 2003

Object clustering, which makes classification for a set of objects into a number of groups such that objects included in a group have similar characteristic and objects in different groups have dissimilar characteristic each other, has been exploited in diverse area such as information retrieval, data mining, group technology, etc. In this study, an object-clustering problem with similarity coefficients between objects is considered. At first, an evaluation function for the optimization problem is defined. Then, a genetic algorithm and local optimization technique based on heuristic method are proposed and used in order to obtain near optimal solutions. Solutions from the genetic algorithm are improved by local optimization techniques based on object relocation and cluster merging. Throughout extensive experiments, the validity and effectiveness of the proposed algorithms are tested.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2001.08a
• /
• pp.137-142
• /
• 2001

본 논문에서는 벡터모델과 신경망 모델을 이용하여 데이터 퓨전의 관점에서 다중증거로서 가중치, 문헌분리가, 엔트로피, 공기유사도를 적절히 결합하여 질의를 확장하는 방법을 제안한다. 실험결과 코사인 정규화 가중치 알고리즘, 문서길이 정규화 가중치 알고리즘과 결합하여 질의를 확장하는 것이 정규화시키지 않고 단순히 문헌빈도와 역문헌빈도의 조합을 이용한 가중치 알고리즘과 결합했을 때 보다 평균 정확률 향상이 더 높게 나타났다. 또한 다양한 공기기반 유사도를 이용하여 질의확장을 한 결과 벡터모델과 신경망 모델에서 코사인 공기유사도에 기반하여 질의확장한 경우가 다른 공기유사도에 비해 더 좋은 성능을 보였다.