Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2016 2nd International Conference on Contemporary Computing and Informatics, IC3I 2016 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 633-638 |
Number of pages | 6 |
ISBN (Electronic) | 9781509052554 |
DOIs | |
Publication status | Published - 01-01-2016 |
Event | 2nd International Conference on Contemporary Computing and Informatics, IC3I 2016 - Noida, India Duration: 14-12-2016 → 17-12-2016 |
Conference
Conference | 2nd International Conference on Contemporary Computing and Informatics, IC3I 2016 |
---|---|
Country/Territory | India |
City | Noida |
Period | 14-12-16 → 17-12-16 |
All Science Journal Classification (ASJC) codes
- Artificial Intelligence
- Information Systems and Management
- Health Informatics
- Computer Networks and Communications
- Computer Science Applications
- Information Systems