暂无分享,去创建一个
Nagarajan Natarajan | Inderjit S. Dhillon | Cho-Jui Hsieh | Ambuj Tewari | Kai-Yang Chiang | Cho-Jui Hsieh | I. Dhillon | Ambuj Tewari | Nagarajan Natarajan | Kai-Yang Chiang
[1] P. Erdos,et al. On the evolution of random graphs , 1984 .
[2] Inderjit S. Dhillon,et al. Scalable clustering of signed networks using balance normalized cut , 2012, CIKM.
[3] Michael I. Jordan,et al. On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.
[4] Jure Leskovec,et al. Signed networks in social media , 2010, CHI.
[5] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[6] Inderjit S. Dhillon,et al. Parallel matrix factorization for recommender systems , 2014, Knowl. Inf. Syst..
[7] Amos Fiat,et al. Correlation clustering in general weighted graphs , 2006, Theor. Comput. Sci..
[8] Jiming Liu,et al. Community Mining from Signed Social Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.
[9] Jure Leskovec,et al. Predicting positive and negative links in online social networks , 2010, WWW '10.
[10] F. Chung,et al. Spectra of random graphs with given expected degrees , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[11] Inderjit S. Dhillon,et al. Guaranteed Rank Minimization via Singular Value Projection , 2009, NIPS.
[12] Yehuda Koren,et al. Matrix Factorization Techniques for Recommender Systems , 2009, Computer.
[13] B. Bollobás. The evolution of random graphs , 1984 .
[14] Leo Katz,et al. A new status index derived from sociometric analysis , 1953 .
[15] A. van de Rijt,et al. Please Scroll down for Article the Journal of Mathematical Sociology the Micro-macro Link for the Theory of Structural Balance the Micro-macro Link for the Theory of Structural Balance , 2022 .
[16] Fan Chung Graham,et al. The Spectra of Random Graphs with Given Expected Degrees , 2004, Internet Math..
[17] Nagarajan Natarajan,et al. Exploiting longer cycles for link prediction in signed networks , 2011, CIKM '11.
[18] P. Doreian,et al. A partitioning approach to structural balance , 1996 .
[19] Stephen P. Boyd,et al. A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).
[20] 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.
[21] Sahin Albayrak,et al. Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization , 2010, SDM.
[22] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[23] Charles Elkan,et al. Link Prediction via Matrix Factorization , 2011, ECML/PKDD.
[24] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[25] F. Harary. On the notion of balance of a signed graph. , 1953 .
[26] Chris Arney,et al. Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.
[27] F. Harary,et al. STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .
[28] Malik Magdon-Ismail,et al. Communities and Balance in Signed Networks: A Spectral Approach , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.
[29] E. David,et al. Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .
[30] Claudio Gentile,et al. A Correlation Clustering Approach to Link Classification in Signed Networks , 2012, COLT.
[31] Ramanathan V. Guha,et al. Propagation of trust and distrust , 2004, WWW '04.
[32] James A. Davis. Clustering and Structural Balance in Graphs , 1977 .
[33] Lada A. Adamic,et al. Friends and neighbors on the Web , 2003, Soc. Networks.
[34] Inderjit S. Dhillon,et al. Low rank modeling of signed networks , 2012, KDD.
[35] Jon M. Kleinberg,et al. The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..
[36] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[37] Thorsten Joachims,et al. Error bounds for correlation clustering , 2005, ICML.
[38] Christian Bauckhage,et al. The slashdot zoo: mining a social network with negative edges , 2009, WWW.
[39] Anthony Wirth,et al. Correlation Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.
[40] Inderjit S. Dhillon,et al. Weighted Graph Cuts without Eigenvectors A Multilevel Approach , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[41] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[42] Prateek Jain,et al. Low-rank matrix completion using alternating minimization , 2012, STOC '13.
[43] A. Rbnyi. ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .