More Web Proxy on the site http://driver.im/

research-article

Efficient Similarity-Aware Influence Maximization in Geo-Social Network

Authors:

Kai ZhengAuthors Info & Claims

IEEE Transactions on Knowledge and Data Engineering, Volume 34, Issue 10

Pages 4767 - 4780

https://doi.org/10.1109/TKDE.2020.3045783

Published: 01 October 2022 Publication History

Abstract

With the explosion of GPS-enabled smartphones and social media platforms, geo-social networks are increasing as tools for businesses to promote their products or services. Influence maximization, which aims to maximize the expected spread of influence in the networks, has drawn increasing attention. However, most recent work tries to study influence maximization by only considering geographic distance, while ignoring the influence of users’ spatio-temporal behavior on information propagation or location promotion, which can often lead to poor results. To relieve this problem, we propose a Similarity-aware Influence Maximization (SIM) model to efficiently maximize the influence spread by taking the effect of users’ spatio-temporal behavior into account, which is more reasonable to describe the real information propagation. We first calculate the similarity between users according to their historical check-ins, and then we propose a Propagation to Consumption (PTC) model to capture both online and offline behaviors of users. Finally, we propose two greedy algorithms to efficiently maximize the influence spread. The extensive experiments over real datasets demonstrate the efficiency and effectiveness of the proposed algorithms.

References

[1]

D. Kempe, J. Kleinberg, and É. Tardos, “Maximizing the spread of influence through a social network,” in Proc. 9th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2003, pp. 137–146.

[2]

W. Chen, C. Wang, and Y. Wang, “Scalable influence maximization for prevalent viral marketing in large-scale social networks,” in Proc. 16th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2010, pp. 1029–1038.

[3]

S. Chen, J. Fan, G. Li, J. Feng, K.-L. Tan, and J. Tang, “Online topic-aware influence maximization,” Proc. VLDB Endowment, vol. 8, no. 6, pp. 666–677, 2015.

[4]

S. Feng, X. Chen, G. Cong, Y. Zeng, Y. M. Chee, and Y. Xiang, “Influence maximization with novelty decay in social networks,” in Proc. 28th AAAI Conf. Artif. Intell., 2014, pp. 37–43.

[5]

Z. Wang, E. Chen, Q. Liu, Y. Yang, Y. Ge, and B. Chang, “Maximizing the coverage of information propagation in social networks,” in Proc. 24th Int. Conf. Artif. Intell., 2015, pp. 2104–2110.

[6]

Y. Li, D. Zhang, and K.-L. Tan, “Real-time targeted influence maximization for online advertisements,” Proc. VLDB Endowment, vol. 8, no. 10, pp. 1070–1081, 2015.

[7]

W. Chen, Y. Wang, and S. Yang, “Efficient influence maximization in social networks,” in Proc. 15th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2009, pp. 199–208.

[8]

Y. Tang, Y. Shi, and X. Xiao, “Influence maximization in near-linear time: A martingale approach,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2015, pp. 1539–1554.

[9]

G. Tong, W. Wu, S. Tang, and D.-Z. Du, “Adaptive influence maximization in dynamic social networks,” IEEE/ACM Trans. Netw., vol. 25, no. 1, pp. 112–125, Feb. 2017.

Digital Library

[10]

J. L. Z. Cai, M. Yan, and Y. Li, “Using crowdsourced data in location-based social networks to explore influence maximization,” in Proc. 35th Annu. IEEE Int. Conf. Comput. Commun., 2016, pp. 1–9.

[11]

J. Li, T. Sellis, J. S. Culpepper, Z. He, C. Liu, and J. Wang, “Geo-social influence spanning maximization,” IEEE Trans. Knowl. Data Eng., vol. 29, no. 8, pp. 1653–1666, Aug. 2017.

Digital Library

[12]

