Une approche probabiliste pour l'identification de structures de communautés
暂无分享,去创建一个
Nathalie Aussenac-Gilles | Bernard Rothenburger | Nacim Fateh Chikhi | Nathalie Aussenac-Gilles | Bernard Rothenburger | Nacim Fateh Chikhi
[1] Matthieu Latapy,et al. Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..
[2] J. Tebbs,et al. An Introduction to Categorical Data Analysis , 2008 .
[3] M. Newman,et al. Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[4] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[5] Thomas Hofmann,et al. Probabilistic Latent Semantic Analysis , 1999, UAI.
[6] M E J Newman,et al. Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[7] David Cohn,et al. Learning to Probabilistically Identify Authoritative Documents , 2000, ICML.
[8] H. Sebastian Seung,et al. Algorithms for Non-negative Matrix Factorization , 2000, NIPS.
[9] Chris H. Q. Ding,et al. On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic Indexing , 2008, Comput. Stat. Data Anal..
[10] E A Leicht,et al. Community structure in directed networks. , 2007, Physical review letters.
[11] Éric Gaussier,et al. Relation between PLSA and NMF and implications , 2005, SIGIR '05.
[12] Radford M. Neal. Pattern Recognition and Machine Learning , 2007, Technometrics.