• Journal of KIISE:Software and Applications
• /
• v.36 no.10
• /
• pp.861-873
• /
• 2009

There are many reasons that fail to get appropriate information in information retrieval. Allomorph is one of the reasons for search failure due to keyword mismatch. This research proposes a method to construct alternative word candidates automatically in order to minimize search failure due to keyword mismatch. Assuming that two words have similar meaning if they have similar co-occurrence words, the proposed method uses the concept of concentration, association word set, cosine similarity between association word sets and a filtering technique using confidence. Performance of the proposed method is evaluated using a manually extracted alternative list. Evaluation results show that the proposed method outperforms the context window overlapping in precision and recall.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.103-111
• /
• 2014

This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.

• Journal of Digital Contents Society
• /
• v.16 no.5
• /
• pp.815-822
• /
• 2015

By the growing of SMS phishing victims, applications for processing spam messages are being released in succession. However most spam messages that cleverly modified the content like separating the consonants and vowels are fail to be filtered. In this paper, we implemented an application 'AntiSpam' which is able to identify spam strings in the text message to solve this problem. 'AntiSpam' searches spam strings in the text message by using set-based POI search algorithm, and then calculate the possibility of whether it is spam or not in accordance with the search results. In addition, it catches skillfully disguised spam messages in order to avoid missing the spam filtering. Users, who received a message, can check the result in spam message possibility decision result and the contents of the message and they can choose how to handling the message.

• Journal of the Korean Society for Library and Information Science
• /
• v.50 no.1
• /
• pp.417-435
• /
• 2016

Relevance judgment is important in terms of improving the effectiveness of information retrieval systems, and it has been dominant for users to search and use images utilizing internet and digital technologies. However, in the field of image retrieval, there have been only a few studies in terms of identifying relevance criteria. The purpose of this study aims to identify and characterize the non-relevance criteria from the failed image searches. In order to achieve the purpose of this study, a total of 135 participants were recruited and a total of 1,452 criteria items were collected for this study. Analyses and identification on the data set found thirteen criteria such as 'topicality', 'visual content', 'accuracy', 'visual feature', 'completeness', 'appeal to user', 'focal point', 'bibliographic information', 'impression', 'posture', 'face feature', 'novelty', and 'time frame'. Among these criteria, 'visual content' and 'focal point' were introduced in this current study, while 'action' criterion identified in previous studies was not shown in this current study. When image needs and image uses are analyzed with these criteria, there are distinctive differences depending on different image needs and uses.

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

The Information retrieval system is more accurate of the information for you want to search, and quickly delivered. But the current search system is a simple way to parse on users fail to provide accurate information. This paper describes the ontology servers retrieve information through the system. Proposed system is Semantic Web-based information retrieval techniques in addition to structured documents using a variety of formats to maximize their data processing. In addition, interoperability and data integration RDF (Resource Description Framework) for saving documents by supporting rapid and accurate information retrieval. This supports a variety of Web browsers on the Web will be utilized in the field of efficient data retrieval.

• Journal of Information Technology Applications and Management
• /
• v.20 no.3_spc
• /
• pp.231-257
• /
• 2013

The recent rise in the unstructured data generated by social media has resulted in an increasing need to collect, store, search, analyze, and visualize it. These data cannot be managed effectively by using traditional data analysis methodologies because of their vast volume and unstructured nature. Therefore, many attempts are being made to analyze these unstructured data (e.g., text files and log files) by using commercial and noncommercial analytical tools. Especially, the attempt to discover meaningful knowledge by using text mining is being made in business and other areas such as politics, economics, and cultural studies. For instance, several studies have examined pending national issues by analyzing large volumes of texts on various social issues. However, it is difficult to create satisfactory information services that can identify R&D documents on specific national issues from among the various R&D resources. In other words, although users specify some words related to pending national issues as search keywords, they usually fail to retrieve the R&D information they are looking for. This is usually because of the discrepancy between the terms defining pending national issues and the corresponding terms used in R&D documents. We need a mediating logic to overcome this discrep 'ancy so that we can identify and package appropriate R&D information on specific pending national issues. In this paper, we use association analysis and social network analysis to devise a mediator for bridging the gap between the keywords defining pending national issues and those used in R&D documents. Further, we propose a methodology for packaging R&D information services for pending national issues by using the devised mediator. Finally, in order to evaluate the practical applicability of the proposed methodology, we apply it to the NTIS(National Science & Technology Information Service) system, and summarize the results in the case study section.

• Journal of Digital Contents Society
• /
• v.12 no.2
• /
• pp.217-223
• /
• 2011

AI(Artificial Intelligence) refers to the area of computer engineering and IT technology that focuses on the methodology and creation of intelligent agents. The Othello game is often produced with AI, since it is played with relatively simple rules on a board and on a limited space of 8 rows and 8 columns. Previous algorithms take longer time than desirable and often fail to face new circumstances, as they search for all the possible cases and rules. In order to solve this crucial weakness, we propose that a CBR algorithm be applied to Orthello. Case-Based Reasoning(CBR), is the process of solving new problems based on the solutions of the past similar problems. We can apply this process to Othello and expedite the process of computer reasoning for a solution to new cases based on the data from accumulated past cases. Then, these new solutions are dynamically added to the set of past cases so that it becomes harder for players(users) to be able to read the pattern. The proposed system in which a CBR algorithm is applied to the Othello game makes the computation process faster and the game harder to play.

• Cartoon and Animation Studies
• /
• s.15
• /
• pp.221-235
• /
• 2009

Most of the sounds used in animated films are artificially made. A large number of the sounds used are either actual sound recordings or diversely processed artificial sounds made with professional sound equipments such as synthesizers. One animation episode contains numerous amounts of sounds, resulting in significant sound production costs. These sounds have full potential to be reused in different films or animations, but in reality we fail to do so. This thesis discusses ways these sound sources can be acknowledged as added new values to the present market situation as a usable 'digital content'. The iTunes Music Store is an American Apple company product that is acknowledged as the most successful digital content distribution model at the time being. Its system's sound library has potential for application in the Korean sound industry. In result, this system allows the sound creator to connect directly to the online store and become the initiative content supplier. At the same time, the user can receive a needed content easily at a low price. The most important part in the construction of this system is the search engine, which allows users to search for data in short periods of time. The search engine will have to be made in a new manner that takes into consideration the characteristics of the Korean language. This thesis presents a device incorporating the Wiki System to allow users to search and build their own data bases to share with other users. Using this system as a base, the Korean animation sound library will provide development and growth in the sound source industry as a new digital sound content.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.643-654
• /
• 2001

This paper discusses an effective processing of similarity search that supports time warping in large sequence database. Time warping enables finding sequences with similar patterns even when they are of different length, Previous methods fail to employ multi-dimensional indexes without false dismissal since the time warping distance does not satisfy the triangular inequality. They have to scan all the database, thus suffer from serious performance degradation in large database. Another method that hires the suffix tree also shows poor performance due to the large tree size. In this paper we propose a new novel method for similarity search that supports time warping Our primary goal is to innovate on search performance in large database without false dismissal. to attain this goal ,we devise a new distance function $D_{tw-Ib}$ consistently underestimates the time warping distance and also satisfies the triangular inequality, $D_{tw-Ib}$ uses a 4-tuple feature vector extracted from each sequence and is invariant to time warping, For efficient processing, we employ a distance function, We prove that our method does not incur false dismissal. To verify the superiority of our method, we perform extensive experiments . The results reveal that our method achieves significant speedup up to 43 times with real-world S&P 500 stock data and up to 720 times with very large synthetic data.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.4 s.175
• /
• pp.991-1000
• /
• 2000

Previous area-based stereo matching algorithms find the disparity by first computing the sum of squared differences (SSD) between corresponding points using a rectangular window, and then searching the position of the minimum SSD within the disparity range. These algorithms generate relatively many matching errors around depth discontinuities, since the SSD function may fail to search for the minimum because of varying disparity profiles in such areas. In this paper, in order to improve the matching accuracy around the depth discontinuities, a new correlation function based on robust estimation technique is proposed for stereo matching. In addition, while previous stereo algorithms utilize a single rectangular window for computing the correlation function, the proposed matching algorithm utilizes 4-directional line masks additionally to reduce the matching errors further. It has been turned out that the proposed algorithm reduces matching errors around depth discontinuities significantly. Experimental results are presented in this paper, comparing the performance of the proposed technique with those of previous algorithms using both synthetic and real images.