Abstract
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 is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Change history
01 July 2018
The original version of this chapter titled “Free-Rider Episode Screening via Dual Partition Model” contained the following three mistakes:
- 1.
In table 1, row 2, column 3, the average occurrence per event on STK dataset was “1.037”. It should be “1,037”.
- 2.
The last model name in the legend of Figure 3 was “EIP”. It should be “EDP”.
- 3.
In the experiment part the stock symbols and their companies were confused.
In the updated version these mistakes were corrected.
In the originally published version of chapters titled “BASSI: Balance and Status Combined Signed Network Embedding” and “Sample Location Selection for Efficient Distance-Aware Influence Maximization in Geo-Social Networks” the funding information in the acknowledgement section was incomplete. This has now been corrected.
- 1.
Notes
- 1.
The 2D space in this example is the surface of earth. In reality, we only consider a city or even smaller district for location promotion. However, the situation of sparse user distribution remains the same.
References
Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: SIGKDD, pp. 137–146 (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: ACM KDD (2007)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: SIGKDD, pp. 1029–1038 (2010)
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)
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)
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)
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)
Li, G., Chen, S., Feng, J., Tan, K., Li, W.: Efficient location-aware influence maximization. In: SIGMOD, pp. 87–98 (2014)
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)
Wang, X., Zhang, Y., Zhang, W., Lin, X.: Distance-aware influence maximization in geo-social network. In: ICDE, pp. 1–12 (2016)
Weber, A.: Über den Standort der Industrien 1. Reine theorie des standordes, Tübingen, Germany, Teil (1909)
Arabani, A.B., Farahani, R.Z.: Facility location dynamics: an overview of classifications and applications. Comput. Ind. Eng. 62(1), 408–420 (2012)
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)
Elzinga, J., Hearn, D.W.: Geometrical solutions for some minimax location problems. Transp. Sci. 6, 379–394 (1972)
Drezner, Z., Wesolowsky, G.O.: Single facility l\(_p\)-distance minimax location. SIAM J. Algebr. Discret. Methods 3, 315–321 (1980)
Drezner, Z.: The \(p\)-centre problem-heuristic and optimal algorithm. J. Oper. Res. Soc. 35(8), 741–748 (1984)
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)
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)
Acknowledgement
This paper was supported by National Natural Science Foundation of China under Grant No. 61202036, 61502349 and 61572376 and Natural Science Foundation of Hubei Province under Grant No. 2018CFB616.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Zhong, M., Zeng, Q., Zhu, Y., Li, J., Qian, T. (2018). Sample Location Selection for Efficient Distance-Aware Influence Maximization in Geo-Social Networks. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds) Database Systems for Advanced Applications. DASFAA 2018. Lecture Notes in Computer Science(), vol 10827. Springer, Cham. https://doi.org/10.1007/978-3-319-91452-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-91452-7_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91451-0
Online ISBN: 978-3-319-91452-7
eBook Packages: Computer ScienceComputer Science (R0)