• Spatial Information Research
• /
• v.17 no.1
• /
• pp.1-14
• /
• 2009

Demands for a system which enable users to retrieve any kind of geographic and regional information over the Web have been increasing. However, in order to obtain geographic or regional information over the web, users still need to search web pages related to region by inputting keywords and to arrange the searched results with map. We can solve that problem by using the fact that most of geographic and regional information contain geographic keywords related to location. In this paper, we propose a system to retrieve geographic and regional information efficiently. For the purpose, we present a conceptual model based on three layers of "Real-World", "Knowledge", and "Applications", from the web space and construct the above link process. These layers are connected to each other and enable users to navigation information over the linkage. Especially, users can obtain various correlated information about geographic information and properties.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.974-983
• /
• 2017

In this paper, we have discussed the search function that can be embedded and used on Android-based applications. We used BM25 to suppress insignificant and too frequent words such as postpositions, Pivoted Length Normalization technique used to resolve the search priority problem related to each item's length, and Rocchio's method to pull items inferred to be related to the query closer to the query vector on Vector Space Model to support implicit feedback function. The index operation is divided into two methods; simple index to support offline operation and complex index for online operation. The implementation uses query inference function to guess user's future input by collating given present input with indexed data and with it the function is able to handle and correct user's error. Thus the implementation could be easily adopted into smartphone applications to improve their search functions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.32-37
• /
• 2008

To ensure access to rapidly growing video collection, video indexing is becoming more and more important. In this paper, video ontology system for retrieving a video data based on a scene unit is proposed. The proposed system creates a semantic scene as a basic unit of video retrieval, and limits a domain of retrieval through a subject of that scene. The content of semantic scene is defined using the relationship between object and event included in the key frame of shots. The semantic gap between the low level feature and the high level feature is solved through the scene ontology to ensure the semantic-based retrieval.

• Journal of the Korea Convergence Society
• /
• v.10 no.6
• /
• pp.59-64
• /
• 2019

This study used the Google Trends site to analyze selection information that users expect from prominent Toothbrushes and Toothpastes through related search keywords that users wanted to obtain. From 2006 to 2018(sep), searches for Toothbrushes and Toothpastes were arranged in the order of popularity of related searched words. The total number of searches words exposed was each 25, total 325 collected. The analysis was conducted using two methods, first, by search function. second, by a word network using a Big Data program. The study has shown that toothbrushes there are high expectations for brands, toothpaste there are high expectations in the function. In order to increase the motivation for oral health education, it is recommended to use and provide knowledge about the brand of toothbrushes and Toothpastes by the function.

• Smart Media Journal
• /
• v.11 no.10
• /
• pp.89-96
• /
• 2022

An open domain machine reading comprehension is a model that adds a function to search paragraphs as there are no paragraphs related to a given question. Document searches have an issue of lower performance with a lot of documents despite abundant research with word frequency based TF-IDF. Paragraph selections also have an issue of not extracting paragraph contexts, including sentence characteristics accurately despite a lot of research with word-based embedding. Document reading comprehension has an issue of slow learning due to the growing number of parameters despite a lot of research on BERT. Trying to solve these three issues, this study used BM25 which considered even sentence length and InferSent to get sentence contexts, and proposed an open domain machine reading comprehension with ALBERT to reduce the number of parameters. An experiment was conducted with SQuAD1.1 datasets. BM25 recorded a higher performance of document research than TF-IDF by 3.2%. InferSent showed a higher performance in paragraph selection than Transformer by 0.9%. Finally, as the number of paragraphs increased in document comprehension, ALBERT was 0.4% higher in EM and 0.2% higher in F1.

• Journal of the Korean Society for information Management
• /
• v.31 no.1
• /
• pp.99-118
• /
• 2014

This paper carried out co-word analysis of noun and noun phrase using text-mining technique in order to grasp the research trends on domestic and international information science articles. It was conducted based on collected titles and articles of the papers published in the Journal of the Korean Society for Information Management (KOSIM) and Journal of American Society for Information Science and Technology (JASIST) from 1990 to 2013. By dividing whole period into five publication window, this paper was organized into the following processes: 1) analysis of high frequency co-word pair to examine the overall trends of both information science articles 2) analysis of each word appearing with high frequency keyword to grasp the detailed subject 3) focused network analysis of trend after 2010 when distinctively new keyword appeared. The result of the analysis shows that KOSIM has considerable portion of studies conducted regarding topics such as library, information service, information user and information organization. Whereas, JASIST has focused on studies regarding information retrieval, information user, web information, and bibliometrics.

• The KIPS Transactions:PartB
• /
• v.18B no.2
• /
• pp.93-108
• /
• 2011

We propose a extended vector space model by using ambiguous words and disambiguous words to improve the result of a Korean document classification method. In this paper we study the precision enhancement of vector space model and we propose a new axis that represents a weight value. Conventional classification methods without the weight value had some problems in vector comparison. We define a word which has same axis of the weight value as ambiguous word after calculating a mutual information value between a term and its classification field. We define a word which is disambiguous with ambiguous meaning as disambiguous word. We decide the strengthness of a disambiguous word among several words which is occurring ambiguous word and a same document. Finally, we proposed a new classification method based on extension of vector dimension with ambiguous and disambiguous words.

• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.34-43
• /
• 2012

Determining the similarity between two strings can be applied various area such as information retrieval, spell checker and spam filtering. Similarity calculation between Korean strings based on dynamic programming methods firstly requires a definition of the similarity between phonemes. However, existing methods have a limitation that they use manually set similarity scores. In this paper, we propose a method to automatically calculate inter-phoneme similarity from a given set of variant words using a PAM-like probabilistic model. Our proposed method first finds the pairs of similar words from a given word set, and derives derivation rules from text alignment results among the similar word pairs. Then, similarity scores are calculated from the frequencies of variations between different phonemes. As an experimental result, we show an improvement of 10.1%~14.1% and 8.1%~11.8% in terms of sensitivity compared with the simple match-mismatch scoring scheme and the manually set inter-phoneme similarity scheme, respectively, with a specificity of 77.2%~80.4%.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.111-118
• /
• 2005

This paper describes an implementation of the spam mail prevention system using reply message with secrete words. When user receives a new e-mail, the e-mail address is compared with the white e-mail addresses in database by the system. If user receives a new e-mail which does not exist in a white e-mail addresses database, a reply e-mail attached with secrete words is delivered automatically. And the system is compared with the white domains first for intranet environment. It speeds up processing time. proposed algorithm is required a small database and faster than the black e-mail addresses comparison. This system is implemented using procmail, PHP and IMAP on Linux and the user can manage the databases on the web.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.1
• /
• pp.31-36
• /
• 2014

Social network services(SNS) including Twitter and Facebook are good resources to extract various issues like public interest, trend and topic. This paper proposes a method to extract query-related issues by calculating relatedness between terms in Twitter. As a term that frequently appears near query terms should be semantically related to a query, we calculate term relatedness in retrieved documents by summing proximity that is proportional to term frequency and inversely proportional to distance between words. Then terms, relatedness of which is bigger than threshold, are extracted as query-related issues, and our system shows those issues with a connected network. By analyzing single transitions in a connected network, compound words are easily obtained.