• Journal of Korean Library and Information Science Society
• /
• v.50 no.2
• /
• pp.43-60
• /
• 2019

Since information technology such as database or network technology was brought into the information and library science fields, the functions and services of libraries have drastically changed. To cope with the changes of fields, library schools have been improving curricula. This study collected curricula of library and information science in US and Korea and selected classes related to information technology. It also investigated the title keywords and keywords of class description statistically. As a result, 'system, 'database', 'network', 'programing', 'web' are major topic keywords for both countries, but 'library'shows high frequency pnly in Korea.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.202-214
• /
• 2005

The semantic web is the web paradigm that represents not general link of documents but semantics and relation of document. In addition it enables software agents to understand semantics of documents. We propose a semantic search based on inference with ontologies, which has the following characteristics. First, our search engine enables retrieval using explicit ontologies to reason though a search keyword is different from that of documents. Second, although the concept of two ontologies does not match exactly, can be found out similar results from a rule based translator and ontological reasoning. Third, our approach enables search engine to increase accuracy and precision by using explicit ontologies to reason about meanings of documents rather than guessing meanings of documents just by keyword. Fourth, domain ontology enables users to use more detailed queries based on ontology-based automated query generator that has search area and accuracy similar to NLP. Fifth, it enables agents to do automated search not only documents with keyword but also user-preferable information and knowledge from ontologies. It can perform search more accurately than current retrieval systems which use query to databases or keyword matching. We demonstrate our system, which use ontologies and inference based on explicit ontologies, can perform better than keyword matching approach .

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1058-1065
• /
• 2014

In order to assist user's who are in the process of executing a search, a query expansion method suggests keywords that are related to an input query. Recently, several studies have suggested keywords that are identified by finding domains using a clustering method over the documents that are retrieved. However, the clustering method is not relevant when presenting various domains because the number of clusters should be fixed. This paper proposes a method that suggests keywords by finding various domains related to the input queries by using a community detection algorithm. The proposed method extracts words from the top-30 documents of those that are retrieved and builds communities according to the word graph. Then, keywords representing each community are derived, and the represented keywords are used for the query expansion method. In order to evaluate the proposed method, we compared our results to those of two baseline searches performed by the Google search engine and keyword recommendation using TF-IDF in the search results. The results of the evaluation indicate that the proposed method outperforms the baseline with respect to diversity.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.6
• /
• pp.775-782
• /
• 2001

Until recently Web retrieval engine has presented a demanded document to users according to the amount and the frequency of inquired key words in each document under the assumption that the more key words a document has, the more accessible it is. This method of searching doesn't matter to a normal document such as HTML Web data in which structural information is not involved. However, Web data realized in XML contains structural information and modeling of graphic forms is also available. Therefore, in the case of XML, this method leads to no less trouble since it depends only on the frequency of key words. We consider that this problem can be resolved by way of inquiry which is similar to SQL. This form of inquiry enables us to snatch an exact data we want in a quick and clear way with a full advantage of structural quality of XML, overcoming the shortcomings of frequency-based engine. In this paper, We aim to design a model of information retrieval system of XML data using XML DOM and consider its algorithm related with it.

• Journal of the Korean Society for Library and Information Science
• /
• v.55 no.3
• /
• pp.343-372
• /
• 2021

The purpose of this study is to select keywords that can recommend books by personality type, and to test whether the chosen keywords can be actually used in the categorization and customized recommendation of books for each personality type. To achieve the research goal, this study chose books that match the level of fifth and sixth grade elementary school students and first grade middle school students and commissioned an expert group to categorize the books into groups that are preferred by each personality type. As a result of the classification, half of the books in which more than five experts agreed showed high consensus. In addition, the results of classifying books by personality type with keywords extracted by the automatic word extraction system by collecting the book review data of the selected books were similar to the results of the final judgement by the expert group, except for a few books. In conclusion, this study proved that it is possible to classify and recommend books that are likely to be preferred by different personality types using review keywords.

• 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.

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

To avoid the redundant investment on the project selection process, it is necessary to check whether the submitted research topics have been proposed or carried out at other institutions before. This is possible through the search engines adopted by the keyword matching algorithm which is based on boolean techniques in national-sized research results database. Even though the accuracy and speed of information retrieval have been improved, they still have fundamental limits caused by keyword matching. This paper examines implemented TFIDF-based algorithm, and shows an experiment in search engine to retrieve and give the order of priority for similar and redundant documents compared with research proposals, In addition to generic TFIDF algorithm, feature weighting and K-Nearest Neighbors classification methods are implemented in this algorithm. The documents are extracted from NDSL(National Digital Science Library) web directory service to test the algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.256-258
• /
• 2002

본 논문은 주어진 문서집합에 대한 유사도 검사를 통해 주어진 문서집합의 내용을 사용자가 직관적으로 파악할 수 있도록 하는 클러스터링 시각화 알고리즘에 관한 것이다. 제안하는 방법의 핵심은 주어진 문서 집합의 각 문서 사이의 유사도를 측정하여 각 문서 주변의 밀집도를 파악하고, 밀집도가 높은 문서들을 묶어 하나의 클러스터로 구성한 후, 구성된 각각의 클러스터의 키워드를 제공함으로 사용자가 해당 문서 집합의 내용을 보다 직관적으로 파악할 수 있도록 한 것이다. 우리는 TIME 데이터 집합에 대해 제시하는 알고리즘을 적용해 실험한 후 그 결과를 기존의 spherical k-means에 의해 클러스터링한 결과와 비교하여 제안하는 방법이 사용자에게 더 나은 시각화 정보를 제공함을 알아보았다.

• Journal of Technology Innovation
• /
• v.24 no.4
• /
• pp.101-126
• /
• 2016

This paper identifies core research topics and their relationships by deriving the research topic networks in the technology management field using co-word analysis. Contrary to the conventional approach in which undirected networks are constructed based on normalized co-occurrence frequency, this study analyzes directed networks of keywords by employing the confidence index of association rule mining for pairs of keywords. Author keywords included in 2,456 articles published in nine international journals of technology management in 2011~2014 are extracted and categorized into three types: THEME, METHOD, and FIELD. One-mode networks for each type of keywords are constructed to identify core research keywords and their interrelationships with each type. We then derive the two-mode networks composed of different two types of keywords, THEME-METHOD and THEME-FIELD, to explore which methods or fields are frequently employed or studied for each theme. The findings of this study are expected to be fruitfully referred for researchers in the field of technology management to grasp research trends and set the future research directions.

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

본 논문에서는 대학생들의 프로그래밍 과제물이나 프로그래밍 경진대회에 제출된 프로그램과 같이 동일한 기능을 요구받는 프로그램 소스 집합들에서 표절 행위가 있었는지를 탐색하는 새로운 알고리즘을 제시한다. 본 논문에서는 프로그램의 소스 집합에서 추출된 키워드들의 빈도수에 기반한 로그 확률값을 가중치로 하는 적응적(adaptive) 유사도 행렬을 만들어 이를 기반으로 주어진 프로그램의 유사구간을 탐색하는 지역정렬(local alignment) 방법을 소개한다. 우리는 10여개 이상의 프로그래밍 대회에 제출된 실제 프로그램으로 본 방법론을 실험하였다. 실험결과 이 방법은 이전의 고정적 유사도 행렬(일치 +1, 불일치 -1, 갭(gap)을 이용한 일치 -2)에 의한 유사구간 탐색에 비하여 여러 장점이 있음을 알 수 있었으며, 보다 다양한 표절탐색 목적으로 제시한 적응적 유사도 행렬이 응용될 수 있음을 알 수 있었다.