Skip to main content
SpringerLink
Log in

Mining optimal meeting points for moving users in spatio-temporal space

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

Scheduling a meeting is a difficult task for people who have overbooked calendars and often have many constraints. This activity becomes further complex when the meeting is to be scheduled between parties who are situated in geographically distant locations of a city and have varying traveling patterns. To achieve this, we first propose a solution to determine optimal meeting location for two moving users in the Euclidean space. Then, we generalize the problem by considering variable number of moving users and evaluate optimal meeting point on the road network. We extend the work of Yan et al. (Proc VLDB Endow 4(11):1–11, 2011) in this domain by incorporating some real life constraints like variable number of users, varying travel patterns, flexible meeting point and considering road network distance. Experiments are performed on a real-world dataset and show that our method is effective in stated conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  • Beck A, Teboulle M (2009) Gradient-based algorithms with applications to signal recovery. In: Palomar DP, Eldar YC (eds) Convex optimization in signal processing and communications. Cambridge University Press, Cambridge, pp 42–88

    Chapter  Google Scholar 

  • Beeharee Ashweeni, Steed Anthony (2007) Exploiting real world knowledge in ubiquitous applications. Pers Ubiquitous Comput 11(6):429–437

    Article  Google Scholar 

  • Brimberg Jack, Love Robert F (1993) Global convergence of a generalized iterative procedure for the minisum location problem with lp distances. Oper Res 41(6):1153–1163

    Article  MathSciNet  Google Scholar 

  • Chen Reuven (1984) Location problems with costs being sums of powers of Euclidean distances. Comput Oper Res 11(3):285–294

    Article  Google Scholar 

  • Chen Reuven (1984) Solution of location problems with radial cost functions. Comput Math Appl 10(1):87–94

    Article  MathSciNet  Google Scholar 

  • Chen Z, Shen HT, Zhou X, Yu JX (2009) Monitoring path nearest neighbor in road networks. In: Proceedings of the 2009 ACM SIGMOD international conference on management of data. ACM, pp 591–602

  • Cho H-J, Chung C-W (2005) An efficient and scalable approach to cnn queries in a road network. In: Proceedings of the 31st international conference on very large data bases. VLDB Endowment, pp 865–876

  • Convex hull and properties link. http://en.wikipedia.org/wiki/Convex_set, http://en.wikipedia.org/wiki/Centroid. Accessed 14 Jan 2016

  • Cooper Leon (1968) An extension of the generalized weber problem. J Reg Sci 8(2):181–197

    Article  Google Scholar 

  • Horozov T, Narasimhan N, Vasudevan V (2006) Using location for personalized poi recommendations in mobile environments. In: International symposium on applications and the internet (SAINT’06). IEEE, p 6

  • Jeung H, Liu Q, Shen HT, Zhou X (2008) A hybrid prediction model for moving objects. In: 2008 IEEE 24th international conference on data engineering. IEEE, pp 70–79

  • Khetarpaul S, Chauhan R, Gupta SK, Subramaniam LV, Nambiar U (2011) Mining GPS data to determine interesting locations. In: Proceedings of the 8th international workshop on information integration on the web: in conjunction with WWW 2011. ACM, p 8

  • Khetarpaul S, Gupta SK, Subramaniam LV, Nambiar U (2012) Mining GPS traces to recommend common meeting points. In: Proceedings of the 16th international database engineering and applications sysmposium. ACM, pp 181–186

  • Khetarpaul S, Gupta SK, Subramaniam LV (2013) Analyzing travel patterns for scheduling in a dynamic environment. In: International conference on availability, reliability, and security. Springer, pp 304–318

  • Li Feifei, Yao Bin, Kumar Piyush (2011) Group enclosing queries. IEEE Trans Knowl Data Eng 23(10):1526–1540

    Article  Google Scholar 

  • Mouratidis K, Yiu ML, Papadias D, Mamoulis N (2006) Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32nd international conference on very large data bases. VLDB Endowment, pp 43–54

  • Ostresh Lawrence M (1977) The multifacility location problem: applications and descent theorems. J Reg Sci 17(3):409–419

    Article  Google Scholar 

  • Park M-H, Hong J-H, Cho S-B (2007) Location-based recommendation system using Bayesian user’s preference model in mobile devices. In: International conference on ubiquitous intelligence and computing. Springer, pp 1130–1139

  • Preparata Franco P, Shamos Michael (2012) Computational geometry: an introduction. Springer Science & Business Media, New York

    MATH  Google Scholar 

  • Simon R, Fröhlich P (2007) A mobile application framework for the geospatial web. In: Proceedings of the 16th international conference on World Wide Web. ACM, pp 381–390

  • Xie X, Zheng Y, Zhang L, Ma W-Y (2008) Understanding mobility based on GPS data. In: Proceedings of Ubicomp. ACM Press, pp 312–321

  • Xu Z, Jacobsen H-A (2010) Processing proximity relations in road networks. In: Proceedings of the 2010 ACM SIGMOD international conference on management of data. ACM, pp 243–254

  • Yan D, Zhao Z, Ng W (2011) Efficient algorithms for finding optimal meeting point on road networks. Proc VLDB Endow 4:1–11

    Google Scholar 

  • Yan Da, Zhao Zhou, Ng Wilfred (2015) Efficient processing of optimal meeting point queries in euclidean space and road networks. Knowl Inf Syst 42(2):319–351

    Article  Google Scholar 

  • Yiu Man Lung, Mamoulis Nikos, Papadias Dimitris (2005) Aggregate nearest neighbor queries in road networks. IEEE Trans Knowl Data Eng 17(6):820–833

    Article  Google Scholar 

  • Zheng Y, Li Q, Chen Y, Xie X, Ma W-Y (2008b) Understanding mobility based on GPS data. In: Proceedings of the 10th international conference on Ubiquitous computing. ACM, pp 312–321

  • Zheng Y, Wang L, Zhang R, Xie X, Ma W-Y (2008a) Geolife: managing and understanding your past life over maps. In: The ninth international conference on mobile data management (mdm 2008). IEEE, pp 211–212

  • Zheng Y, Zhang L, Xie X, Ma W-Y (2009) Mining correlation between locations using human location history. In: Proceedings of the 17th ACM SIGSPATIAL international conference on advances in geographic information systems. ACM, pp 472–475

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, SNU, Gautam Buddha Nagar, UP, India

    Sonia Khetarpaul

  2. Department of Computer Science and Engineering, IIT Delhi, New Delhi, India

    S. K. Gupta

  3. IBM Research-India, New Delhi, India

    L. Venkata Subramaniam

Authors
  1. Sonia Khetarpaul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. K. Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L. Venkata Subramaniam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sonia Khetarpaul.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khetarpaul, S., Gupta, S.K. & Subramaniam, L.V. Mining optimal meeting points for moving users in spatio-temporal space. Soc. Netw. Anal. Min. 8, 50 (2018). https://doi.org/10.1007/s13278-018-0527-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-018-0527-9

Keywords

Search

Navigation