{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T06:39:38Z","timestamp":1768804778769,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T00:00:00Z","timestamp":1659052800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T00:00:00Z","timestamp":1659052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Nature Science Foundation of China","award":["61502281"],"award-info":[{"award-number":["61502281"]}]},{"name":"Nature Science Foundation of China","award":["71772107"],"award-info":[{"award-number":["71772107"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s13042-022-01605-8","type":"journal-article","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T12:41:48Z","timestamp":1659098508000},"page":"3425-3440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["RLIM: representation learning method for influence maximization in social networks"],"prefix":"10.1007","volume":"13","author":[{"given":"Chengai","family":"Sun","sequence":"first","affiliation":[]},{"given":"Xiuliang","family":"Duan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1209-0125","authenticated-orcid":false,"given":"Liqing","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Tengteng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,29]]},"reference":[{"issue":"1","key":"1605_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-020-00705-z","volume":"11","author":"L Vega","year":"2021","unstructured":"Vega L, Mendez-Vazquez A, L\u00f3pez-Cuevas A (2021) Probabilistic reasoning system for social influence analysis in online social networks. Soc Netw Anal Min 11(1):1\u201320","journal-title":"Soc Netw Anal Min"},{"issue":"2","key":"1605_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3434749","volume":"15","author":"Michele Coscia","year":"2021","unstructured":"Coscia Michele (2021) Noise corrected sampling of online social networks. ACM Trans Knowl Discov Data 15(2):1\u201321. https:\/\/doi.org\/10.1145\/3434749","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1605_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2019.03.028","volume":"803","author":"T Chen","year":"2020","unstructured":"Chen T, Liu B, Liu W, Fang Q, Yuan J, Wu W (2020) A random algorithm for profit maximization in online social networks. Theoret Comput Sci 803:36\u201347","journal-title":"Theoret Comput Sci"},{"key":"1605_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.ejor.2020.06.028","volume":"289","author":"E G\u00fcney","year":"2021","unstructured":"G\u00fcney E, Leitner M, Ruthmair M, Sinnl M (2021) Large-scale influence maximization via maximal covering location. Eur J Operat Res 289:144","journal-title":"Eur J Operat Res"},{"key":"1605_CR5","unstructured":"Chen SJ, Chen WK, Dai YH, Yuan JH, Zhang HS (2021) Efficient presolving methods for influence maximization problem in social networks. arXiv:2101.00393"},{"key":"1605_CR6","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1605_CR7","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin, C, Faloutsos, C, Glance NS (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, San Jose, California, USA, August 12\u201315, 2007. ACM","DOI":"10.1145\/1281192.1281239"},{"key":"1605_CR8","doi-asserted-by":"publisher","unstructured":"Goyal A, Lu W, Lakshmanan LVS (2011) CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web (WWW \u201911). Association for Computing Machinery, New York, NY, USA, pp 47\u201348. https:\/\/doi.org\/10.1145\/1963192.1963217","DOI":"10.1145\/1963192.1963217"},{"key":"1605_CR9","doi-asserted-by":"crossref","unstructured":"Galhotra S, Arora A, Roy S (2016) Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. In: Proceedings of the 2016 international conference on management of data, pp 743\u2013758","DOI":"10.1145\/2882903.2882929"},{"issue":"1","key":"1605_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/MNET.2016.1500104NM","volume":"31","author":"S Peng","year":"2017","unstructured":"Peng S, Wang G, Xie D (2017) Social influence analysis in social networking big data: opportunities and challenges. IEEE Network 31(1):11\u201317","journal-title":"IEEE Network"},{"issue":"3","key":"1605_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.3233\/FI-2014-994","volume":"130","author":"SK Pal","year":"2014","unstructured":"Pal SK, Kundu S, Murthy CA (2014) Centrality measures, upper bound, and influence maximization in large scale directed social networks. Fundamenta Informaticae 130(3):317\u2013342","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"1605_CR12","doi-asserted-by":"publisher","first-page":"2143","DOI":"10.1007\/s11277-017-4047-0","volume":"95","author":"F Wang","year":"2017","unstructured":"Wang F, Li J, Jiang W, Wang G (2017) Temporal topic-based multi-dimensional social influence evaluation in online social networks. Wirel Pers Commun 95(3):2143\u20132171","journal-title":"Wirel Pers Commun"},{"key":"1605_CR13","doi-asserted-by":"publisher","first-page":"22119","DOI":"10.1109\/ACCESS.2017.2764750","volume":"5","author":"X Deng","year":"2017","unstructured":"Deng X, Dou Y, Lv T, Nguyen QVH (2017) A novel centrality cascading based edge parameter evaluation method for robust influence maximization. IEEE Access 5:22119\u201322131","journal-title":"IEEE Access"},{"key":"1605_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85567-5_9","volume-title":"Prediction of information diffusion probabilities for independent cascade model","author":"K Saito","year":"2008","unstructured":"Saito K, Nakano R, Kimura M (2008) Prediction of information diffusion probabilities for independent cascade model. Springer, Berlin, Heidelberg"},{"key":"1605_CR15","doi-asserted-by":"crossref","unstructured":"Cao T, Wu X, Hu TX, Wang S (2011) Active learning of model parameters for influence maximization. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, Berlin, Heidelberg, pp 280\u2013295","DOI":"10.1007\/978-3-642-23780-5_28"},{"issue":"1","key":"1605_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A Goyal","year":"2011","unstructured":"Goyal A, Bonchi F, Lakshmanan L (2011) A data-based approach to social influence maximization. Proc VLDB Endow 5(1):73\u201384","journal-title":"Proc VLDB Endow"},{"key":"1605_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2021.102507","volume":"67","author":"O \u00d6zdenizci","year":"2021","unstructured":"\u00d6zdenizci O, Eldeeb S, Demir A, Erdo\u011fmu\u015f D, Ak\u00e7akaya M (2021) EEG-based texture roughness classification in active tactile exploration with invariant representation learning networks. Biomed Signal Process Control 67:102507","journal-title":"Biomed Signal Process Control"},{"key":"1605_CR18","unstructured":"Sriram A, Muckley M, Sinha K, Shamout F, Pineau J, Geras KJ, Azour L, Aphinyanaphongs Y, Yakubova N, Moore W (2021) Covid-19 prognosis via self-supervised representation learning and multi-image prediction. arXiv:2101.04909"},{"key":"1605_CR19","doi-asserted-by":"crossref","unstructured":"Mandal RK, Anand N, Sahu N, Kale P (2020) PV system fault classification using SVM accelerated by dimension reduction using PCA. In: 2020 IEEE 9th power india international conference (PIICON). IEEE, pp 1\u20136","DOI":"10.1109\/PIICON49524.2020.9112896"},{"key":"1605_CR20","doi-asserted-by":"crossref","unstructured":"Oral C, Sezgin H (2013) Effects of dimension reduction in mammograms classification. In: International conference on electrical & electronics engineering. IEEE, pp 630\u2013633","DOI":"10.1109\/ELECO.2013.6713912"},{"issue":"2","key":"1605_CR21","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TPAMI.2019.2937292","volume":"43","author":"J Wang","year":"2019","unstructured":"Wang J, Cherian A (2019) Discriminative video representation learning using support vector classifiers. IEEE Trans Pattern Anal Mach Intell 43(2):420\u2013433","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1605_CR22","unstructured":"Goyal P, Benner P (2021) LQResNet: a deep neural network architecture for learning dynamic processes. arXiv:2103.02249"},{"issue":"15","key":"1605_CR23","doi-asserted-by":"publisher","first-page":"9403","DOI":"10.1007\/s00521-021-05702-7","volume":"33","author":"D Urda","year":"2021","unstructured":"Urda D, Veredas FJ, Gonz\u00e1lez-Enrique J, Ruiz-Aguilar JJ, Jerez JM, Turias IJ (2021) Deep neural networks architecture driven by problem-specific information. Neural Comput Appl 33(15):9403\u20139423","journal-title":"Neural Comput Appl"},{"key":"1605_CR24","doi-asserted-by":"crossref","unstructured":"Picone RA, Webb D, Obierefu F, Lentz J (2021). New methods for metastimuli: architecture, embeddings, and neural network optimization. In: International conference on human-computer interaction. Springer, Cham, pp 288\u2013304","DOI":"10.1007\/978-3-030-78114-9_21"},{"key":"1605_CR25","unstructured":"Adineh M, Nouri M (2019) High quality degree based heuristics for the influence maximization problem. arxiv:1904.12164"},{"key":"1605_CR26","volume-title":"Information diffusion in online social networks","author":"A Guille","year":"2013","unstructured":"Guille A, Hacid H, Favre C, Zighed DA (2013) Information diffusion in online social networks. Indiana University, Bloomington"},{"key":"1605_CR27","doi-asserted-by":"crossref","unstructured":"Saito K, Kimura M, Ohara K, Motoda H (2010) Selecting information diffusion models over social networks for behavioral analysis. In: Joint european conference on machine learning and knowledge discovery in databases. Springer, Berlin, Heidelberg, pp 180\u2013195","DOI":"10.1007\/978-3-642-15939-8_12"},{"key":"1605_CR28","doi-asserted-by":"crossref","unstructured":"Bourigault S, Lamprier S, Gallinari P (2016) Representation learning for information diffusion through social networks: an embedded cascade model. In: Proceedings of the ninth ACM international conference on web search and data mining. Association for Computing Machinery, New York, NY, USA","DOI":"10.1145\/2835776.2835817"},{"key":"1605_CR29","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., & Xiao, X. (2015, May). Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"issue":"01","key":"1605_CR30","doi-asserted-by":"publisher","first-page":"60","DOI":"10.36548\/jismac.2021.1.006","volume":"3","author":"D Sivaganesan","year":"2021","unstructured":"Sivaganesan D (2021) Novel influence maximization algorithm for social network behavior management. J ISMAC 3(01):60\u201368","journal-title":"J ISMAC"},{"key":"1605_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106942","volume":"220","author":"Y Gong","year":"2021","unstructured":"Gong Y, Liu S, Bai Y (2021) Efficient parallel computing on the game theory-aware robust influence maximization problem. Knowl-Based Syst 220:106942","journal-title":"Knowl-Based Syst"},{"issue":"8","key":"1605_CR32","doi-asserted-by":"publisher","first-page":"8721","DOI":"10.1007\/s10489-021-02818-0","volume":"52","author":"X Duan","year":"2022","unstructured":"Duan X, Qiu L, Sun C, Shi Q (2022) Multi-hop analysis method for rich-club phenomenon of influence maximization in social networks. Appl Intell 52(8):8721\u20138734","journal-title":"Appl Intell"},{"key":"1605_CR33","doi-asserted-by":"crossref","unstructured":"Wang W, Yin H, Du X, Hua W, Li Y, Nguyen QVH (2019) Online user representation learning across heterogeneous social networks. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp 545\u2013554","DOI":"10.1145\/3331184.3331258"},{"key":"1605_CR34","doi-asserted-by":"crossref","unstructured":"Yin H, Wang Q, Zheng K, Li Z, Yang J, Zhou X (2019) Social influence-based group representation learning for group recommendation. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE). IEEE, pp 566\u2013577","DOI":"10.1109\/ICDE.2019.00057"},{"issue":"7","key":"1605_CR35","doi-asserted-by":"publisher","first-page":"5935","DOI":"10.1109\/TCYB.2021.3064092","volume":"52","author":"J Chen","year":"2021","unstructured":"Chen J, Zhong M, Li J, Wang D, Tu H (2021) Effective deep attributed network representation learning with topology adapted smoothing. IEEE Trans Cybern 52(7):5935\u20135946","journal-title":"IEEE Trans Cybern"},{"key":"1605_CR36","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"1605_CR37","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. arXiv:1301.3781"},{"key":"1605_CR38","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. The 22nd ACM SIGKDD International Conference","DOI":"10.1145\/2939672.2939754"},{"key":"1605_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpr.2020.11.766","author":"SH Kumhar","year":"2021","unstructured":"Kumhar SH, Kirmani MM, Sheetlani J, Hassan M (2021) Word embedding generation for urdu language using word2vec model. Mater Today Proc. https:\/\/doi.org\/10.1016\/j.matpr.2020.11.766","journal-title":"Mater Today Proc"},{"key":"1605_CR40","unstructured":"Jian T, Meng Q, Wang M, Ming Z, Mei Q (2015) LINE: large-scale information network embedding. International World Wide Web Conferences Steering Committee"},{"key":"1605_CR41","doi-asserted-by":"crossref","unstructured":"Feng S, Cong G, Khan A, Li X, Chee YM (2018) Inf2vec: latent representation model for social influence embedding. 2018 IEEE 34th International Conference on Data Engineering (ICDE). IEEE","DOI":"10.1109\/ICDE.2018.00089"},{"key":"1605_CR42","unstructured":"Panagopoulos  G, Vazirgiannis M, Fragkiskos DM (2019) Influence maximization via representation learning. arXiv:1904.08804"},{"key":"1605_CR43","unstructured":"http:\/\/www.datatang.com\/data\/13785.html. Accessed 20 Feb 2021"},{"key":"1605_CR44","unstructured":"https:\/\/www.isi.edu\/~lerman\/downloads\/digg2009.html. Accessed 15 Dec 2020"},{"key":"1605_CR45","unstructured":"https:\/\/www.aminer.cn\/influencelocality. Accessed 5 Jan 2021"},{"key":"1605_CR46","unstructured":"https:\/\/www.microsoft.com\/en-us\/research\/project\/microsoft-academic-graph\/. Accessed 12 Mar 2021"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-022-01605-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-022-01605-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-022-01605-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T09:04:20Z","timestamp":1664010260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-022-01605-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,29]]},"references-count":46,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1605"],"URL":"https:\/\/doi.org\/10.1007\/s13042-022-01605-8","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,29]]},"assertion":[{"value":"29 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}