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

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.3
• /
• pp.339-346
• /
• 2016

Semantic search recently been used in the search field. POI is one of the most essential information that make up the geographic information, and many of the geographic information system has POI search function as a basic. In this study, we propose POI semantic search using collective intelligence. For this, we designed and implemented service that constructs empirical information from tag and image, and provides an intuitive spatial navigation experience. For POI search, collective intelligence platform that many users can participate to collect variety information was designed and implemented.

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

• Spatial Information Research
• /
• v.21 no.4
• /
• pp.7-14
• /
• 2013

Recently, R&D(Research and Development) is processing actively on range search in the road network environments. However, the existing representative range search techniques have shortcomings in that the greater the number of POI's, the more increased storage space or the more increased search time due to inefficient search process. Accordingly, In this paper, we proposed a range search technique using QRMP(QR-tree using Middle Point) to solve the problems of conventional range search techniques. In addition, we made a formula to obtain the total size of the storage space for QRMP and proved the excellence of the range search technique proposed in this paper through the experiment using actual road networks and POI data.

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

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.256-259
• /
• 2004

Recently, Location-based services(LBS) allow consumers to receive services based on their geographic location data. Users want to take services based location information with portable devices. And Point of Interest(POI) information's usage is increasing with mobile device's development and user's interest. And this paper shows that we connect the multimedia POI database(DB), provide the multimedia services through the portable devices and search POI using location and direction information. The multimedia POI is consisted of sound, image, moving image and animation with location information. When we search POI, we find POI in DB using the area zone and direction information.[l]

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.6
• /
• pp.609-618
• /
• 2016

Since demand for location-based services increases and the relevant service becomes more diverse, the use of POI (Point of Interest) is being required in various fields. Various roles of POI for display, search and inquiry exist, but the implementation and expression of such roles are partially limited. Therefore, the data model for implementation is suggested in this paper to enable practical implementation, expression and inquiry of POI data. The data model was developed based on 3 roles of POI including search, expression and linkage, and especially, the spatial relationship between POI objects which was not suggested in previous data models is considered and time series scheme is suggested to enable various expressions and inquiries in application services.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.316-317
• /
• 2017

Augmented reality is a technology that combines the virtual world based on the real world. This technique requires POI data to recognize the marker and identify the marker. POI data can be easily registered and used by anyone, and there is a need to provide a standard for accessing POI data because a large amount of data is accumulated in the existing augmented reality platform. Therefore, in this paper, we propose a category composition method for POI data integration using ontology which is a paradigm of providing relationship and information sharing. It consists of a combination of the POI core of W3C and OWL, which is the expression language of the ontology.