[1] LAZEGA E, WASSERMAN S, FAUST K. Wasserman stanley, faust katherine, social network analysis: Methods and applications[J]. Revue Franaise De Sociologie, 1995,36(4):781-783.
[2] 陈燕方,李志宇,梁循,等. 在线社会网络谣言检测综述[J]. 计算机学报, 2018,41(7):1648-1677.
[3] SUDBURY A. The proportion of the population never hearing a rumour[J]. Journal of Applied Probability, 1985,22(2):443-446.
[4] SHAH D, ZAMAN T. Detecting sources of computer viruses in networks: Theory and experiment[C]// Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems. 2010:203-214.
[5] DONG W X, ZHANG W Y, TAN C W. Rooting out the rumor culprit from suspects[C]// 2013 IEEE International Symposium on Information Theory. 2013:2671-2675.
[6] ZHU K, YING L. Information source detection in the SIR model: A sample-path-based approach[J]. IEEE/ACM Transactions on Networking, 2014,24(1):408-421.
[7] PINTO P C, THIRAN P, VETTERLI M. Locating the source of diffusion in large-scale networks[J]. Physical Review Letters, 2012,109(6):068702.
[8] LOUNI A, SUBBALAKSHMI K P. Who spread that rumor: Finding the source of information in large online social networks with probabilistically varying internode relationship strengths[J]. IEEE Transactions on Computational Social Systems, 2018,5(2):335-343.
[9] 王祖俪,王娟,石磊,等. 基于客观赋权法的多属性社交网络节点重要性排序[J]. 计算机应用研究, 2016,33(10):2933-2936.
[10]NEWMANM E J. Networks an Introduction[M]. New York: Oxford University Press, 2010.
[11]FREEMANL C. A set of measures of centrality based on betweenness[J]. Sociometry, 1977,40(1):35-41.
[12]FREEMANL C. Centrality in social networks conceptual clarification[J]. Social Networks, 1978,1(3):215-239.
[13]BONACICH P. Factoring and weighting approaches to status scores and clique identification[J]. Journal of Mathematical Sociology, 1972,2(1):113-120.
[14]ZACHARY W W. An information flow model for conflict and fission in small groups[J]. Journal of Anthropological Research, 1977,33(4):452-473.
[15]GIRVAN M, NEWMAN M E. Community structure in social and biological networks[C]// Proceedings of the National Academy of Sciences of the United States of America. 2002:7821-7826.
[16]LESKOVEC J, MCAULEY J. Learning to discover social circles in ego networks[C]// Proceedings of the 25th International Conference on Neural Information Processing Systems. 2012:539-547.
[17]LESKOVEC J, HUTTENLOCHER D P, KLEINBERG J, et al. Predicting positive and negative links in online social networks[C]// Proceedings of the 19th International Conference on World Wide Web. 2010:641-650.
[18]PALUCH R, LU X, SUCHECKI K, et al. Fast and accurate detection of spread source in large complex networks[J]. Scientific Reports, 2018,8(1):1-10.
[19]KUMAR A, BORKAR V S, KARAMCHANDANI N. Temporally agnostic rumor-source detection[J]. IEEE Transactions on Signal and Information Processing over Networks, 2017,3(2):316-329.
[20]SHAH D, ZAMAN T. Rumor centrality: A universal source detector[C]// Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems. 2012:199-210.
[21]WU C H, HO J M, LEED T. Travel-time prediction with support vector regression[J]. IEEE Transactions on Intelligent Transportation Systems, 2004,5(4):276-281.
[22]SABIDUSSI G. The centrality index of a graph[J]. Psychometrika, 1966,31(4):581-603.
[23]MORENO Y, PASTOR-SATORRAS R, VESPIGNANI A. Epidemic outbreaks in complex heterogeneous networks[J]. The European Physical Journal B-Condensed Matter and Complex Systems, 2002,26(4):521-529.
|