• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.75-77
• /
• 2021

A variety of search engines are currently in use. The search engine supports the retrieval of data required by users through three stages: crawling, index generation, and output of search results based on meta-tag information. However, a large number of documents obtained by searching for keywords are often unrelated or scarce. Because of these problems, it takes time and effort to grasp the content from the search results and classify the accuracy. The index of search engines is updated periodically, but the criteria for weighted values and update periods are different from one search engine to another. Therefore, this paper uses the LSTM model, which extracts the relationship between keywords entered by the user and documents instead of the existing search engine, and improves the relationship between keywords and documents by entering keywords that the user wants to find.

• Journal of the Korean Society for information Management
• /
• v.21 no.4 s.54
• /
• pp.281-294
• /
• 2004

Association measures are applied to various applications, including information retrieval and data mining. Each association measure is subject to a close examination to its tendency to prefer high or low frequency level because it has a significant impact on the performance of applications. This paper examines the frequency level preference(FLP) tendency of some popular association measures using artificially generated cooccurrence data, and evaluates the results. After that, a method of how to adjust the FLP tendency of major association measures such as cosine coefficient is proposed. This method is tested on the cooccurrence-based query expansion in information retrieval and the result can be regarded as promising the usefulness of the method. Based on these results of analysis and experiment, implications for related disciplines are identified.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.2
• /
• pp.65-72
• /
• 2012

In the 21st century of information systems, the amount of information resources are ever increasing and the role of information searching system is becoming criticalto easily acquire required information from the web. Generally, it requires the user to have enough pre-knowledge and superior capabilities to identify keywords of information to effectively search the web. However, most of the users undertake searching of the information without holding enough pre-knowledge and spend a lot of time associating key words which are related to their required information. Furthermore, many search engines support the keywords searching system but this only provides collection of similar words, and do not provide the user with exact relational search information with the keywords. Therefore this research report proposes a method of offering expanded user relationship search keywords by analyzing user query patterns to provide the user a system, which conveniently support their searching of the information.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.27-33
• /
• 2006

In this thesis, we presents the component design and retrieval prototype system which can retrieve the most appropriate component for reuse system. If it used only an abject to reuse unit, it can not understand mutual reaction and can not sustain relationship between objects. Therefore, we porposed clustering component for reuse unit. It makes to understand relationship and reaction between object, so User can retrieve the proper component for reuse system. And porposed retrieval prototype system can select the correct things. it provide 3 facet retrieval environment against ambiguous retrieval definition.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.100-107
• /
• 2009

This paper is focused on the medical CRM system design for a hospital custom management. CRM systems provides information and seminars to whom are necessity. For this, priority retrieval and similarity retrieval are able to be in the personnel order and the regional. The customer receives the message which sends out from the hospital, The hospital manages the message which reveals a participation intention in the seminar at real-time. The hospital grasps the participation degree of the seminar where the customer will participate and manages the patients who participate to the seminar actively, and when the next seminar will be hold, we designed the system able to provide the service as early as possible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.541-548
• /
• 2005

IP lookup and forwarding process becomes the bottleneck of packet transmission as IP traffic increases. Previous hardware-based IP address lookup schemes using an index-based table are not memory-efficient due to sparse distribution of the routing prefixes. In this paper, we propose memory-efficient hardware based IP lookup scheme called set-associative IP address lookup scheme, which provides the same IP lookup speed with much smaller memory requirement. In the proposed scheme, an NHA entry stores the prefix and next hop together. The IP lookup procedure compares a destination IP address with eight entries in a corresponding set simultaneously and finds the longest matched prefix. The memory requirement of the proposed scheme is about $42\%$ of that of Lin's scheme. Thus, the set-associative IP address lookup scheme is a memory-efficient hardware based IP address lookup scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.556-558
• /
• 2001

