A Novel Approach on Suggesting Travel Route by Efficient Watchword

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    With the fame of web-based social networking (e.g., Facebook ), clients can undoubtedly share their registration records and photographs amid their treks. In perspective of the gigantic number of client verifiable portability records in web-based social networking, we plan to find venture out encounters to encourage trip arranging. When arranging a trek, clients dependably have specific inclinations with respect to their outings. Rather than confining clients to restricted question alternatives, for example, areas, exercises, or eras, we consider discretionary portrayals as watchwords about customized necessities. In addition, an assorted and agent set of suggested travel courses is required. Earlier works have expounded on mining and positioning existing courses from registration information. To address the issue for programmed trip association, we guarantee that more highlights of Spots of Intrigue (POIs) ought to be extricated. Along these lines, in this paper, we propose an efficient Catchphrase mindful Agent Travel Course structure that utilizations learning extraction from clients' verifiable portability records and social associations. Expressly, we have planned a watchword extraction module to group the POI-related labels, for successful coordinating with question catchphrases. We have additionally planned a course recreation calculation to develop course hopefuls that fulfill the necessities. To give befitting question comes about, we investigate Agent Horizon ideas, that is, the Horizon courses which best depict the exchange offs among various POI highlights. To assess the viability and efficiency of the proposed calculations, we have led broad investigates genuine area based informal community datasets, and the examination comes about demonstrate that our strategies do in fact illustrate great execution contrasted with best in class works.


  • Keywords

    Spatial keyword query, LBSN, Spatial database, POI, Watchword

  • References

      [1] Ke Deng, Xin Li and Xiao fang Zhou, “Best Keyword Cover Search”, IEEE Transaction on Knowledge and Data En-gineering ,vol 27, no 1, January 2015.

      [2] Joao B Junior, Orestis sGkorghas, Simon Jonassen and KjetilNorvag, “ Efficient Processing of Top K Spatial Key-word Queries”, in SSTD, pages 205-222, 2012.

      [3] Xin Cao, Gao Cong, Beng Chin, “Collective Spatial Key-word Querying”, ACM Transaction on Database Systems, 2011.

      [4] Gilsi R Hjaltson and HansebSamet, “Distance Browsing in Spatial Databases”, ACM Transaction on Database Systems, June 1999, pp 265-318.

      [5] Ronald Fagin, Ammon Lotem and MoniNaor, “Optimal Aggregation Algorithms for Middleware”, Journal of Com-puter and System Sciences, April 2003.

      [6] Yufei Tao and Cheng Sheng, “ Fast Nearest Neighbor Search with Keywords”, IEEE Transaction on Knowledge and Data Engineering, vol 26, no 4, April 2014.

      [7] Lisi Chen, Geo Cong, Christian S Jensen, “Spatial Key-word Query Processing: An experimental evaluation”, Pro-ceedings of the VLDB Endowment, vol 6, no 3, 2013.

      [8] X. Cao, L Chen, Gao Cong, C. S Jensen, “Spatial Key-word Querying”, Information Forensics and Security, Spring-er 2012.

      [9] Dong Xiang Zhang, Kian Lee Tan, Anthony K. H. Tung,, “Scalable Top K Spatial Keyword Search”, ICDT , March 2015.

      [10] J.M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM), 46(5):604–632, 1999.

      [11] K. Kodama, Y. Iijima, X. Guo, and Y. Ishikawa. Skyline queries based on user locations and preferences for making lo-cation-based recommendations. In LBSN, pages 9–16. ACM, 2009.

      [12] J.A. Konstan, B.N. Miller, D. Maltz, J.L. Herlocker, L.R. Gordon, and J. Riedl.Grouplens: applying collaborative filter-ing to use net news. Communications of the ACM, 40(3):77–87, 1997.

      [13] C.H. Lee, Y.H. Kim, and P.K. Rhee. Web personalization expert with combining collaborative filtering and association rule mining technique. Expert Systems with Applications, 21(3):131–137, 2001.

      [14] J. Levandoski, Mohamed Sarwat, Ahmed Eldawy, and Mohamed Mokbel. Lars: A location-aware recommender sys-tem. In ICDE, 2012.

      [15] H. Ma, H. Yang, M.R. Lyu, and I. King.Sorec: social recommendation using probabilistic matrix factorization. In CIKM, pages 931–940. ACM, 2008.

      [16] Mohamed Mokbel, JieBao, Ahmed Eldawy, Justin Levandoski, and Mohamed Sarwat. Personalization, Socializa-tion, and Recommendations in Location-based Services 2.0.In PersDB. VLDB, 2011.

      [17] Noulas, S. Scellato, C. Mascolo, and M. Pontil. Ex-ploiting semantic annotations for clustering geographic areas and users in location-based social networks. In Fifth Interna-tional AAAI Conference on Weblogs and Social Media, 2011.

      [18] M.H. Park, J.H. Hong, and S.B. Cho. Location-based recommendation system using bayesian user’s preference model in mobile devices. Ubiquitous Intelligence and Compu-ting, pages 1130–1139, 2007.

      [19] S. Robertson. Understanding inverse document frequency: on theoretical arguments for idf. Journal of Documentation, 60(5):503–520, 2004.

      [20] S. Scellato, A. Noulas, R. Lambiotte, and C. Mascolo. Socio-spatial properties of online location-based social net-works. Proceedings of ICWSM, 11, 2011.

      [21] A.I. Schein, A. Popescul, L.H. Ungar, and D.M. Pen-nock. Methods and metrics for cold-start recommendations. In SIGIR, pages 253–260. ACM, 2002.

      [22] M. Ye, P. Yin, and W.C. Lee. Location recommendation for location-based social networks. In SIGSPATAIL, pages 458–461. ACM, 2010.

      [23] Y. Zheng and X. Xie. Learning travel recommendations from user-generated gps traces. ACM TIST, 2(1):2, 2011.

      [24] Y. Zheng, X. Xie, and W.Y. Ma.Geolife: A collaborative social networking service among user, location and trajectory. IEEE Data Engineering Bulletin, 33(2):32–40, 2010.




Article ID: 15573
DOI: 10.14419/ijet.v7i2.32.15573

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.