Finding regions of interest is a challenge when traveling in an unfamiliar area. Users traveling in an unfamiliar region may like to travel in a direction which includes places that are interesting to them. In this paper we propose a method of finding nearby regions for potential Points of Interest (POI) (e.g., sightseeing places and commercial centers) while traveling in an undefined path. A continuous algorithm is proposed to address these challenges. Conceptually, the algorithm searches for nearby spatial objects(POIs or geo-tagged tweets). Distance and density are the two factors used to progress as well as stop the search. The search space is constrained using density and distance threshold along with an adjustment factor to adjust the importance of the two domains. The performance of the continuous algorithm is measured based on experiments conducted on spatial data. The experimental results has shown to retrieve all the POIs on a unfamiliar path in the real time.
[1]
Panos Kalnis,et al.
Discovery of Path Nearby Clusters in Spatial Networks
,
2015,
IEEE Transactions on Knowledge and Data Engineering.
[2]
J. Greenfeld.
MATCHING GPS OBSERVATIONS TO LOCATIONS ON A DIGITAL MAP
,
2002
.
[3]
Heng Tao Shen,et al.
Monitoring path nearest neighbor in road networks
,
2009,
SIGMOD Conference.
[4]
Günter Rote,et al.
Matching planar maps
,
2003,
SODA '03.
[5]
Christian S. Jensen,et al.
EcoMark: evaluating models of vehicular environmental impact
,
2012,
SIGSPATIAL/GIS.
[6]
Edsger W. Dijkstra,et al.
A note on two problems in connexion with graphs
,
1959,
Numerische Mathematik.
[7]
Jiawei Han,et al.
Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach
,
2007,
VLDB.