X. Wang, Y. Zhang, W. Zhang, and X. Lin, “Efficient distance-aware influence maximization in geo-social networks,” IEEE Trans. Knowl. Data Eng., vol. 29, no. 3, pp. 599–612, Mar. 2017.

Digital Library

[13]

G. Li, S. Chen, J. Feng, K.-L. Tan, and W.-S. Li, “Efficient location-aware influence maximization,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2014, pp. 87–98.

[14]

X. Wang, Y. Zhang, W. Zhang, and X. Lin, “Distance-aware influence maximization in geo-social network,” in Proc. IEEE 32nd Int. Conf. Data Eng., 2016, pp. 1–12.

[15]

W.-Y. Zhu, W.-C. Peng, L.-J. Chen, K. Zheng, and X. Zhou, “Modeling user mobility for location promotion in location-based social networks,” in Proc. 21th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2015, pp. 1573–1582.

[16]

E. Cho, S. A. Myers, and J. Leskovec, “Friendship and mobility: User movement in location-based social networks,” in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2011, pp. 1082–1090.

[17]

M. Esteret al., “A density-based algorithm for discovering clusters in large spatial databases with noise,” in Proc. 2nd Int. Conf. Knowl. Discov. Data Mining, 1996, pp. 226–231.

[18]

Q. Yuan, G. Cong, Z. Ma, A. Sun, and N. M. Thalmann, “Time-aware point-of-interest recommendation,” in Proc. 36th Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval, 2013, pp. 363–372.

[19]

Z. Yao, Y. Fu, B. Liu, Y. Liu, and H. Xiong, “POI recommendation: A temporal matching between POI popularity and user regularity,” in Proc. IEEE 16th Int. Conf. Data Mining, 2016, pp. 549–558.

[20]

W. Wang, M. Tang, H.-F. Zhang, H. Gao, Y. Do, and Z.-H. Liu, “Epidemic spreading on complex networks with general degree and weight distributions,” Physical Rev. E, vol. 90, no. 4, 2014, Art. no.

[21]

T. Zhou, J. Cao, B. Liu, S. Xu, Z. Zhu, and J. Luo, “Location-based influence maximization in social networks,” in Proc. 24th ACM Int. Conf. Inf. Knowl. Manage., 2015, pp. 1211–1220.

[22]

J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, “Cost-effective outbreak detection in networks,” in Proc. 13th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2007, pp. 420–429.

[23]

A. Likhyani, S. Bedathur, and P. Deepak, “LoCaTe: Influence quantification for location promotion in location-based social networks,” in Proc. 26th Int. Joint Conf. Artif. Intell., 2017, pp. 2259–2265.

[24]

Y. Tang, X. Xiao, and Y. Shi, “Influence maximization: Near-optimal time complexity meets practical efficiency,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2014, pp. 75–86.

[25]

A. Goyal, W. Lu, and L. V. Lakshmanan, “CELF++ optimizing the greedy algorithm for influence maximization in social networks,” in Proc. 20th Int. Conf. Companion World Wide Web, 2011, pp. 47–48.

[26]

C. Borgs, M. Brautbar, J. Chayes, and B. Lucier, “Maximizing social influence in nearly optimal time,” in Proc. 25th Annu. ACM-SIAM Symp. Discrete Algorithms, 2014, pp. 946–957.

[27]

J. Li, T. Cai, K. Deng, X. Wang, T. Sellis, and F. Xia, “Community-diversified influence maximization in social networks,” Inf. Syst., vol. 92, 2020, Art. no.

[28]

N. Alduaiji, A. Datta, and J. Li, “Influence propagation model for clique-based community detection in social networks,” IEEE Trans. Comput. Soc. Syst., vol. 5, no. 2, pp. 563–575, Jun. 2018.

[29]

Q. Guo, S. Wang, Z. Wei, and M. Chen, “Influence maximization revisited: Efficient reverse reachable set generation with bound tightened,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2020, pp. 2167–2181.

[30]

