{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T09:47:49Z","timestamp":1746784069593,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T00:00:00Z","timestamp":1709164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T00:00:00Z","timestamp":1709164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62302043"],"award-info":[{"award-number":["62302043"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s11280-024-01257-4","type":"journal-article","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T07:02:15Z","timestamp":1709190135000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficiently estimating node influence through group sampling over large graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Lingling","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Zhiping","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Zhiwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"1257_CR1","doi-asserted-by":"crossref","unstructured":"Abidi, A.,\u00a0Zhou, R.,\u00a0Chen, L.,\u00a0Liu, C.: Pivot-based maximal biclique enumeration. In: IJCAI, pp. 3558\u20133564 (2020)","DOI":"10.24963\/ijcai.2020\/492"},{"key":"1257_CR2","doi-asserted-by":"crossref","unstructured":"Alspector, J.,\u00a0Kolcz, A.,\u00a0Karunanithi, N.: Comparing feature-based and clique-based user models for movie selection. In: Proceedings of the third ACM Conference on Digital Libraries, pp. 11\u201318. ACM (1998)","DOI":"10.1145\/276675.276677"},{"key":"1257_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"issue":"9","key":"1257_CR4","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1109\/JSAC.2011.111012","volume":"29","author":"M Gjoka","year":"2011","unstructured":"Gjoka, M., Butts, C.T., Kurant, M., Markopoulou, A.: Multigraph sampling of online social networks. Sel. Areas Commun. 29(9), 1893\u20131905 (2011)","journal-title":"Sel. Areas Commun."},{"key":"1257_CR5","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in facebook: A case study of unbiased sampling of OSNs. In: INFOCOM, pp. 1\u20139. IEEE (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"1257_CR6","doi-asserted-by":"crossref","unstructured":"Gjoka, M.,\u00a0Smith, E.,\u00a0Butts, C.: Estimating clique composition and size distributions from sampled network data. In: INFOCOM WKSHPS, pp. 837\u2013842. IEEE (2014)","DOI":"10.1109\/INFCOMW.2014.6849339"},{"key":"1257_CR7","doi-asserted-by":"crossref","unstructured":"Guo, Q.,\u00a0Wang, S.,\u00a0Wei, Z.,\u00a0Chen, M.: Influence maximization revisited: Efficient reverse reachable set generation with bound tightened. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 2167\u20132181 (2020)","DOI":"10.1145\/3318464.3389740"},{"issue":"3","key":"1257_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.3934\/mfc.2018010","volume":"1","author":"M Han","year":"2018","unstructured":"Han, M., Li, Y.: Influence analysis: A survey of the state-of-the-art. Math. Found. Comput. 1(3), 201\u2013253 (2018)","journal-title":"Math. Found. Comput."},{"key":"1257_CR9","doi-asserted-by":"crossref","unstructured":"Huang, K.,\u00a0Tang, J.,\u00a0Xiao, X.,\u00a0Sun, A.,\u00a0Lim, A.: Efficient approximation algorithms for adaptive target profit maximization. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 649\u2013660. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00062"},{"key":"1257_CR10","doi-asserted-by":"crossref","unstructured":"Lee, C.-H.,\u00a0Xu, X., Eun, D.Y.: Beyond random walk and metropolis-hastings samplers: Why you should not backtrack for unbiased graph sampling. In: SIGMETRICS, vol.\u00a040, pp. 319\u2013330. ACM (2012)","DOI":"10.1145\/2318857.2254795"},{"issue":"1","key":"1257_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Adamic, L.A., Huberman, B.A.: The dynamics of viral marketing. ACM Trans. Web (TWEB) 1(1), 5 (2007)","journal-title":"ACM Trans. Web (TWEB)"},{"key":"1257_CR12","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Yu, J.X.,\u00a0Qin, L.,\u00a0Mao, R.,\u00a0Jin, T.: On random walk based graph sampling. In: ICDE, pp. 927\u2013938. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"1257_CR13","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: A survey. Combinatorics, Paul Erdos is eighty, vol. 2(1), pp. 1\u201346 (1993)"},{"issue":"4","key":"1257_CR14","doi-asserted-by":"publisher","first-page":"560","DOI":"10.14778\/3436905.3436915","volume":"14","author":"S Mo","year":"2020","unstructured":"Mo, S., Bao, Z., Zhang, P., Peng, Z.: Towards an efficient weighted random walk domination. Proc VLDB Endow 14(4), 560\u2013572 (2020)","journal-title":"Proc VLDB Endow"},{"key":"1257_CR15","doi-asserted-by":"crossref","unstructured":"Ribeiro, B., Towsley, D.: Estimating and sampling graphs with multidimensional random walks. In: SIGCOMM, pp. 390\u2013403. ACM (2010)","DOI":"10.1145\/1879141.1879192"},{"key":"1257_CR16","doi-asserted-by":"crossref","unstructured":"Ribeiro, B.,\u00a0Wang, P.,\u00a0Murai, F.,\u00a0Towsley, D.: Sampling directed graphs with random walks. In: INFOCOM, pp. 1692\u20131700. IEEE (2012)","DOI":"10.1109\/INFCOM.2012.6195540"},{"issue":"6825","key":"1257_CR17","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1038\/35065725","volume":"410","author":"SH Strogatz","year":"2001","unstructured":"Strogatz, S.H.: Exploring complex networks. Nature 410(6825), 268\u2013276 (2001)","journal-title":"Nature"},{"issue":"2","key":"1257_CR18","first-page":"8","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang, P., et al.: Efficiently estimating motif statistics of large networks. ACM Trans. Knowl. Discov. Data (TKDD) 9(2), 8 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"1257_CR19","unstructured":"Wang, P.,\u00a0Ribeiro, B.,\u00a0Zhao, J.,\u00a0Lui, J.,\u00a0Towsley, D.,\u00a0Guan, X.: Practical characterization of large networks using neighborhood information. arXiv:1311.3037 (2013)"},{"key":"1257_CR20","doi-asserted-by":"crossref","unstructured":"Wasserman, S.,\u00a0Faust, K.: Social network analysis: Methods and applications, vol. 8. Cambridge University Press (1994)","DOI":"10.1017\/CBO9780511815478"},{"key":"1257_CR21","doi-asserted-by":"crossref","unstructured":"Xie, H.,\u00a0Yi, P.,\u00a0Li, Y., Lui, J.C.: Optimizing random walk based statistical estimation over graphs via bootstrapping. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3126906"},{"key":"1257_CR22","doi-asserted-by":"crossref","unstructured":"Xu, X., Lee, C.-H., et al.: Challenging the limits: Sampling online social networks with cost constraints. In: INFOCOM (2017)","DOI":"10.1109\/INFOCOM.2017.8057169"},{"issue":"1","key":"1257_CR23","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang, J., Leskovec, J.: Defining and evaluating network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181\u2013213 (2015)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"1257_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s13278-023-01078-9","volume":"13","author":"A Zareie","year":"2023","unstructured":"Zareie, A., Sakellariou, R.: Influence maximization in social networks: A survey of behaviour-aware methods. Soc. Netw. Anal. Min. 13(1), 78 (2023)","journal-title":"Soc. Netw. Anal. Min."},{"key":"1257_CR25","doi-asserted-by":"publisher","first-page":"105891","DOI":"10.1016\/j.knosys.2020.105891","volume":"198","author":"L Zhang","year":"2020","unstructured":"Zhang, L., Jiang, H., Wang, F., Feng, D.: Draws: A dual random-walk based sampling method to efficiently estimate distributions of degree and clique size over social networks. Knowl.-Based Syst. 198, 105891 (2020)","journal-title":"Knowl.-Based Syst."},{"issue":"7","key":"1257_CR26","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1007\/s10115-022-01691-8","volume":"64","author":"L Zhang","year":"2022","unstructured":"Zhang, L., Wang, F., Jiang, H., Feng, D., Xie, Y., Zhang, Z., Wang, G.: Random walk on node cliques for high-quality samples to estimate large graphs with high accuracies and low costs. Knowl. Inf. Syst. 64(7), 1909\u20131935 (2022)","journal-title":"Knowl. Inf. Syst."},{"key":"1257_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, L.,\u00a0Zhang, Z.,\u00a0Wang, G.,\u00a0Yuan, Y.: Efficiently sampling and estimating hypergraphs by hybrid random walk. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 1273\u20131285. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00102"},{"key":"1257_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, Y.,\u00a0Li, Y.,\u00a0Bao, Z.,\u00a0Zheng, B.,\u00a0Jagadish, H.: Minimizing the regret of an influence provider. In: Proceedings of the 2021 International Conference on Management of Data, pp. 2115\u20132127 (2021)","DOI":"10.1145\/3448016.3457257"},{"key":"1257_CR29","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.procs.2014.05.038","volume":"29","author":"C Zhou","year":"2014","unstructured":"Zhou, C., Zhang, P., Zang, W., Guo, L.: Maximizing the cumulative influence through a social network when repeat activation exists. Procedia Comput. Sci. 29, 422\u2013431 (2014)","journal-title":"Procedia Comput. Sci."},{"key":"1257_CR30","doi-asserted-by":"crossref","unstructured":"Zhu, Y.,\u00a0Tang, J.,\u00a0Tang, X.,\u00a0Wang, S.,\u00a0Lim, A.: 2-hop+ sampling: Efficient and effective influence estimation. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3093934"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01257-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-024-01257-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01257-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T14:13:10Z","timestamp":1711030390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-024-01257-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,29]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1257"],"URL":"https:\/\/doi.org\/10.1007\/s11280-024-01257-4","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2024,2,29]]},"assertion":[{"value":"9 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"18"}}