Skip to main content
Log in

Maximizing the influence of bichromatic reverse k nearest neighbors in geo-social networks

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Geo-social networks offer opportunities for the marketing and promotion of geo-located services. In this setting, we explore a new problem, called Maximizing the Influence of Bichromatic Reverse k Nearest Neighbors (MaxInfBRkNN). The objective is to find a set of points of interest (POIs), which are geo-textually and socially relevant to social influencers who are expected to largely promote the POIs online. In other words, the problem aims to detect an optimal set of POIs with the largest word-of-mouth (WOM) marketing potential. This functionality is useful in various real-life applications, including social advertising, location-based viral marketing, and personalized POI recommendation. However, solving MaxInfBRkNN with theoretical guarantees is challenging because of the prohibitive overheads on BRkNN retrieval in geo-social networks, and the NP and #P-hardness of finding the optimal POI set. To achieve practical solutions, we present a framework with carefully designed indexes, efficient batch BRkNN processing algorithms, and alternative POI selection policies that support both approximate and heuristic solutions. Extensive experiments on real and synthetic datasets demonstrate the good performance of our proposed methods.

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

Access this article

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

Instant access to the full article PDF.

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Algorithm 1
Algorithm 2
Algorithm 3
Algorithm 4
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12

Similar content being viewed by others

Data availability

The codes and corresponding datasets are available at https://github.com/ZJU-DAILY/MaxInfBRkNN.

Notes

  1. https://edition.cnn.com/business/newsfeeds/globenewswire/7812666.html

  2. The Zipfian distribution indicates that most of keywords in the datasets appear infrequently [1]

  3. http://www.yelp.com/dataset_challenge/

  4. https://www.openstreetmap.org/

  5. http://www.dis.uniroma1.it/challenge9/

  6. Zipf’s law predicts that the frequency ft of a keyword t in real-world datasets satisfies \(f_{t} \propto \frac {1}{r_{t}^{\alpha }}\), where rt is the rank of t and α ≈ 1, which means most keywords in the datasets occur infrequently [1].

  7. As POIs often have multiple keywords, infrequent keywords also can be covered by these POIs.