L. Sun, A. Chen, P. S. Yu, and W. Chen, “Influence maximization with spontaneous user adoption,” in Proc. 13th Int. Conf. Web Search Data Mining, 2020, pp. 573–581.

[31]

S. Huang, Z. Bao, J. S. Culpepper, and B. Zhang, “Finding temporal influential users over evolving social networks,” in Proc. IEEE 35th Int. Conf. Data Eng., 2019, pp. 398–409.

[32]

S. Bian, Q. Guo, S. Wang, and J. X. Yu, “Efficient algorithms for budgeted influence maximization on massive social networks,” Proc. VLDB Endowment, vol. 13, no. 9, pp. 1498–1510, 2020.

[33]

C. Zhang, L. Shou, K. Chen, G. Chen, and Y. Bei, “Evaluating geo-social influence in location-based social networks,” in Proc. 21st ACM Int. Conf. Inf. Knowl. Manage., 2012, pp. 1442–1451.

[34]

H. Gao, J. Tang, X. Hu, and H. Liu, “Modeling temporal effects of human mobile behavior on location-based social networks,” in Proc. 22nd ACM Int. Conf. Inf. Knowl. Manage., 2013, pp. 1673–1678.

[35]

M. Lichman and P. Smyth, “Modeling human location data with mixtures of kernel densities,” in Proc. 20th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining, 2014, pp. 35–44.

[36]

L. Guo, D. Zhang, G. Cong, W. Wu, and K.-L. Tan, “Influence maximization in trajectory databases,” IEEE Trans. Knowl. Data Eng., vol. 29, no. 3, pp. 627–641, Mar. 2017.

Digital Library

[37]

T. Caiet al., “Target-aware holistic influence maximization in spatial social networks,” IEEE Trans. Knowl. Data Eng., 2020.

Cited By

Zareie ASakellariou R(2024)Fuzzy Influence Maximization in Social NetworksACM Transactions on the Web10.1145/365017918:3(1-28)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1145/3650179
Sun XZhou JLiu LWei W(2023)Explicit time embedding based cascade attention network for information popularity predictionInformation Processing and Management: an International Journal10.1016/j.ipm.2023.10327860:3Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1016/j.ipm.2023.103278

Index Terms

Efficient Similarity-Aware Influence Maximization in Geo-Social Network
1. Human-centered computing
2. Information systems
  1. Information systems applications
    1. Data mining
    2. Spatial-temporal systems

Index terms have been assigned to the content through auto-classification.

Recommendations

Efficient location-aware influence maximization
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data

users in a social network to maximize the expected number of users influenced by the selected users (called influence spread), has been extensively studied, existing works neglected the fact that the location information can play an important role in ...
Efficient Distance-Aware Influence Maximization in Geo-Social Networks

Given a social network $\mathcal {G}$ and a positive integer $k$ , the influence maximization problem aims to identify a set of $k$ nodes in $\mathcal {G}$ that can maximize the influence spread under a certain propagation model. As the proliferation of geo-social networks, location-...
Time and value aware influence blocking maximization in geo-social networks
Abstract
The influence blocking maximization (IBM) problem aims to identify the most influential set of positive nodes in a social network to prevent the propagation of negative information throughout the network. However, existing studies have not ... $()$

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Knowledge and Data Engineering

IEEE Transactions on Knowledge and Data Engineering Volume 34, Issue 10

Oct. 2022

502 pages

ISSN:1041-4347

Issue’s Table of Contents

1041-4347 © 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 October 2022

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zareie ASakellariou R(2024)Fuzzy Influence Maximization in Social NetworksACM Transactions on the Web10.1145/365017918:3(1-28)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1145/3650179
Sun XZhou JLiu LWei W(2023)Explicit time embedding based cascade attention network for information popularity predictionInformation Processing and Management: an International Journal10.1016/j.ipm.2023.10327860:3Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1016/j.ipm.2023.103278

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents