Advertisement

Maximizing Reverse k-Nearest Neighbors for Trajectories

  • Tamjid Al Rahat
  • Arif Arman
  • Mohammed Eunus Ali
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10837)

Abstract

In this paper, we address a popular query involving trajectories, namely, the Maximizing Reverse k-Nearest Neighbors for Trajectories (MaxRkNNT) query. Given a set of existing facility trajectories (e.g., bus routes), a set of user trajectories (e.g., daily commuting routes of users) and a set of query facility trajectories (e.g., proposed new bus routes), the MaxRkNNT query finds the proposed facility trajectory that maximizes the cardinality of reverse k-Nearest Neighbors (NNs) set for the query trajectories. A major challenge in solving this problem is to deal with complex computation of nearest neighbors (or similarities) with respect to multi-point queries and data objects. To address this problem, we first introduce a generic similarity measure between a query object and a data object that helps us to define the nearest neighbors according to user requirements. Then, we propose some pruning strategies that can quickly compute k-NNs (or top-k) facility trajectories for a given user trajectory. Finally, we propose a filter and refinement technique to compute the MaxRkNNT. Our experimental results show that our proposed approach significantly outperforms the baseline for both real and synthetic datasets.

References

  1. 1.
    Chen, L., Ng, R.T.: On the marriage of Lp-norms and edit distance. In: VLDB, pp. 792–803 (2004)CrossRefGoogle Scholar
  2. 2.
    Chen, L., Tamer Özsu, M., Oria, V.: Robust and fast similarity search for moving object trajectories. In: ACM SIGMOD, pp. 491–502 (2005)Google Scholar
  3. 3.
    Chen, Z., Shen, H.T., Zhou, X., Zheng, Y., Xie, X.: Searching trajectories by locations: an efficiency study. In: ACM SIGMOD, pp. 255–266 (2010)Google Scholar
  4. 4.
    Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the r-tree. SIGMOD Rec. 27(3), 16–21 (1998)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Frentzos, E., Gratsias, K., Pelekis, N., Theodoridis, Y.: Algorithms for nearest neighbor search on moving object trajectories. GeoInformatica 11(2), 159–193 (2007)CrossRefGoogle Scholar
  6. 6.
    Liu, Y., Wong, R.C.-W., Wang, K., Li, Z., Chen, C., Chen, Z.: A new approach for maximizing bichromatic reverse nearest neighbor search. Knowl. Inf. Syst. 36(1), 23–58 (2013)CrossRefGoogle Scholar
  7. 7.
    Reza, R.M., Ali, M.E., Cheema, M.A.: The optimal route and stops for a group of users in a road network. In: SIGSPATIAL/GIS, pp. 4:1–4:10. ACM (2017)Google Scholar
  8. 8.
    Shafique, S., Ali, M.E.: Recommending most popular travel path within a region of interest from historical trajectory data. In: MobiGIS, pp. 2–11. ACM (2016)Google Scholar
  9. 9.
    Shang, S., Yuan, B., Deng, K., Xie, K., Zhou, X.: Finding the most accessible locations: reverse path nearest neighbor query in road networks. In: GIS, pp. 181–190. ACM (2011)Google Scholar
  10. 10.
    Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-47724-1_5CrossRefGoogle Scholar
  11. 11.
    Tang, L.-A., Zheng, Y., Xie, X., Yuan, J., Yu, X., Han, J.: Retrieving k-nearest neighboring trajectories by a set of point locations. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 223–241. Springer, Heidelberg (2011).  https://doi.org/10.1007/978-3-642-22922-0_14CrossRefGoogle Scholar
  12. 12.
    Vlachos, M., Gunopulos, D., Kollios, G.: Discovering similar multidimensional trajectories. In: ICDE, pp. 673–684 (2002)Google Scholar
  13. 13.
    Wang, S., Bao, Z., Shane Culpepper, J., Sellis, T.K., Cong, G.: Reverse \(k\) nearest neighbor search over trajectories. CoRR, abs/1704.03978 (2017)Google Scholar
  14. 14.
    Wong, R.C.-W., Tamer Özsu, M., Yu, P.S., Fu, A.W.-C., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2(1), 1126–1137 (2009)Google Scholar
  15. 15.
    Yi, B.-K., Jagadish, H.V., Faloutsos, C.: Efficient retrieval of similar time sequences under time warping. In: ICDE, pp. 201–208 (1998)Google Scholar
  16. 16.
    Zhou, Z., Wu, W., Li, X., Lee, M.-L., Hsu, W.: MaxFirst for MaxBRkNN. In: ICDE, pp. 828–839. IEEE Computer Society (2011)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringBangladesh University of Engineering and TechnologyDhakaBangladesh

Personalised recommendations