References

  1. Abeywickrama, T., Cheema, M., Khan, A.: K-spin: Efficiently processing spatial keyword queries on road networks. TKDE 32(5), 983–997 (2020)

    Google Scholar 

  2. Ahuja, R., Armenatzoglou, N., Papadias, D., Fakas, G.: Geo-social keyword search. In: SSTD, pp. 431–450 (2015)

  3. Akiba, T., Iwata, Y., Kawarabayashi, K., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: ALENEX, pp. 147–154 (2014)

  4. Bian, S., Guo, Q., Wang, S., Yu, J.: Efficient algorithms for budgeted influence maximization on massive social networks. PVLDB 13(9), 1498–1510 (2020)

    Google Scholar 

  5. Borgs, C., Brautbar, M., Chayes, J. T., Lucier, B.: Maximizing social influence in nearly optimal time. In: SODA, pp. 946–957 (2014)

  6. Cao, X., Cong, G., Guo, T., Jensen, C. S., Ooi, B. C.: Collective spatial keyword querying. In: SIGMOD, p. 373–384 (2011)

  7. Chen, L., Cong, G., Jensen, C., Wu, D.: Spatial keyword query processing: an experimental evaluation. PVLDB 6(3), 217–228 (2013)

    Google Scholar 

  8. Chen, L., Shang, S., Yang, C., Li, J.: Spatial keyword search: a survey. GeoInformatica, 85–106 (2020)

  9. Chen, X., Cao, X., Xu, Z., Zhang, Y., Shang, S., Zhang, W.: Accelerate Maxbrknn Search by Knn Estimation. In: 35Th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8-11, 2019, Pp. 1730–1733. IEEE (2019)

  10. Chen, X., Deng, L., Zhao, Y., Zhou, X., Zheng, K.: Community-based influence maximization in location-based social network. World Wide WEB 24(6), 1903–1928 (2021)

    Article  Google Scholar 

  11. Choudhury, F., Culpepper, J., Bao, Z., Sellis, T.: Finding the optimal location and keywords in obstructed and unobstructed space. VLDBJ 27(4), 445–470 (2018)

    Article  Google Scholar 

  12. Choudhury, F., Culpepper, J., Sellis, T., Cao, X.: Maximizing bichromatic reverse spatial and textual k nearest neighbor queries. PVLDB 9(6), 1414–1417 (2016)

    Google Scholar 

  13. Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57–66 (2001)

  14. Feige, U.: A threshold of ln n for approximating set cover. J. ACM 20(3), 634–652 (1998)

    Article  MATH  Google Scholar 

  15. Gkorgkas, O., Vlachou, A., Doulkeridis, C., Nørvag, K.: Maximizing influence of spatio-textual objects based on keyword selection. In: SSTD, pp. 413–430 (2015)

  16. Guo, Q., Wang, S., Wei, Z., Chen, M.: Influence maximization revisited: efficient reverse reachable set generation with bound tightened. In: SIGMOD, pp. 2167–2181 (2020)

  17. Guo, Q., Wang, S., Wei, Z., Chen, M.: Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened. In: SIGMOD, pp. 62167–2181 (2020)

  18. Han, P., Li, Z., Liu, Y., Zhao, P., Li, J., Wang, H., Shang, S.: Contextualized point-of-interest recommendation. In: IJCAI, pp. 2484–2490 (2020)

  19. Han, P., Shang, S., Sun, A., Zhao, P., Kai, Z., Kalnis, P.: Auc-Mf: Point of interest recommendation with auc maximization. In: ICDE, pp. 1558–1561 (2019)

  20. Huang, K., Tang, J., Han, K., Xiao, X., Chen, W., Sun, A., Tang, X., Lim, A.: Efficient approximation algorithms for adaptive influence maximization. VLDBJ 29(6), 1385–1406 (2020)

    Article  Google Scholar 

  21. Hung, H., Yang, D., Lee, W.: Social influence-aware reverse nearest neighbor search. ACM Trans. Spatial Alg. Syst 2(3), 1–35 (2016)

    Article  Google Scholar 

  22. Jin, P., Chen, L., Gao, Y., Chang, X., Liu, Z., Jensen, C.S.: Maximizing the influence of bichromatic reverse k nearest neighbors in geo-social networks. [Online] (2022). https://arxiv.org/abs/2204.10203. Accessed 2022-09-18

  23. Jin, P., Gao, Y., Lu, C., Zhao, J.: Efficient group processing for multiple reverse top-k geo-social keyword queries. In: DASFAA, pp. 279–287 (2020)

  24. Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD, pp. 137–146 (2003)

  25. Kolahdouzan, M., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB, p. 840–851 (2004)

  26. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201–212 (2000)

  27. Li, G., Chen, S., Feng, J., Tan, K., Li, W.: Efficient location-aware influence maximization. In: SIGMOD, pp. 87–98 (2014)

  28. Lu, J., Lu, Y., Cong, G.: Reverse spatial and textual K nearest neighbor search. In: SIGMOD, pp. 349–360 (2011)

  29. Lu, Y., Lu, J., Cong, G., Wu, W., Shahabi, C.: Efficient algorithms and cost models for reverse spatial-keyword k-nearest neighbor search. ACM Trans. Database Syst. 39(2), 3:113:46 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  30. Luo, H., Choudhury, F., Culpepper, J., Bao, Z., Zhang, B.: Maxbrknn queries for streaming geo-data. In: DASFAA, pp. 647–664 (2018)

  31. Nguyen, H., Dinh, T., Thai, M.: Cost-aware targeted viral marketing in billion-scale. In: INFOCOM, pp. 337–346 (2017)

  32. Ohsaka, N., Sonobe, T., Fujita, S., Kawarabayashi, K.: Coarsening massive influence networks for scalable diffusion analysis. In: SIGMOD, pp. 635–650 (2017)

  33. Piantadosi, S.: Zipf’s word frequency law in natural language: a critical review and future directions. Psychon. Bull. Rev. 21(5), 1112–1130 (2014)

    Article  Google Scholar 

  34. Rao, X., Chen, L., Liu, Y., Shang, S., Yao, B., Han, P.: Graph-flashback network for next location recommendation. In: KDD (2022)

  35. Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD, pp. 61–70 (2002)

  36. Rocha-Junior, J., Norvag, K.: Top-K Spatial Keyword Queries on Road Networks. In: EDBT, pp. 168–179 (2012)

  37. Salton, G., Buckley, C.: Term-weighting approaches in automatic text retrieval. Inf. Process. Manag. 24(5), 513–523 (1988)

    Article  Google Scholar 

  38. Shang, S., Deng, K., Xie, K.: Best point detour query in road networks. In: GIS, pp. 71–80 (2010)

  39. Shang, S., Guo, D., Liu, J., Zheng, K., Wen, J.: Finding regions of interest using location based social media. Neurocomputing 173, 118–123 (2016)

    Article  Google Scholar 

  40. 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 (2011)

  41. Shang, S., Zheng, K., Jensen, C., Yang, B., Kalnis, P., Li, G., Wen, J.: Discovery of path nearby clusters in spatial networks. TKDE 27(6), 1505–1518 (2015)

    Google Scholar 

  42. Shi, J., Mamoulis, N., Wu, D., Cheung, D. W.: Density-Based Place Clustering in Geo-Social Networks. In: SIGMOD, pp. 99–110 (2014)

  43. Tang, J., Tang, X., Xiao, X., Yuan, J.: Online processing algorithms for influence maximization. In: SIGMOD, pp. 991–1005 (2018)

  44. Tang, J., Tang, X., Yuan, J.: Influence maximization meets efficiency and effectiveness: a hop-based approach. In: ASONAM, pp. 64–71 (2017)

  45. Tang, J., Tang, X., Yuan, J.: An efficient and effective hop-based approach for influence maximization in social networks. Soc. Netw. Anal. Min. 8(1), 10–560 (2018)

    Article  Google Scholar 

  46. Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD, pp. 1539–1554 (2015)

  47. Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks. PVLDB 10(2), 61–72 (2016)

    Google Scholar 

  48. Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geosocial networks, vol. 29 (2017)

  49. Wang, Y., Li, J., Zhong, Y., Zhu, S., Guo, D., Shang, S.: Discovery of accessible locations using region-based geo-social data. World Wide WEB 22(3), 929–944 (2019)

    Article  Google Scholar 

  50. Wong, R., Ozsu, M., Yu, P., Fu, A., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2(1), 1126–1137 (2009)

    Google Scholar 

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

    Article  Google Scholar 

  52. Yao, B., Chen, Z., Xiaofeng, G., Shang, S., Ma, S., Minyi, G.: Flexible aggregate nearest neighbor queries in road networks. In: ICDE, pp. 761–772 (2018)

  53. Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbors in large graphs. TKDE 18(4), 540–553 (2006)

    Google Scholar 

  54. Zhao, J., Gao, Y., Chen, G., Chen, R.: Why-not questions on top-K geo-social keyword queries in road networks. In: ICDE, pp. 965–976 (2018)

  55. Zhao, J., Gao, Y., Chen, G., Jensen, C. S., Chen, R., Cai, D.: Reverse top-K geo-social keyword queries in road networks. In: ICDE, pp. 387–398 (2017)

  56. Zhong, R., Li, G., Tan, K.L., Zhou, L., Gong, Z.: G-tree: An efficient and scalable index for spatial search on road networks. TKDE 27(8), 2175–2189 (2015)

    Google Scholar 

  57. Zhongpu, C., Bin, Y., ZhiJie, W., Xiaofeng, G., Shuo, S., Shuai, M., Minyi, G.: Flexible aggregate nearest neighbor queries and its keyword-aware variant on road networks. TKDE 33(12), 3701–3715 (2021)

    Google Scholar 

Download references

Acknowledgements

This work was supported in part by the NSFC under Grants No. (62025206, 61972338, and 62102351). Yunjun Gao is the corresponding author of this work.

Funding

No applicable.

Author information

Authors and Affiliations

Authors

Contributions

Pengfei Jin gave the main idea of this paper, programmed the codes and made experiments. The first draft of the manuscript was written by Pengfei Jin and Lu Chen. The material preparation includes figures, data analysis were performed by Pengfei Jin, Xueqin Chang and Zhanyu Liu. Yunjun Gao and Christian S. Jensen gave suggestions and help to improve the manuscript. All the authors read and approved the final manuscript of this paper.

Corresponding author

Correspondence to Pengfei Jin.

Ethics declarations

Ethics approval and consent to participate

Not applicable.

Consent for Publication

The authors all agree with the content for publication.

Competing interests

The authors declare that they have no competing interests.

Human and animal ethics

Not applicable.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jin, P., Chen, L., Gao, Y. et al. Maximizing the influence of bichromatic reverse k nearest neighbors in geo-social networks. World Wide Web 26, 1567–1598 (2023). https://doi.org/10.1007/s11280-022-01096-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-022-01096-1

Keywords

Navigation