Jie Yang
Abstract
The influence are not linked to any footnote in the text. Please check and suggest. maximization problem aims at selecting the k most influential nodes (i.e., seed nodes) from a social network, where the nodes can maximize the number of influenced nodes activated by a certain propagation model. However, the widely used Independent Cascade model shares the same propagation probability among substantial adjacent node pairs, which is too idealistic and unreasonable in practice. In addition, most heuristic algorithms for influence maximization need to update the expected influence of the remaining nodes in the seed selection process, resulting in high computation cost. To address these non-trivial problems, we propose a novel edge propagation probability calculation method. The method first utilizes the triadic closure structure of social networks to precisely measure the closeness between nodes and assigns different propagation probabilities to each edge, deriving a Triadic Closure-based Independent Cascade (TC-IC) model. Then, we further propose a heuristic influence maximization algorithm named Triadic Closure-based Influence Maximization (TC-IM). The algorithm evaluates the expected influence of a node by integrating the triadic closure weighted propagation probability and the triadic closure weighted degree. Especially, in the seed selection process, only the most influential node that has not been updated in the current round needs to be updated, which significantly improves the efficiency. Besides, we further provide theoretical proofs to guarantee the correctness of this updating strategy. Experimental results on nine real datasets and three propagation models demonstrate that: (1) The TC-IC model can set a proper propagation probability for each node pair, where the IM algorithms could easily identify influential nodes; (2) The TC-IM algorithm can significantly reduce the complexity through an efficient updating strategy with a comparable influence spread to the approximation IM algorithms; (3) Besides, the TC-IM algorithm also exhibits stable performance under other IC models including UIC and WIC, exhibiting good stability and generality.
- [1] . 2019. Maximizing welfare in social networks under a utility driven influence diffusion model. In Proceedings of the 2019 International Conference on Management of Data, SIGMOD. ACM, 1078–1095.Google Scholar
Digital Library
- [2] . 2014. Word of mouth and interpersonal communication: A review and directions for future research. Journal of Consumer Psychology 24, 4 (2014), 586–607.Google ScholarCross Ref
- [3] . 2014. Maximizing social influence in nearly optimal time. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA. SIAM, 946–957.Google ScholarCross Ref
- [4] . 2017. Community-based influence maximization in social networks under a competitive linear threshold model. Knowledge-based Systems 134 (2017), 149–158.Google ScholarCross Ref
- [5] . 2019. Self-interest influence maximization algorithm based on subject preference in competitive environment. Chinese Journal of Computers 42, 07 (2019), 1495–1510.Google Scholar
- [6] . 2020. Research on social network influence maximization algorithm based on time sequential relationship. Journal of Communications 41, 10 (2020), 211–221.Google Scholar
- [7] . 2015. Online topic-aware influence maximization. Proceedings of the VLDB Endowment 8, 6 (2015), 666–677.Google ScholarDigital Library
- [8] . 2012. Time-critical influence maximization in social networks with time-delayed diffusion process. In Proceedings of the 26th AAAI Conference on Artificial Intelligence. AAAI,592–598.Google Scholar
- [9] . 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 199–208.Google ScholarDigital Library
- [10] . 2016. Combinatorial multi-armed bandit and its extension to probabilistically triggered arms. Journal of Machine Learning Research 17, 50 (2016), 1–33.Google ScholarDigital Library
- [11] . 2001. Mining the network value of customers. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, 57–66.Google ScholarDigital Library
- [12] . 1998. WordNet: An Electronic Lexical Database. MIT Press.Google ScholarCross Ref
- [13] . 2010. Learning influence probabilities in social networks. In Proceedings of the 3rd International Conference on Web Search and Web Data Mining., , , and (Eds.), ACM, 241–250.Google ScholarDigital Library
- [14] . 2011. CELF++: Optimizing the greedy algorithm for influence maximization in social networks. In Proceedings of the 20th International Conference on World Wide Web, WWW’11. ACM, 47–48.Google ScholarDigital Library
- [15] . 2019. TIFIM: A two-stage iterative framework for influence maximization in social networks. Applied Mathematics and Computation 354 (2019), 338–352.Google ScholarDigital Library
- [16] . 2012. Influence blocking maximization in social networks under the competitive linear threshold model. In Proceedings of the 12th SIAM International Conference on Data Mining. SIAM/Omnipress, 463–474.Google ScholarCross Ref
- [17] . 2018. Will triadic closure strengthen ties in social networks? ACM Transactions on Knowledge Discovery from Data 12, 3 (2018), 30:1–30:25.Google Scholar
- [18] . 2020. Efficient approximation algorithms for adaptive influence maximization. VLDB Journal 29, 6 (2020), 1385–1406.Google ScholarDigital Library
- [19] . 2001. Lethality and centrality in protein networks. Nature 411, 6833 (2001), 41–42.Google ScholarCross Ref
- [20] . 2019. Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization. Physica A: Statistical Mechanics and its Applications 513 (2019), 477–496.Google ScholarCross Ref
- [21] . 2021. A survey of community detection approaches: From statistical modeling to deep learning. IEEE Transactions on Knowledge and Data Engineering (2021), Google ScholarCross Ref
- [22] . 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 137–146.Google ScholarDigital Library
- [23] . 2005. Influential nodes in a diffusion model for social networks. In Proceedings of the International Colloquium on Automata, Languages, and Programming. Springer, 1127–1138.Google Scholar
- [24] . 2021. An efficient path-based approach for influence maximization in social networks. Expert Systems with Applications 167, 6 (2021), 114168.Google ScholarDigital Library
- [25] . 2013. KONECT: The Koblenz network collection. In Proceedings of the 22nd International World Wide Web Conference, WWW’13. ACM, 1343–1350.Google ScholarDigital Library
- [26] . 2013. STRIP: Stream learning of influence probabilities. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. , , , , , , , , and (Eds.), ACM, 275–283.Google ScholarDigital Library
- [27] . 2005. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 177–187.Google ScholarDigital Library
- [28] . 2007. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data 1, 1 (2007), 2.Google ScholarDigital Library
- [29] . 2007. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 420–429.Google ScholarDigital Library
- [30] . 2012. Time constrained influence maximization in social networks. In Proceedings of the12th IEEE International Conference on Data Mining, ICDM. IEEE Computer Society, 439–448.Google ScholarDigital Library
- [31] . 2017. A fast and efficient algorithm for mining top-k nodes in complex networks. Scientific Reports 7 (2017), 43330.Google ScholarCross Ref
- [32] . 2012. Influential seed items recommendation. In Proceedings of the 6th ACM Conference on Recommender Systems. ACM, 245–248.Google ScholarDigital Library
- [33] . 2017. Probability-based multi-hop diffusion method for influence maximization in social networks. Wireless Personal Communications 93, 4 (2017), 903–916.Google ScholarDigital Library
- [34] . 2017. Importance sketching of influence dynamics in billion-scale networks. In Proceedings of the 2017 IEEE International Conference on Data Mining, ICDM’17. IEEE Computer Society, 337–346.Google ScholarCross Ref
- [35] . 2016. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD’16. ACM, 695–710.Google ScholarDigital Library
- [36] . 2002. Mining knowledge-sharing sites for viral marketing. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, 61–70.Google ScholarDigital Library
- [37] . 2015. Improving detection of influential nodes in complex networks. Physica, A. Statistical Mechanics and its Applications 436 (2015), 833–845.Google ScholarCross Ref
- [38] . 2009. Social influence analysis in large-scale networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.Association for Computing Machinery, 807–816.Google ScholarDigital Library
- [39] . 2015. Influence maximization in near-linear time: A martingale approach. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM, 1539–1554.Google ScholarDigital Library
- [40] . 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the International Conference on Management of Data, SIGMOD’15. ACM, 75–86.Google ScholarDigital Library
- [41] . 2019. Seeds selection for spreading in a weighted cascade model. Physica A-Statistical Mechanics and Its Applications 526 (2019), 120943.Google ScholarCross Ref
- [42] . 2015. Learning the influence probabilities based on multipolar factors in social network. In Proceedings of the 8th International Conference on Knowledge Science, Engineering and Management., , and (Eds.),
Lecture Notes in Computer Science , Vol. 9403. Springer, 512–524.Google ScholarDigital Library - [43] . 2016. Effective identification of multiple influential spreaders by DegreePunishment. Physica A Statistical Mechanics and Its Applications 461 (2016), 238–247.Google ScholarCross Ref
- [44] . 2021. Influence maximization in social graphs based on community structure and node coverage gain. Future Generation Computer Systems-the International Journal of Escience 118 (2021), 327–338.Google ScholarCross Ref
- [45] . 2002. A simple model of global cascades on random networks. Proceedings of the National Academy of Sciences of the United States of America 99, 9 (2002), 5766–5771.Google ScholarCross Ref
- [46] . 2015. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems 42, 1 (2015), 181–213.
DOI: Google ScholarDigital Library - [47] . 2019. Learning influence probabilities and modelling influence diffusion in Twitter. In Proceedings of the Companion of The 2019 World Wide Web Conference., , , , , , , and (Eds.), ACM, 1087–1094.Google ScholarDigital Library
- [48] . 2004. The rich-club phenomenon in the Internet topology. IEEE Communications Letters 8, 3 (2004), 180–182.Google ScholarCross Ref
- [49] . 2015. Tree-core and tree-coritivity of graphs. Information Processing Letters 115, 10 (2015), 754–759.Google ScholarDigital Library
Index Terms
- Triadic Closure Sensitive Influence Maximization
Recommendations
Continuous states latency aware influence maximization in social networks
Influence maximization is the problem of finding a small set of nodes that maximizes the aggregated influence in social networks. The problem of influence maximization in social networks has been explored in many previous researches. All the existing ...
Influence Maximization Problem for Unknown Social Networks
ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015We propose a novel problem called influence maximization for unknown graphs, and propose a heuristic algorithm for the problem. Influence maximization is the problem of detecting a set of influential nodes in a social network, which represents social ...
A most influential node group discovery method for influence maximization in social networks: A trust-based perspective
AbstractDeveloping a computational method for discovering the most influential nodes in social networks is a significant challenge that reveals an approach for maximizing the influence diffusion. To improve the influence degree evaluation ...
Comments