Sample Location Selection for Efficient Distance-Aware Influence Maximization in Geo-Social Networks

  • Ming Zhong
  • Qian Zeng
  • Yuanyuan Zhu
  • Jianxin Li
  • Tieyun Qian
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10827)


In geo-social networks, the distances of users to a location play an important role in populating the business or campaign at the location. Thereby, the problem of Distance-Aware Influence Maximization (DAIM) has been investigated recently. The efficiency of DAIM computation heavily relies on the sample location selection, because the online seeding performance is sensitive to the distance between sample location and promoted location, and the offline precomputation performance is sensitive to the number of samples. However, there is no work to fully study the problem of sample location selection w.r.t. DAIM in geo-social networks. To do this, we first formalize the problem under a reasonable assumption that a promoted location always adheres to the distribution of users. Then, we propose an efficient location sampling approach based on the heuristic anchor point selection and facility allocation techniques. Our experimental results on two real datasets demonstrate that our approach can improve the online and offline efficiency of DAIM approach like [9] by orders of magnitude.



This paper was supported by National Natural Science Foundation of China under Grant No. 61202036, 61502349 and 61572376.


  1. 1.
    Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: SIGKDD, pp. 137–146 (2003)Google Scholar
  2. 2.
    Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: ACM KDD (2007)Google Scholar
  3. 3.
    Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: SIGKDD, pp. 1029–1038 (2010)Google Scholar
  4. 4.
    Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: scaling up with guarantees. In: CIKM, pp. 629–638 (2014)Google Scholar
  5. 5.
    Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: International Conference on Data Mining, pp. 88–97 (2010)Google Scholar
  6. 6.
    Zhu, W., Peng, W., Chen, L., Zheng, K., Zhou, X.: Modeling user mobility for location promotion in location-based social networks. In: SIGKDD, pp. 1573–1582 (2015)Google Scholar
  7. 7.
    Cai, J.L.Z., Yan, M., Li, Y.: Using crowdsourced data in location-based social networks to explore influence maximization. In: IEEE International Conference on Computer Communications, pp. 1–9 (2016)Google Scholar
  8. 8.
    Li, G., Chen, S., Feng, J., Tan, K., Li, W.: Efficient location-aware influence maximization. In: SIGMOD, pp. 87–98 (2014)Google Scholar
  9. 9.
    Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social network. IEEE Trans. Knowl. Data Eng. 29(3), 599–612 (2017)CrossRefGoogle Scholar
  10. 10.
    Wang, X., Zhang, Y., Zhang, W., Lin, X.: Distance-aware influence maximization in geo-social network. In: ICDE, pp. 1–12 (2016)Google Scholar
  11. 11.
    Weber, A.: Über den Standort der Industrien 1. Reine theorie des standordes, Tübingen, Germany, Teil (1909)Google Scholar
  12. 12.
    Arabani, A.B., Farahani, R.Z.: Facility location dynamics: an overview of classifications and applications. Comput. Ind. Eng. 62(1), 408–420 (2012)CrossRefGoogle Scholar
  13. 13.
    Irawan, C.A., Salhi, S.: Aggregation and non aggregation techniques for large facility location problems: a survey. Yugosl. J. Oper. Res. 25(3), 313–341 (2015)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Elzinga, J., Hearn, D.W.: Geometrical solutions for some minimax location problems. Transp. Sci. 6, 379–394 (1972)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Drezner, Z., Wesolowsky, G.O.: Single facility l\(_p\)-distance minimax location. SIAM J. Algebr. Discret. Methods 3, 315–321 (1980)CrossRefGoogle Scholar
  16. 16.
    Drezner, Z.: The \(p\)-centre problem-heuristic and optimal algorithm. J. Oper. Res. Soc. 35(8), 741–748 (1984)zbMATHGoogle Scholar
  17. 17.
    Callaghan, B., et al.: Speeding up the optimal method of Drezner for the p-centre problem in the plane. Eur. J. Oper. Res. 257(3), 722–734 (2017)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133–137 (1981)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Ming Zhong
    • 1
  • Qian Zeng
    • 1
  • Yuanyuan Zhu
    • 1
  • Jianxin Li
    • 2
  • Tieyun Qian
    • 1
  1. 1.School of ComputerWuhan UniversityWuhanChina
  2. 2.School of Computer Science and Software EngineeringUniversity of Western AustraliaCrawleyAustralia

Personalised recommendations