{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T12:21:36Z","timestamp":1782822096206,"version":"3.54.5"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["New Gener. Comput."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s00354-014-0402-9","type":"journal-article","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T11:44:53Z","timestamp":1409053493000},"page":"213-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":47,"title":["Seed Selection for Spread of Influence in Social Networks: Temporal vs. Static Approach"],"prefix":"10.1007","volume":"32","author":[{"given":"Rados\u0142aw","family":"Michalski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomasz","family":"Kajdanowicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Br\u00f3dka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Przemys\u0142aw","family":"Kazienko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,27]]},"reference":[{"key":"402_CR1","doi-asserted-by":"crossref","unstructured":"Bergmann, B. and Gerhard H., \u201cImprovements of general multiple test procedures for redundant systems of hypotheses,\u201d Multiple Hypothesenprfung\/Multiple Hypotheses Testing, Springer Berlin Heidelberg, pp. 100\u2013115, 1988.","DOI":"10.1007\/978-3-642-52307-6_8"},{"key":"402_CR2","doi-asserted-by":"crossref","unstructured":"Chen, W. and Yuan, Y. and Zhang, L., \u201cScalable influence maximization in social networks under the linear threshold model,\u201d in Proc. of 2010 IEEE 10th International Conference on Data Mining, IEEE Computer Society, pp. 88\u201397, 2010.","DOI":"10.1109\/ICDM.2010.118"},{"key":"402_CR3","doi-asserted-by":"crossref","unstructured":"Choudhury, M. and Sundaram, H. and John, A. and Seligmann, D.D., \u201cSocial Synchrony: Predicting Mimicry of User Actions in Online Social Media,\u201d in Proc. Int. Conf. on Computational Science and Engineering, pp. 151\u2013158, 2009.","DOI":"10.1109\/CSE.2009.439"},{"issue":"3","key":"402_CR4","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1093\/biomet\/60.3.581","volume":"60","author":"P. Cliffor","year":"1973","unstructured":"Cliffor P., Sudbury A.: \u201cA model for spatial conflict,\u201d. Biometrika 60(3), 581\u2013588 (1973)","journal-title":"Biometrika"},{"key":"402_CR5","unstructured":"Csardi, G. and Nepusz, T., \u201cThe igraph software package for complex network research,\u201d InterJournal, vol. Complex Systems, 2006."},{"key":"402_CR6","doi-asserted-by":"crossref","unstructured":"Even-Dar, E. and Shapira, A., \u201cA note on maximizing the spread of influence in social networks,\u201d Network (Deng, X. and Graham, F. eds.), 111, 4, ch. 27, pp. 281\u2013286, 2007.","DOI":"10.1007\/978-3-540-77105-0_27"},{"issue":"1","key":"402_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman L.C.: \u201cSet of Measures of Centrality Based on Betweenness,\u201d. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"issue":"200","key":"402_CR8","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M. Friedman","year":"1937","unstructured":"Friedman M.: \u201cThe use of ranks to avoid the assumption of normality implicit in the analysis of variance,\u201d. Journal of the American Statistical Association 32(200), 675\u2013701 (1937)","journal-title":"Journal of the American Statistical Association"},{"issue":"3","key":"402_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J. Goldenberg","year":"2001","unstructured":"Goldenberg J., Libai B., Muller E.: \u201cTalk of the network: A complex systems look at the underlying process of word-of-mouth,\u201d. Marketing letters 12(3), 211\u2013223 (2001)","journal-title":"Marketing letters"},{"key":"402_CR10","unstructured":"Gomez-Rodriguez, M. and Leskovec, J. and Krause, A., \u201cInferring Networks of Diffusion and Influence,\u201d in Proc. of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining KDD 10, 5, 4, IEEE Computer Society, pp. 1019\u20131028, 2010."},{"issue":"1","key":"402_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.14778\/2047485.2047492","volume":"5","author":"A. Goyal","year":"2011","unstructured":"Goyal A., Bonchi F., Lakshmanan L.V.S.: \u201cA data-based approach to social influence maximization,\u201d. In Proc. of the VLDB Endowment 5(1), 73\u201384 (2011)","journal-title":"In Proc. of the VLDB Endowment"},{"issue":"2","key":"402_CR12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s13278-012-0062-z","volume":"3","author":"A. Goyal","year":"2013","unstructured":"Goyal A., Bonchi F., Lakshmanan L.V.S., Venkatasubramanian S.: \u201cOn minimizing budget and time in influence propagation over social networks,\u201d. Social Network Analysis and Mining 3(2), 179\u2013192 (2013)","journal-title":"Social Network Analysis and Mining"},{"key":"402_CR13","doi-asserted-by":"crossref","unstructured":"Goyal, A. and Lu, W. and Lakshmanan, L.V.S. \u201cSIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model,\u201d in Proc. of 11th IEEE International Conference on Data Mining, IEEE Computer Society, pp. 211\u2013220, 2011.","DOI":"10.1109\/ICDM.2011.132"},{"issue":"6","key":"402_CR14","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M. Granovetter","year":"1978","unstructured":"Granovetter M.: \u201cThreshold Models of Collective Behavior,\u201d. American Journal of Sociology 83(6), 1420\u20131443 (1978)","journal-title":"American Journal of Sociology"},{"key":"402_CR15","unstructured":"Holm, S., \u201cA simple sequentially rejective multiple test procedure,\u201d Scandinavian journal of statistics, pp. 65\u201370, 1969."},{"key":"402_CR16","doi-asserted-by":"crossref","unstructured":"Holme, P. and Saram\u00e4ki, J., \u201cTemporal networks,\u201d Physics reports (Deng, X. and Graham, F. eds.), 519, 3, pp. 97\u2013125, 2012.","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"402_CR17","unstructured":"Jankowski, J. and Michalski, R. and Kazienko, P., \u201cCompensatory Seeding in Networks with Varying Availability of Nodes,\u201d in Proc. of 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining ASONAM 2013, pp. 1242\u20131249, 2013."},{"key":"402_CR18","doi-asserted-by":"crossref","first-page":"3476","DOI":"10.1016\/j.physa.2013.03.050","volume":"392","author":"F. Karimi","year":"2013","unstructured":"Karimi F., Holme P.: \u201cThreshold model of cascades in empirical temporal networks,\u201d. Physica A: Statistical Mechanics and its Applications 392, 3476\u20133483 (2013)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"402_CR19","unstructured":"Karsai, M. and Kivel\u00e4, M. and Pan, R.K. and Kaski, K. and Kert\u00e9sz, J. and Barab\u00e1si, A-L. and Saram\u00e4ki, J., \u201cSmall but slow world: How network topology and burstiness slow down spreading,\u201d Physical Review E, 83, 2, 2011."},{"key":"402_CR20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.neucom.2011.04.047","volume":"75","author":"P. Kazienko","year":"2012","unstructured":"Kazienko P., Kajdanowicz T.: \u201cLabel-dependent node classification in the network,\u201d. Neurocomputing 75, 199\u2013209 (2012)","journal-title":"Neurocomputing"},{"key":"402_CR21","doi-asserted-by":"crossref","unstructured":"Kempe, D. and Kleinberg, J. and Tardos, E., \u201cMaximizing the spread of influence through a social network,\u201d in Proc. of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 2003, ACM Press, pp. 137\u2013146, 2003.","DOI":"10.1145\/956755.956769"},{"key":"402_CR22","doi-asserted-by":"crossref","unstructured":"Klimt, B. and Yang, Y., \u201cThe enron corpus: A new dataset for email classification research,\u201d in Proc. of ECML 2004 - European Conference on Machine learning, Springer, pp. 217\u2013226, 2004.","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"402_CR23","doi-asserted-by":"crossref","unstructured":"Kossinets, G. and Watts, D.J., \u201cEmpirical analysis of an evolving social network,\u201d Science (Deng, X. and Graham, F. eds.), 311, 5757, pp. 88\u201390, 2006.","DOI":"10.1126\/science.1116869"},{"key":"402_CR24","doi-asserted-by":"crossref","unstructured":"Kr\u00f3l, D., \u201cOn Modelling Social Propagation Phenomenon,\u201d LNCS, 8398, Springer Verlag, pp. 227\u2013236, 2014.","DOI":"10.1007\/978-3-319-05458-2_24"},{"issue":"7","key":"402_CR25","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D. Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D., Kleinberg J.: \u201cThe link prediction problem for social networks,\u201d. Journal of the American society for information science and technology 58(7), 1019\u20131031 (2007)","journal-title":"Journal of the American society for information science and technology"},{"key":"402_CR26","doi-asserted-by":"crossref","unstructured":"Masuda, N. and Holme, P., \u201cPredicting and controlling infectious disease epidemics using temporal networks,\u201d F1000prime reports, 5, 2013.","DOI":"10.12703\/P5-6"},{"key":"402_CR27","doi-asserted-by":"crossref","unstructured":"Mathioudakis, M. and Bonchi, F. and Castillo, C. and Gionis, A. and Ukkonen, A., \u201cSparsification of influence networks,\u201d in Proc. of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM Press, pp. 529\u2013537, 2011.","DOI":"10.1145\/2020408.2020492"},{"key":"402_CR28","doi-asserted-by":"crossref","unstructured":"Michalski, R. and Br\u00f3dka, P. and Kazienko, P. and Juszczyszyn, K., \u201cQuantifying social network dynamics,\u201d in Proc. of the 4th Conference on Computational Aspects of Social Networks (CASoN), IEEE Computer Society, pp. 69\u201374, 2012.","DOI":"10.1109\/CASoN.2012.6412380"},{"key":"402_CR29","doi-asserted-by":"crossref","unstructured":"Michalski, R. and Kazienko, P. and Jankowski, J., \u201cConvince a Dozen More and Succeed\u2013The Influence in Multi-layered Social Networks,\u201d in Proc. of the International Conference on Signal-Image Technology & Internet-Based Systems (SITIS 2013), IEEE Computer Society, pp. 499\u2013505, 2013.","DOI":"10.1109\/SITIS.2013.85"},{"key":"402_CR30","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-642-21863-7_17","volume":"87","author":"R. Michalski","year":"2011","unstructured":"Michalski R., Palus S., Kazienko P.: \u201cMatching Organizational Structure and Social Network Extracted from Email Communication,\u201d. Lecture Notes in Business Information Processing 87, 197\u2013206 (2011)","journal-title":"Lecture Notes in Business Information Processing"},{"key":"402_CR31","doi-asserted-by":"crossref","unstructured":"Moon, J.W. and Moser, L., \u201cOn cliques in graphs,\u201d Israel journal of Mathematics, pp. 23\u201328, 1965.","DOI":"10.1007\/BF02760024"},{"key":"402_CR32","unstructured":"Nemenyi, P., \u201cDistribution-free multiple comparisons,\u201d Dissemination at Princeton University, 1963."},{"issue":"2","key":"402_CR33","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T. Opsahl","year":"2009","unstructured":"Opsahl T., Panzarasa P.: \u201cClustering in Weighted Networks,\u201d. Social Networks 31(2), 155\u2013163 (2009)","journal-title":"Social Networks"},{"key":"402_CR34","doi-asserted-by":"crossref","unstructured":"Palla, G, and Barabsi, A-L. and Vicsek, T., \u201cQuantifying social group evolution,\u201d Nature, 2007.","DOI":"10.1038\/nature05670"},{"key":"402_CR35","unstructured":"Prell, C., Social network analysis: History, theory and methodology, Sage Publications Limited, 2011."},{"key":"402_CR36","unstructured":"R Development Core Team, R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing, 2011."},{"key":"402_CR37","unstructured":"Rogers, E.M., Diffusion of innovations, Simon and Schuster, 2010."},{"key":"402_CR38","doi-asserted-by":"crossref","unstructured":"Saito, K. and Nakano, R. and Kimura, M. and Lovrek, I. and Howlett, R. and Jain, L., \u201cPrediction of Information Diffusion Probabilities for Independent Cascade Model,\u201d in KnowledgeBased Intelligent Information and Engineering Systems (Lovrek, I. and Howlett, R.J. and Jain, L. eds.), Springer Verlag, pp. 67\u201375, 2008.","DOI":"10.1007\/978-3-540-85567-5_9"},{"issue":"1","key":"402_CR39","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1146\/annurev.ps.46.020195.003021","volume":"46","author":"JP Shaffer","year":"1995","unstructured":"Shaffer : \u201cMultiple hypothesis testing,\u201d. Annual review of psychology 46(1), 561\u2013584 (1995)","journal-title":"Annual review of psychology"},{"issue":"3","key":"402_CR40","first-page":"375","volume":"4","author":"P.M. Spira","year":"1975","unstructured":"Spira P.M., Pan A.: \u201cOn finding and updating spanning trees and shortest paths,\u201d. IAM Journal on Computing 4(3), 375\u2013380 (1975)","journal-title":"IAM Journal on Computing"},{"key":"402_CR41","doi-asserted-by":"crossref","unstructured":"Viswanath, B. and Mislove, A. and Cha, M. and Gummadi, K.P., \u201cOn the Evolution of User Interaction in Facebook,\u201d in Proc. Workshop on Online Social Networks, Springer, pp. 37\u201342, 2009.","DOI":"10.1145\/1592665.1592675"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-014-0402-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00354-014-0402-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-014-0402-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T05:32:00Z","timestamp":1565760720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00354-014-0402-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":41,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["402"],"URL":"https:\/\/doi.org\/10.1007\/s00354-014-0402-9","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}