暂无分享,去创建一个
[1] Jon M. Kleinberg,et al. Wherefore art thou R3579X? , 2011, Commun. ACM.
[2] Éva Tardos,et al. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 2002, JACM.
[3] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[4] Charu C. Aggarwal,et al. Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.
[5] Kathryn B. Laskey,et al. Stochastic blockmodels: First steps , 1983 .
[6] J. Bobadilla,et al. Recommender systems survey , 2013, Knowl. Based Syst..
[7] Alina Campan,et al. Preservation of structural properties in anonymized social networks , 2012, 8th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom).
[8] Ben J. A. Kröse,et al. Efficient Greedy Learning of Gaussian Mixture Models , 2003, Neural Computation.
[9] Vitaly Shmatikov,et al. De-anonymizing Social Networks , 2009, 2009 30th IEEE Symposium on Security and Privacy.
[10] Donald F. Towsley,et al. Resisting structural re-identification in anonymized social networks , 2010, The VLDB Journal.
[11] Siddharth Srivastava,et al. Anonymizing Social Networks , 2007 .
[12] F. Maxwell Harper,et al. The MovieLens Datasets: History and Context , 2016, TIIS.
[13] Jérôme Kunegis,et al. KONECT: the Koblenz network collection , 2013, WWW.
[14] New York Dover,et al. ON THE CONVERGENCE PROPERTIES OF THE EM ALGORITHM , 1983 .
[15] Alina Campan,et al. Preserving Communities in Anonymized Social Networks , 2015, Trans. Data Priv..
[16] A KonstanJoseph,et al. The MovieLens Datasets , 2015 .
[17] Edoardo M. Airoldi,et al. Mixed Membership Stochastic Blockmodels , 2007, NIPS.
[18] Roger Guimerà,et al. Accurate and scalable social recommendation using mixed-membership stochastic block models , 2016, Proceedings of the National Academy of Sciences.