Skip to main content
Springer Nature Link
Log in

A Measure and Conquer Algorithm for the Minimum User Spatial-Aware Interest Group Query Problem

  • Conference paper
  • First Online:
New Trends in Computer Technologies and Applications (ICS 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1013))

Included in the following conference series:

  • 1399 Accesses

Abstract

Location-based social networks are important issues in the recent decade. In modern social networks, websites such as Twitter, Facebook, and Plurk, attempt to get the accurate address positions from their users, and try to reduce the gap between virtuality and reality. This paper mainly aims at both the interests of Internet users and their real positions. This issue is called the spatial-aware interest group query problem (SIGQP). Given a user set U with n users, a keywords set W with m words, and a spatial objects set S with s items, each of which contains one or multiple keywords. If a user checks in a certain spatial object, it means the user could be interested in that part of keywords, which is countable to clarify the interests of the user. The SIGQP then tries to find a k-user set \(U_{k}\), \(k \le n\), such that the union of keywords of these k users will equal to W, and additionally, the diameter (longest Euclidean distance of two arbitrary users in \(U_k\)) should be as small as possible. The SIGQP has been proved as NP-Complete, and two heuristic algorithms have been proposed. Extended from SIGQP, the main problem of this paper prioritizes in finding the smallest k for \(U_{k}\) to cover all the keywords, with the users’ distance as the secondary criterion, called as “minimum user spatial-aware interest group query problem” (MUSIGQP). This paper further designs an exact algorithm on a measure-&-conquer-based method to precisely solve this problem, and a performance analysis is given.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Chen, L., Cong, G., Jensen, C.S., Wu, D.: Spatial keyword query processing: an experimental evaluation. In: Proceedings of the VLDB Endowment, vol. 6, pp. 217–228. VLDB Endowment (2013)

    Google Scholar 

  2. Chen, S.J., Lin, L.: Modeling team member characteristics for the formation of a multifunctional team in concurrent engineering. IEEE Trans. Eng. Manag. 51(2), 111–124 (2004)

    Article  MathSciNet  Google Scholar 

  3. Cong, G., Jensen, C.S., Wu, D.: Efficient retrieval of the top-k most relevant spatial web objects. Proc. VLDB Endow. 2(1), 337–348 (2009)

    Article  Google Scholar 

  4. Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: ACM SIGMOD Record, vol. 29, pp. 189–200. ACM (2000)

    Google Scholar 

  5. De Felipe, I., Hristidis, V., Rishe, N.: Keyword search on spatial databases. In: IEEE 24th International Conference on Data Engineering, ICDE 2008, pp. 656–665. IEEE (2008)

    Google Scholar 

  6. Feige, U.: A threshold of ln n for approximating set cover. J. ACM (JACM) 45(4), 634–652 (1998)

    Article  Google Scholar 

  7. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM (JACM) 56(5), 25 (2009)

    Article  MathSciNet  Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and y: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). Computers and Intractability, vol. 340 (1979)

    Google Scholar 

  9. Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group steiner tree problem. J. Algorithms 37(1), 66–84 (2000)

    Article  MathSciNet  Google Scholar 

  10. Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: ACM SIGMOD Record, vol. 27, pp. 237–248. ACM (1998)

    Google Scholar 

  11. Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. (TODS) 24(2), 265–318 (1999)

    Article  Google Scholar 

  12. Hochbaum, D.S.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. Approx. Algorithms NP-Hard Probl. 94–143 (1997)

    Google Scholar 

  13. Karpiński, M., Karpinski, M., Rytter, W.: Fast Parallel Algorithms for Graph Matching Problems, vol. 9. Oxford University Press, Oxford (1998)

    MATH  Google Scholar 

  14. Katayama, N., Satoh, S.: The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: ACM Sigmod Record, vol. 26, no. 2, pp. 369–380 (1997)

    Article  Google Scholar 

  15. Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol. 30, pp. 840–851. VLDB Endowment (2004)

    Google Scholar 

  16. Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 467–476. ACM (2009)

    Google Scholar 

  17. Li, C.T., Shan, M.K.: Team formation for generalized tasks in expertise social networks. In: 2010 IEEE Second International Conference on Social Computing (SocialCom), pp. 9–16. IEEE (2010)

    Google Scholar 

  18. Li, Y., Wu, D., Xu, J., Choi, B., Su, W.: Spatial-aware interest group queries in location-based social networks. Data Knowl. Eng. 92, 20–38 (2014)

    Article  Google Scholar 

  19. Liu, W., Sun, W., Chen, C., Huang, Y., Jing, Y., Chen, K.: Circle of friend query in geo-social networks. In: Lee, S., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012. LNCS, vol. 7239, pp. 126–137. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29035-0_9

    Chapter  Google Scholar 

  20. Long, C., Wong, R.C.W., Wang, K., Fu, A.W.C.: Collective spatial keyword queries: a distance owner-driven approach. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 689–700. ACM (2013)

    Google Scholar 

  21. Martins, B., Silva, M.J., Andrade, L.: Indexing and ranking in Geo-IR systems. In: Proceedings of the 2005 Workshop on Geographic Information Retrieval, pp. 31–34. ACM (2005)

    Google Scholar 

  22. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265–294 (1978)

    Article  MathSciNet  Google Scholar 

  23. Pagel, B.U., Six, H.W., Toben, H., Widmayer, P.: Towards an analysis of range query performance in spatial data structures. In: Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 214–221. ACM (1993)

    Google Scholar 

  24. Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: Proceedings of the 20th International Conference on Data Engineering, pp. 301–312. IEEE (2004)

    Google Scholar 

  25. Rocha-Junior, J.B., Gkorgkas, O., Jonassen, S., Nørvåg, K.: Efficient processing of top-k spatial keyword queries. In: Pfoser, D., et al. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 205–222. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22922-0_13

    Chapter  Google Scholar 

  26. Ross, P.E.: Top 11 technologies of the decade. IEEE Spectrum 48(1), 27–63 (2011)

    Article  Google Scholar 

  27. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: ACM Sigmod Record, vol. 24, pp. 71–79. ACM (1995)

    Article  Google Scholar 

  28. Shin, H., Moon, B., Lee, S.: Adaptive multi-stage distance join processing. In: ACM SIGMOD Record, vol. 29, pp. 343–354. ACM (2000)

    Google Scholar 

  29. Tao, Y., Xiao, X., Cheng, R.: Range search on multidimensional uncertain data. ACM Trans. Database Syst. (TODS) 32(3), 15 (2007)

    Article  Google Scholar 

  30. Wu, D., Cong, G., Jensen, C.S.: A framework for efficient spatial web object retrieval. VLDB J. 21(6), 797–822 (2012)

    Article  Google Scholar 

  31. Wu, D., Yiu, M.L., Jensen, C.S., Cong, G.: Efficient continuously moving top-k spatial keyword query processing. In: 2011 IEEE 27th International Conference on Data Engineering (ICDE), pp. 541–552. IEEE (2011)

    Google Scholar 

  32. Yang, D.N., Shen, C.Y., Lee, W.C., Chen, M.S.: On socio-spatial group query for location-based social networks. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 949–957. ACM (2012)

    Google Scholar 

  33. Zhou, Y., Xie, X., Wang, C., Gong, Y., Ma, W.Y.: Hybrid index structures for location-based web search. In: Proceedings of the 14th ACM International Conference on Information and Knowledge Management, pp. 155–162. ACM (2005)

    Google Scholar 

