The importance of k-shell in discovering key nodes in complex networks
暂无分享,去创建一个
[1] Guo Qiang,et al. Analysis of the spreading influence of the nodes with minimum K-shell value in complex networks , 2013 .
[2] Neil Genzlinger. A. and Q , 2006 .
[3] W. Marsden. I and J , 2012 .
[4] Yuval Shavitt,et al. A model of Internet topology using k-shell decomposition , 2007, Proceedings of the National Academy of Sciences.
[5] Richard N. Taylor,et al. A Classification and Comparison Framework for Software Architecture Description Languages , 2000, IEEE Trans. Software Eng..
[6] Joel H. Spencer,et al. Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.
[7] Peyman Oreizy,et al. An architecture-based approach to self-adaptive software , 1999, IEEE Intell. Syst..
[8] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[9] Christos Faloutsos,et al. Large Graph Analysis in the GMine System , 2015, IEEE Transactions on Knowledge and Data Engineering.
[10] Lawrence B. Holder,et al. Discovering Structural Anomalies in Graph-Based Data , 2007, Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007).
[11] Lev Muchnik,et al. Identifying influential spreaders in complex networks , 2010, 1001.5285.
[12] Lian Wen,et al. Software Systems as Complex Networks , 2007, 6th IEEE International Conference on Cognitive Informatics.
[13] Charu C. Aggarwal,et al. Outlier Detection for Temporal Data: A Survey , 2014, IEEE Transactions on Knowledge and Data Engineering.