• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.463-469
• /
• 2013

The set-based POI search algorithm showed better performance than the existing hard matching search when inaccurate queries are entered. In the set-based POI search algorithm, however, there is a problem that can't classify duplicate characters within a record. This is due to it's 'set-based' search property. To solve this problem, we improve the existing set-based POI search algorithm. In this paper, we propose and implement an improved set-based POI search algorithm that is able to deal duplicate characters properly. From the experimental results, we can find that our technique for duplicate characters improves the performance of the existing set based POI search algorithm.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.711-716
• /
• 2014

With the gradual increase of interest in plagiarism and intelligent file content search, the demand for similarity measuring between two sentences is increasing. There is a lot of researches for sentence similarity measurement methods in various directions such as n-gram, edit-distance and LSA. However, these methods have their own advantages and disadvantages. In this paper, we propose a new sentence similarity measurement method approaching from another direction. The proposed method uses the set-based POI data search that improves search performance compared to the existing hard matching method when data includes the inverse, omission, insertion and revision of characters. Using this method, we are able to measure the similarity between two sentences more accurately and more quickly. We modified the data loading and text search algorithm of the set-based POI data search. We also added a word operation algorithm and a similarity measure between two sentences expressed as a percentage. From the experimental results, we observe that our sentence similarity measurement method shows better performance than n-gram and the set-based POI data search.

• KIISE Transactions on Computing Practices
• /
• v.21 no.3
• /
• pp.269-274
• /
• 2015

As smart device companies such as Google or Apple develop competitive mobile-based automotive operating systems and navigation systems, the range of choice for users in such markets is expanding. Navigation systems equipped with mobile operating systems have increased convenience for users. However, since an API for the POI databases used in navigation systems doesn't exist, the number of applications using POI data is insufficient. In this paper, we designed and implemented system calls for navigation operating systems with a focus on POI search, in order to resolve such limitations. The system calls support set-based POI search functions, and therefore provides solutions to search performance degradation problems caused by false inputs. As a result of performance evaluation, not only did the search performance improve, but there was also no problem in applying APIs in applications.

• KIISE Transactions on Computing Practices
• /
• v.20 no.9
• /
• pp.498-506
• /
• 2014

With the development of smart transportation, people are likely to find their paths by using navigation and map application. However, the existing retrieval system cannot output the correct retrieval result due to the inaccurate query. In order to remedy this problem, set-based POI search algorithm was proposed. Subsequently, additionally a method for measuring POI name similarity and POI search algorithm supporting classifying duplicate characters were proposed. These algorithms tried to compensate the insufficient part of the compensate set-based POI search algorithm. In this paper, accuracy improvement methods for measuring string similarity in POI data retrieval system are proposed. By formulization, similarity measurement scheme is systematized and generalized with the development of transportation. As a result, it improves the accuracy of the retrieval result. From the experimental results, we can observe that our accuracy improvement methods show better performance than the previous algorithms.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.57-64
• /
• 2017

Short message service (SMS) is one of the most important communication methods for people who use mobile phones. However, illegal advertising spam messages exploit people because they can be used without the need for friend registration. Recently, spam message filtering systems that use machine learning have been developed, but they have some disadvantages such as requiring many calculations. In this paper, we implemented a spam message filtering system using the set-based POI search algorithm and sentence similarity without servers. This algorithm can judge whether the input query is a spam message or not using only letter composition without any server computing. Therefore, we can filter the spam message although the input text message has been intentionally modified. We added a specific preprocessing option which aims to enable spam filtering. Based on the experimental results, we observe that our spam message filtering system shows better performance than the original set-based POI search algorithm. We evaluate the proposed system through extensive simulation. According to the simulation results, the proposed system can filter the text message and show high accuracy performance against the text message which cannot be filtered by the 3 major telecom companies.

• 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 of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.259-267
• /
• 2013

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.