Download references

Acknowledgment

This research was supported by the Ministry of Science and Technology in Taiwan under the grants MOST 107-2813-C-845-025-E.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Taipei, Taipei, Taiwan (R.O.C.)

    Chih-Yang Huang & Yen Hung Chen

  2. Research Center for Information Technology Innovation, Academia Sinica, Taipei, Taiwan (R.O.C.)

    Po-Chuan Chien

Authors
  1. Chih-Yang Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Po-Chuan Chien
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yen Hung Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chih-Yang Huang .

Editor information

Editors and Affiliations

  1. National Yunlin University of Science and Technology, Douliu, Taiwan

    Chuan-Yu Chang

  2. National Yunlin University of Science and Technology, Douliu, Taiwan

    Chien-Chou Lin

  3. Southern Taiwan University of Science and Technology, Tainan, Taiwan

    Horng-Horng Lin

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, CY., Chien, PC., Chen, Y.H. (2019). A Measure and Conquer Algorithm for the Minimum User Spatial-Aware Interest Group Query Problem. In: Chang, CY., Lin, CC., Lin, HH. (eds) New Trends in Computer Technologies and Applications. ICS 2018. Communications in Computer and Information Science, vol 1013. Springer, Singapore. https://doi.org/10.1007/978-981-13-9190-3_47

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-9190-3_47

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-9189-7

  • Online ISBN: 978-981-13-9190-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics