Network discovery using wide-area surveillance data
暂无分享,去创建一个
Steven Thomas Smith | Edward K. Kao | Scott Philips | Christian Anderson | Andrew Silberfarb | E. Kao | S. Smith | S. Philips | A. Silberfarb | Christian Anderson
[1] M. Newman,et al. Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[2] Nir Friedman,et al. Probabilistic Graphical Models , 2009, Data-Driven Computational Neuroscience.
[3] Patrick J. Wolfe,et al. Subgraph Detection Using Eigenvector L1 Norms , 2010, NIPS.
[4] Matthew J. Beal. Variational algorithms for approximate Bayesian inference , 2003 .
[5] Edward K. Kao,et al. Information theoretic approach for performance evaluation of multi-class assignment systems , 2010, Defense + Commercial Sensing.
[6] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.
[7] Harry L. Van Trees,et al. Detection, Estimation, and Modulation Theory, Part I , 1968 .
[8] Benjamin A. Miller,et al. Eigenspace analysis for threat detection in social networks , 2011, 14th International Conference on Information Fusion.
[9] Luca Becchetti,et al. A Comparison of Sampling Techniques for Web Graph Characterization , 2006 .
[10] Michael I. Jordan,et al. Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..
[11] Mark Newman,et al. Networks: An Introduction , 2010 .
[12] T. Ferguson. A Bayesian Analysis of Some Nonparametric Problems , 1973 .
[13] Ryan S. Holt,et al. Information theoretic approach for performance evaluation of multi-class assignment systems Citation , 2010 .
[14] Hsinchun Chen,et al. The topology of dark networks , 2008, Commun. ACM.
[15] Patrick J. Wolfe,et al. Toward signal processing theory for graphs and non-Euclidean data , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.
[16] Athina Markopoulou,et al. On the bias of BFS (Breadth First Search) , 2010, 2010 22nd International Teletraffic Congress (lTC 22).