전체 영상을 이용하지 않고 영상 안에 포함된 특정 객체 혹은 영역만을 이용하는 "영역에 의한 질의(query-by-region)" 방법은 내용기반 영상 검색 중 상위개념의 방법 이지만, 영상 분할의 한계, 여러개로 분할된 영역을 모두 검색하기 위한 인덱싱 문제, 유사성 측정 시 선형적으로 분리되지 않는 특징 값들에 대한 무리한 선형 조합으로 인한 검색 오류와 같은 많은 문제점을 안고 있다. 따라서 본 논문에서는 영역 기반 영상 검색 시스템인 FRIP에 대하여 영상 분할의 한계를 극복하고, 사용자의 주관성을 영상 검색에 적용하기 위해 확률적 연관성 학습 모델(MPFRL)을 유사성 측정 단계에서 적용 하였고, 아울러 검색 모델로는 기존에 일반적으로 사용되어 오던, 선형 모델을 사용하지 않고 선형 모델보다 유연한 검색 결과를 보여주는 확률적 이접 부울 모델(PDB)을 사용하였다. 또한, 검색 시간을 단축 시키기 위해, 선형 검색 방법에 부울 AND 연산자를 적용 시킴으로써, 검색 시간을 상당부분 단축 할 수 있었다. 실험 결과, 본 논문에서 제안하는 방법(MPFRL+PDB)을 사용할 경우 검색 결과가 선형 조합 보다 향상되는 것을 알 수 있었다. 아울러 사용자 피드백을 통해 사용자가 특징 가중치를 일일이 조절하지 않더라도 단순한 몇 번의 클릭만으로 사용자의 주관성을 반영하고 보다 정확한 검색 결과를 보여 줄 수 있는 시스템을 설계 할 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7C
• /
• pp.619-626
• /
• 2012

With the service suggesting additional extended or related query, search engines aim to provide their users more convenience. The extended or related query suggestion service based on popularity, or by how many people have searched on web using the query, has limitations to elevate users' satisfaction, because each user's preference and interests differ. This paper will demonstrate the design and realization of the system that suggests extended query appropriate for users' demands, and also an improvement in the computing process between entering the first search word and the subsequent extension to the related themes. According to the evaluation the proposed system suggested 41% more extended or related query than when searching on Google, and 48% more than on Yahoo. Also by improving the shortcomings of the extended or related query system based on general popularity rather than each user's preference, the new system enhanced users' convenience further.

• Journal of Internet Computing and Services
• /
• v.11 no.3
• /
• pp.15-24
• /
• 2010

In this paper, we propose an image classification which combines semantic relations of tags with contents of images to improve the satisfaction of image retrieval on application domains as huge image sharing sites. To make good use of image retrieval or classification algorithms on huge image sharing sites as Flickr, they are applicable to real tagged Web images. To classify the Web images by 'bag of visual word' based image content, our algorithm includes training the category model by utilizing the preliminary retrieved images with semantically related tags as training data and classifying the test images based on PLSA. In the experimental results on the Flickr Web images, the proposed method produced the better precision and recall rates than those from the existing method using tag information.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.130-131
• /
• 2014

시맨틱 웹은 1998년 웹의 창시자인 Tim Berners Lee가 제안을 한 웹 기술로써 인간의 언어를 이해하고 인간과 쉽게 의사소통이 가능한 네트워크를 말한다. 즉 컴퓨터 스스로 웹에 연결된 정보의 의미를 인식하고 사용자가 필요로 하는 정보를 검색하며 검색된 정보에서 지식을 유추할 수 있는 기능을 제공하는 지능형 웹 환경이다. 이런 시맨틱 웹 개념을 적용한 사례로는 네이버 시맨틱 웹 영화검색 이있다. 본 논문에서는 네이버 시맨틱 웹 영화검색 시스템을 벤치마킹한 도서검색 서비스 설계를 제안하고자 한다. 본 도서검색 서비스는 온톨로지 개념을 적용하여 도서와 관련된 검색 카테고리를 설정하며, 간단한 시나리오는 다음과 같다. 한 권의 책을 검색하면 해당 책과 연관된 첫 번째 카테고리로 출판사, 제작한 년도, 저자, 장르, 관련 검색 도서 등의 데이터들이 상단에 제시된다. 제시된 카테고리에서 임의의 항목을 선택하면 그 하단 공백에 선택된 항목과 연관된 카테고리에 해당하는 항목들이 제시된다. 예를 들어, 출판사를 선택한다면 해당 출판사에서 출간된 도서들이 하단 공백에 열거가 되고 상단 두 번째 카테고리에 원작국가, 저자 관련 책, 수상정보, 공동 집필자, 책을 원작으로 확장된 컨텐츠 등 또 다른 카테고리가 우측으로 생성이 되며 선택을 할 수 있게 된다. 본 논문에서 제안하는 시맨틱 웹 기반 도서검색 서비스는 사용자가 검색하고자 하는 정보를 보다 효율적이고 사용자 중심에서 제공할 수 있다고 사료된다.