{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:04:37Z","timestamp":1760709877104,"version":"3.37.3"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T00:00:00Z","timestamp":1554940800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T00:00:00Z","timestamp":1554940800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["17K00314"],"award-info":[{"award-number":["17K00314"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s41060-019-00183-3","type":"journal-article","created":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T12:15:34Z","timestamp":1554984934000},"page":"175-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Resampling-based predictive simulation framework of stochastic diffusion model for identifying top-K influential nodes"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7399-2472","authenticated-orcid":false,"given":"Kouzou","family":"Ohara","sequence":"first","affiliation":[]},{"given":"Kazumi","family":"Saito","sequence":"additional","affiliation":[]},{"given":"Masahiro","family":"Kimura","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,11]]},"reference":[{"key":"183_CR1","doi-asserted-by":"crossref","unstructured":"Bakshy, E., Hofman, J.M., Mason, W.A., Watts, D.J.: Everyone\u2019s an influencer: quantifying influence on twitter. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining (WSDM\u201911), pp. 65\u201374 (2011)","DOI":"10.1145\/1935826.1935845"},{"key":"183_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"183_CR3","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the 25th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA\u201914), pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"183_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u00a02010), pp. 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"183_CR5","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 (KDD\u201909), pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"183_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the 10th IEEE International Conference on Data Mining (ICDM\u00a02010), pp. 88\u201397 (2010)","DOI":"10.1109\/ICDM.2010.118"},{"issue":"4","key":"183_CR7","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23(4), 493\u2013507 (1952)","journal-title":"Ann. Math. Stat."},{"key":"183_CR8","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"E Cohen","year":"1997","unstructured":"Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. J. Comput. Syst. Sci. 55, 441\u2013453 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"183_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, E.: All-distances sketches, revisited: hip estimators for massive graphs analysis. In: Proceedings of the 33rd ACM SIGMOD\u2013SIGACT\u2013SIGART Symposium on Principles of Database Systems, pp. 88\u201399 (2015)","DOI":"10.1145\/2594538.2594546"},{"key":"183_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: Scaling up with guarantees. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 629\u2013638 (2014)","DOI":"10.1145\/2661829.2662077"},{"key":"183_CR11","doi-asserted-by":"crossref","unstructured":"Cui, P., Wang, F., Yang, S., Sun, L.: Item-level social influence prediction with probabilistic hybrid factor matrix factorization. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 331\u2013336 (2011)","DOI":"10.1609\/aaai.v25i1.7915"},{"key":"183_CR12","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.: Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International World Wide Web Conference (WWW2011), pp. 47\u201348 (2011)","DOI":"10.1145\/1963192.1963217"},{"key":"183_CR13","doi-asserted-by":"crossref","unstructured":"Guille, A., Hacid, H.: A predictive model for the temporal dynamics of information diffusion in online social networks. In: Proceedings of the 21st International Conference Companion on World Wide Web (WWW\u201912), pp. 1145\u20131152 (2012)","DOI":"10.1145\/2187980.2188254"},{"issue":"301","key":"183_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"183_CR15","unstructured":"Jin, R., Liu, L., Aggarwal, C., Shen, Y.: Reliable clustering on uncertain graphs. In: Proceedings of the 2012 IEEE 12th International Conference on Data Mining (ICDM 2012), pp. 459\u2013468 (2012)"},{"key":"183_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-57045-7_6","volume-title":"Algorithmic Aspects of Cloud Computing","author":"Vasileios Kassiano","year":"2017","unstructured":"Kassiano, V., Gounaris, A., Papadopoulos, A.N., Tsichlas, K.: Mining uncertain graphs: an overview. In: Proceedings of the International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2016), pp. 87\u2013116 (2017)"},{"key":"183_CR17","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"183_CR18","doi-asserted-by":"publisher","DOI":"10.2200\/S00862ED1V01Y201807DTM048","volume-title":"On Uncertain Graphs","author":"A Khan","year":"2018","unstructured":"Khan, A., Ye, Y., L, C.: On Uncertain Graphs. Morgan & Claypool, San Rafael (2018)"},{"key":"183_CR19","first-page":"259","volume-title":"Lecture Notes in Computer Science","author":"Masahiro Kimura","year":"2006","unstructured":"Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD 2006), LNAI 4213, pp. 259\u2013271 (2006)"},{"key":"183_CR20","unstructured":"Kimura, M., Saito, K., Motoda, H.: Minimizing the spread of contamination by blocking links in a network. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08), pp. 1175\u20131180 (2008)"},{"key":"183_CR21","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1514888.1514892","volume":"3","author":"M Kimura","year":"2009","unstructured":"Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Discov. Data 3, 9:1\u20139:23 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"183_CR22","unstructured":"Kimura, M., Saito, K., Motoda, H.: Efficient estimation of influence functions fot sis model on social networks. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09) (2009)"},{"key":"183_CR23","unstructured":"Kimura, M., Saito, K., Nakano, R.: Extracting influential nodes for information diffusion on a social network. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07), pp. 1371\u20131376 (2007)"},{"key":"183_CR24","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/s10618-009-0150-5","volume":"20","author":"M Kimura","year":"2010","unstructured":"Kimura, M., Saito, K., Nakano, R., Motoda, H.: Extracting influential nodes on a social network for information diffusion. Data Min. Knowl. Disc. 20, 70\u201397 (2010)","journal-title":"Data Min. Knowl. Disc."},{"key":"183_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41060-015-0001-y","volume":"1","author":"M Kimura","year":"2016","unstructured":"Kimura, M., Saito, K., Ohara, K., Motoda, H.: Speeding-up node influence computation for huge social networks. Int. J. Data Sci. Anal. 1, 1\u201314 (2016)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"11","key":"183_CR26","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1400214.1400232","volume":"51","author":"J Kleinberg","year":"2008","unstructured":"Kleinberg, J.: The convergence of social and technological networks. Commun. ACM 51(11), 66\u201372 (2008)","journal-title":"Commun. ACM"},{"key":"183_CR27","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-30115-8_22","volume-title":"Machine Learning: ECML 2004","author":"Bryan Klimt","year":"2004","unstructured":"Klimt, B., Yang, Y.: The enron corpus: a new dataset for email classification research. In: Proceedings of the 2004 European Conference on Machine Learning (ECML\u201904), pp. 217\u2013226 (2004)"},{"key":"183_CR28","doi-asserted-by":"crossref","unstructured":"Lawrence, T., Hosein, P.: Stochastic dynamic programming heuristics for influence maximization-revenue optimization. Int. J. Data Sci. Anal. (first Online) (2018)","DOI":"10.1007\/s41060-018-0155-5"},{"key":"183_CR29","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2007), pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"issue":"1","key":"183_CR30","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s41060-017-0082-x","volume":"5","author":"G Loukides","year":"2018","unstructured":"Loukides, G., Gwadera, R.: Preventing the diffusion of information to vulnerable users while preserving pagerank. Int. J. Data Sci. Anal. 5(1), 19\u201339 (2018)","journal-title":"Int. J. Data Sci. Anal."},{"key":"183_CR31","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298, 824\u2013827 (2002)","journal-title":"Science"},{"key":"183_CR32","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"183_CR33","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-33486-3_33","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Huy Nguyen","year":"2012","unstructured":"Nguyen, H., Zheng, R.: Influence spread in large-scale social networks\u2014a belief propagation approach. In: Proceedings of the 2012 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2012), LNAI 7524, pp. 515\u2013530 (2012)"},{"key":"183_CR34","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Predictive simulation framework of stochastic diffusion model for identifying top-k influential nodes. In: Proceedings of the 5th Asian Conference on Machine Learning (ACML2013), PMLR, vol.\u00a029, pp. 149\u2013164 (2013)"},{"key":"183_CR35","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-11812-3_20","volume-title":"Discovery Science","author":"Kouzou Ohara","year":"2014","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Resampling-based framework for estimating node centrality of large social network. In: Proceedings of the 17th International Conference on Discovery Science (DS\u201914), LNAI 8777, pp. 228\u2013239 (2014)"},{"key":"183_CR36","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-18038-0_11","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Kouzou Ohara","year":"2015","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Resampling-based gap analysis for detecting nodes with high centrality on large social network. In: Proceedings of the Nineteenth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD2015), pp. 135\u2013147 (2015)"},{"key":"183_CR37","doi-asserted-by":"crossref","unstructured":"Ohara, K., Saito, K., Kimura, M., Motoda, H.: Critical node identification based on articulation point detection for network with uncertain connectivity. In: Proceedings of the Sixth International Symposium on Computing and Networking (CANDAR 2018), pp. 146\u2013152 (2018)","DOI":"10.1109\/CANDAR.2018.00027"},{"key":"183_CR38","doi-asserted-by":"publisher","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M Potamias","year":"2010","unstructured":"Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: K-nearest neighbors in uncertain graphs. Proc. VLDB Endow. 3, 997\u20131008 (2010)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"183_CR39","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s41060-017-0086-6","volume":"5","author":"G Rossetti","year":"2018","unstructured":"Rossetti, G., Milli, L., Salvator, R., Sirbu, A., Pedreschi, D., Giannotti, F.: Ndlib: a python library to model and analyze diffusion processes over complex networks. Int. J. Data Sci. Anal. 5(1), 61\u201379 (2018)","journal-title":"Int. J. Data Sci. Anal."},{"key":"183_CR40","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-04747-3_24","volume-title":"Discovery Science","author":"Kazumi Saito","year":"2009","unstructured":"Saito, K., Kimura, M., Motoda, H.: Discovering influential nodes for sis models in social networks. In: Proceedings of the Twelfth International Conference of Discovery Science (DS2009), LNAI 5808, pp. 302\u2013316. Springer, Berlin (2009)"},{"key":"183_CR41","first-page":"322","volume-title":"Lecture Notes in Computer Science","author":"Kazumi Saito","year":"2009","unstructured":"Saito, K., Kimura, M., Ohara, K., Motoda, H.: Learning continuous-time information diffusion model for social behavioral data analysis. In: Proceedings of the 1st Asian Conference on Machine Learning (ACML2009), LNAI 5828, pp. 322\u2013337 (2009)"},{"key":"183_CR42","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-15939-8_12","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Kazumi Saito","year":"2010","unstructured":"Saito, K., Kimura, M., Ohara, K., Motoda, H.: Selecting information diffusion models over social networks for behavioral analysis. In: Proceedings of the 2010 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2010), LNAI 6323, pp. 180\u2013195 (2010)"},{"key":"183_CR43","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-37210-0_39","volume-title":"Social Computing, Behavioral-Cultural Modeling and Prediction","author":"Kazumi Saito","year":"2013","unstructured":"Saito, K., Kimura, M., ohara, K., Motoda, H.: Which targets to contact first to maximize influence over social network. In: Proceedings of the 6th International Conference on Social Computing, Behavioral-Cultural Modeling and Prediction (SBP2013), LNCS 7812, pp. 359\u2013367 (2013)"},{"issue":"5","key":"183_CR44","first-page":"056,104","volume":"67","author":"A V\u00e1zquez","year":"2003","unstructured":"V\u00e1zquez, A.: Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations. Phys. Rev. 67(5), 056,104 (2003)","journal-title":"Phys. Rev."},{"key":"183_CR45","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1086\/518527","volume":"34","author":"DJ Watts","year":"2007","unstructured":"Watts, D.J., Dodds, P.S.: Influence, networks, and public opinion formation. J. Consum. Res. 34, 441\u2013458 (2007)","journal-title":"J. Consum. Res."},{"key":"183_CR46","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dyanamics of \u201csmall-world\u201d networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"183_CR47","doi-asserted-by":"crossref","unstructured":"Yang, J., Counts, S.: Predicting the speed, scale, and range of information diffusion in twitter. In: Proceedings of the Fourth International Conference on Weblogs and Social Media (ICWSM 2010) (2010)","DOI":"10.1609\/icwsm.v4i1.14039"},{"key":"183_CR48","doi-asserted-by":"crossref","unstructured":"Yang, J., Leskovec, J.: Modeling information diffusion in implicit networks. In: Proceedings of the 2010 IEEE International Conference on Data Mining (ICDM\u201910), pp. 599\u2013608 (2010)","DOI":"10.1109\/ICDM.2010.22"},{"key":"183_CR49","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-642-33486-3_35","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Yu Yang","year":"2012","unstructured":"Yang, Y., Chen, E., Liu, Q., Xiang, B., Xu, T., Shad, S.: On approximation of real-world influence spread. In: Proceedings of the 2012 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2012), LNAI 7524a, pp. 548\u2013564 (2012)"},{"key":"183_CR50","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou, C., Zhang, P., Zang, W., Guo, L.: On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Trans. Knowl. Data Eng. 27, 2770\u20132783 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-019-00183-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-019-00183-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-019-00183-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T16:40:21Z","timestamp":1694796021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-019-00183-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,11]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["183"],"URL":"https:\/\/doi.org\/10.1007\/s41060-019-00183-3","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2019,4,11]]},"assertion":[{"value":"28 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}