{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:30:51Z","timestamp":1777696251229,"version":"3.51.4"},"reference-count":45,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2022,9,5]]},"abstract":"<jats:p>Influence Maximization (IM), an NP-hard central issue for social network research, aims to recognize the influential nodes in a network so that the message can spread faster and more effectively. A large number of existing studies mainly focus on the heuristic methods, which generally lead to sub-optimal solutions and suffer time-consuming and inapplicability for large-scale networks. Furthermore, the present community-aware random walk to analyze IM using network representation learning considers only the node\u2019s influence or network community structures. No research has been found that surveyed both of them. Hence, the present study is designed to solve the IM problem by introducing a novel influence network embedding (NINE) approach and a novel influence maximization algorithm, namely NineIM, based on network representation learning. First, a mechanism that can capture the diffusion behavior proximity between network nodes is constructed. Second, we consider a more realistic social behavior assumption. The probability of information dissemination between network nodes (users) is different from other random walk based network representation learning. Third, the node influence is used to define the rules of random walk and then get the embedding representation of a social network. Experiments on four real-world networks indicate that our proposed NINE method outperforms four state-of-the-art network embedding baselines. Finally, the superiority of the proposed NineIM algorithm is reported by comparing four traditional IM algorithms. The code is available at https:\/\/github.com\/baiyazi\/NineIM.<\/jats:p>","DOI":"10.3233\/ida-216149","type":"journal-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T11:47:40Z","timestamp":1662464860000},"page":"1321-1340","source":"Crossref","is-referenced-by-count":6,"title":["Influence maximization based on network representation learning in social network"],"prefix":"10.1177","volume":"26","author":[{"given":"Zhibin","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoliang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, Sichuan, China"},{"name":"Department of Computer Science and Operations Research, University of Montreal, Montreal, QC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianyong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yajun","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Lan","sequence":"additional","affiliation":[{"name":"Institute of Statistical Science, SiChuan Provincial Bureau of Statistics, Chengdu, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-216149_ref1","doi-asserted-by":"crossref","first-page":"103690","DOI":"10.1016\/j.engappai.2020.103690","article-title":"Structural hole-based approach to control public opinion in a social network","volume":"93","author":"Gong","year":"2020","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.3233\/IDA-216149_ref2","doi-asserted-by":"crossref","unstructured":"P. Domingos and M. Richardson, Mining the network value of customers, in: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001, pp.\u00a057\u201366.","DOI":"10.1145\/502512.502525"},{"key":"10.3233\/IDA-216149_ref3","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg and \u00c9. Tardos, Maximizing the spread of influence through a social network, in: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp.\u00a0137\u2013146.","DOI":"10.1145\/956750.956769"},{"key":"10.3233\/IDA-216149_ref4","doi-asserted-by":"crossref","unstructured":"J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen and N. Glance, Cost-effective outbreak detection in networks, in: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007, pp.\u00a0420\u2013429.","DOI":"10.1145\/1281192.1281239"},{"key":"10.3233\/IDA-216149_ref5","doi-asserted-by":"crossref","unstructured":"A. Goyal, W. Lu and L.V. Lakshmanan, Celf+\u2063+: optimizing the greedy algorithm for influence maximization in social networks, in: Proceedings of the 20th International Conference Companion on World Wide Web, 2011, pp.\u00a047\u201348.","DOI":"10.1145\/1963192.1963217"},{"key":"10.3233\/IDA-216149_ref6","doi-asserted-by":"crossref","unstructured":"S. Cheng, H. Shen, J. Huang, G. Zhang and X. Cheng, Staticgreedy: solving the scalability-accuracy dilemma in influence maximization, in: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, 2013, pp.\u00a0509\u2013518.","DOI":"10.1145\/2505515.2505541"},{"issue":"10","key":"10.3233\/IDA-216149_ref7","first-page":"2181","article-title":"Threshold-based heuristic algorithm for influence maximization","volume":"49","author":"Hao","year":"2012","journal-title":"Journal of Computer Research and Development"},{"key":"10.3233\/IDA-216149_ref8","doi-asserted-by":"crossref","unstructured":"T. Cao, X. Wu, S. Wang and X. Hu, OASNET: an optimal allocation approach to influence maximization in modular social networks, in: Proceedings of the 2010 ACM Symposium on Applied Computing, 2010, pp.\u00a01088\u20131094.","DOI":"10.1145\/1774088.1774314"},{"key":"10.3233\/IDA-216149_ref9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.eswa.2018.05.001","article-title":"Influence maximization in social networks based on TOPSIS","volume":"108","author":"Zareie","year":"2018","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-216149_ref10","doi-asserted-by":"crossref","first-page":"112905","DOI":"10.1016\/j.eswa.2019.112905","article-title":"Influence maximization across heterogeneous interconnected networks based on deep learning","volume":"140","author":"Keikha","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IDA-216149_ref11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.knosys.2018.02.028","article-title":"Community aware random walk for network embedding","volume":"148","author":"Keikha","year":"2018","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-216149_ref12","doi-asserted-by":"crossref","first-page":"151252","DOI":"10.1109\/ACCESS.2019.2946391","article-title":"Social Influence Maximization for Public Health Campaigns","volume":"7","author":"Zhan","year":"2019","journal-title":"IEEE Access"},{"key":"10.3233\/IDA-216149_ref13","doi-asserted-by":"crossref","unstructured":"D. Wang, P. Cui and W. Zhu, Structural deep network embedding, in: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016, pp.\u00a01225\u20131234.","DOI":"10.1145\/2939672.2939753"},{"issue":"12","key":"10.3233\/IDA-216149_ref14","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1109\/TKDE.2018.2819980","article-title":"Attributed social network embedding","volume":"30","author":"Liao","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-216149_ref15","doi-asserted-by":"crossref","unstructured":"M. Richardson and P. Domingos, Mining knowledge-sharing sites for viral marketing, in: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002, pp.\u00a061\u201370.","DOI":"10.1145\/775047.775057"},{"key":"10.3233\/IDA-216149_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"10.3233\/IDA-216149_ref17","doi-asserted-by":"crossref","unstructured":"Z.A. Rachman, W. Maharani et al., The analysis and implementation of degree centrality in weighted graph in Social Network Analysis, in: 2013 International Conference of Information and Communication Technology (ICoICT), IEEE, 2013, pp.\u00a072\u201376.","DOI":"10.1109\/ICoICT.2013.6574552"},{"issue":"6","key":"10.3233\/IDA-216149_ref19","doi-asserted-by":"crossref","first-page":"102063","DOI":"10.1016\/j.ipm.2019.102063","article-title":"A multi-centrality index for graph-based keyword extraction","volume":"56","author":"Vega-Oliveros","year":"2019","journal-title":"Information Processing & Management"},{"key":"10.3233\/IDA-216149_ref20","doi-asserted-by":"crossref","unstructured":"M. Kimura and K. Saito, Tractable models for information diffusion in social networks, in: European Conference on Principles of Data Mining and Knowledge Discovery, Springer, 2006, pp.\u00a0259\u2013271.","DOI":"10.1007\/11871637_27"},{"issue":"6","key":"10.3233\/IDA-216149_ref22","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","article-title":"INCIM: A community-based algorithm for influence maximization problem under the linear threshold model","volume":"52","author":"Bozorgi","year":"2016","journal-title":"Information Processing & Management"},{"issue":"03","key":"10.3233\/IDA-216149_ref23","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1142\/S0218488518500198","article-title":"FSIM: A fast and scalable influence maximization algorithm based on community detection","volume":"26","author":"Bagheri","year":"2018","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"10.3233\/IDA-216149_ref24","doi-asserted-by":"crossref","first-page":"106944","DOI":"10.1016\/j.knosys.2021.106944","article-title":"Multi-Community Influence Maximization in Device-to-Device social networks","volume":"221","author":"Wang","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-216149_ref25","doi-asserted-by":"crossref","first-page":"106942","DOI":"10.1016\/j.knosys.2021.106942","article-title":"Efficient parallel computing on the game theory-aware robust influence maximization problem","volume":"220","author":"Gong","year":"2021","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-216149_ref26","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.procs.2020.03.045","article-title":"A modified degree discount heuristic for influence maximization in social networks","volume":"170","author":"Aldawish","year":"2020","journal-title":"Procedia Computer Science"},{"key":"10.3233\/IDA-216149_ref27","doi-asserted-by":"crossref","first-page":"114168","DOI":"10.1016\/j.eswa.2020.114168","article-title":"An efficient path-based approach for influence maximization in social networks","volume":"167","author":"Kianian","year":"2021","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.3233\/IDA-216149_ref28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41019-020-00117-1","article-title":"Deep reinforcement learning-based approach to tackle topic-aware influence maximization","volume":"5","author":"Tian","year":"2020","journal-title":"Data Science and Engineering"},{"issue":"7","key":"10.3233\/IDA-216149_ref29","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1109\/TKDE.2013.168","article-title":"Personalized recommendation combining user interest and social circle","volume":"26","author":"Qian","year":"2013","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-216149_ref30","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.inffus.2020.05.009","article-title":"The four dimensions of social network analysis: An overview of research methods, applications, and software tools","volume":"63","author":"Camacho","year":"2020","journal-title":"Information Fusion"},{"issue":"10","key":"10.3233\/IDA-216149_ref31","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/p10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"5","key":"10.3233\/IDA-216149_ref32","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","article-title":"A survey on network embedding","volume":"31","author":"Cui","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"9","key":"10.3233\/IDA-216149_ref33","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","article-title":"A comprehensive survey of graph embedding: Problems, techniques, and applications","volume":"30","author":"Cai","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/IDA-216149_ref34","doi-asserted-by":"crossref","unstructured":"B. Perozzi, R. Al-Rfou and S. Skiena, Deepwalk: Online learning of social representations, in: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014, pp.\u00a0701\u2013710.","DOI":"10.1145\/2623330.2623732"},{"key":"10.3233\/IDA-216149_ref35","doi-asserted-by":"crossref","unstructured":"J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan and Q. Mei, Line: Large-scale information network embedding, in: Proceedings of the 24th International Conference on World Wide Web, 2015, pp.\u00a01067\u20131077.","DOI":"10.1145\/2736277.2741093"},{"key":"10.3233\/IDA-216149_ref36","doi-asserted-by":"crossref","unstructured":"A. Grover and J. Leskovec, node2vec: Scalable feature learning for networks, in: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2016, pp.\u00a0855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"10.3233\/IDA-216149_ref38","doi-asserted-by":"crossref","first-page":"105418","DOI":"10.1016\/j.knosys.2019.105418","article-title":"Community-oriented attributed network embedding","volume":"193","author":"Gao","year":"2020","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/IDA-216149_ref39","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.patcog.2018.12.004","article-title":"Diffusion network embedding","volume":"88","author":"Shi","year":"2019","journal-title":"Pattern Recognition"},{"key":"10.3233\/IDA-216149_ref40","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.future.2019.05.033","article-title":"Degree-biased random walk for large-scale network embedding","volume":"100","author":"Zhang","year":"2019","journal-title":"Future Generation Computer Systems"},{"key":"10.3233\/IDA-216149_ref41","doi-asserted-by":"crossref","unstructured":"S. Cao, W. Lu and Q. Xu, Grarep: Learning graph representations with global structural information, in: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, 2015, pp.\u00a0891\u2013900.","DOI":"10.1145\/2806416.2806512"},{"issue":"9","key":"10.3233\/IDA-216149_ref42","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1016\/j.clinph.2018.02.135","article-title":"Betweenness centrality of intracranial electroencephalography networks and surgical epilepsy outcome","volume":"129","author":"Grobelny","year":"2018","journal-title":"Clinical Neurophysiology"},{"issue":"3","key":"10.3233\/IDA-216149_ref43","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1137\/140976649","article-title":"PageRank beyond the Web","volume":"57","author":"Gleich","year":"2015","journal-title":"Siam REVIEW"},{"issue":"1","key":"10.3233\/IDA-216149_ref44","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","article-title":"Defining and evaluating network communities based on ground-truth","volume":"42","author":"Yang","year":"2015","journal-title":"Knowledge and Information Systems"},{"issue":"12","key":"10.3233\/IDA-216149_ref45","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3","key":"10.3233\/IDA-216149_ref46","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman","year":"2006","journal-title":"Physical Review E"},{"issue":"1","key":"10.3233\/IDA-216149_ref47","doi-asserted-by":"crossref","first-page":"2-es","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: Densification and shrinking diameters","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Transactions on Knowledge Discovery from Data (TKDD)"},{"issue":"9","key":"10.3233\/IDA-216149_ref48","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.3390\/math8091554","article-title":"A Node Embedding-Based Influential Spreaders Identification Approach","volume":"8","author":"Chen","year":"2020","journal-title":"Mathematics"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-216149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:19:39Z","timestamp":1777454379000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-216149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,5]]},"references-count":45,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/ida-216149","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,5]]}}}