An extended clustering method using H-index and minimum distance for searching multiple key spreaders

Identifying multiple key spreaders in a network can effectively control the diffusion of information and optimize the use of available resources, which can be also called the influence maximization...

[1]  Qiang Guo,et al.  Roles of clustering properties for degree-mixing pattern networks , 2017 .

[2]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[3]  Yong Deng,et al.  A new measure of identifying influential nodes: Efficiency centrality , 2017, Commun. Nonlinear Sci. Numer. Simul..

[4]  Haifeng Zhang,et al.  Identifying multiple influential spreaders by a heuristic clustering algorithm , 2017 .

[5]  Ming Tang,et al.  Identifying effective multiple spreaders by coloring complex networks , 2014, ArXiv.

[6]  Hua Yu,et al.  The node importance in actual complex networks based on a multi-attribute ranking method , 2015, Knowl. Based Syst..

[7]  Jian Yu,et al.  An efficient community detection method based on rank centrality , 2013 .

[8]  Daniel J. Brass,et al.  Network Analysis in the Social Sciences , 2009, Science.

[9]  R. May,et al.  Population biology of infectious diseases: Part II , 1979, Nature.

[10]  J. E. Hirsch,et al.  An index to quantify an individual's scientific research output , 2005, Proc. Natl. Acad. Sci. USA.

[11]  Shengwei Mei,et al.  Identifying node importance in complex networks , 2015 .

[12]  Hao Liao,et al.  Overlapping influence inspires the selection of multiple spreaders in complex networks , 2018, Physica A: Statistical Mechanics and its Applications.

[13]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[14]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.

[15]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[16]  Zhen Wang,et al.  Spontaneous Symmetry Breaking in Interdependent Networked Game , 2014, Scientific Reports.

[17]  Tian Bian,et al.  A new evidential methodology of identifying influential nodes in complex networks , 2017 .

[18]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[19]  Jianguo Liu,et al.  Identifying multiple influential spreaders in term of the distance-based coloring , 2016 .

[20]  Yong Deng,et al.  A modified weighted TOPSIS to identify influential nodes in complex networks , 2016 .

[21]  Wolfgang Glänzel,et al.  A Hirsch-type index for journals , 2006, Scientometrics.

[22]  Ming Tang,et al.  Identifying multiple influential spreaders based on generalized closeness centrality , 2018 .

[23]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[24]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[25]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[26]  Alessandro Laio,et al.  Clustering by fast search and find of density peaks , 2014, Science.

[27]  Zheng Zhi-Gang,et al.  Spreading dynamics on scale-free networks , 2009 .

[28]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[29]  Mark E. J. Newman.  A measure of betweenness centrality based on random walks , 2005, Soc. Networks.

[30]  Jun Ma,et al.  Ranking the spreading ability of nodes in complex networks based on local structure , 2014 .

[31]  Enrico Bozzo,et al.  Resistance distance, closeness, and betweenness , 2013, Soc. Networks.

[32]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.