Directed Community Detection With Network Embedding

References

• Bader, G. D., and Hogue, C. W. V. (2003), “An Automated Method for Finding Molecular Complexes in Large Protein Interaction Networks,” BMC Bioinformatics, 4, 2. DOI: 10.1186/1471-2105-4-2.
   PubMed Web of Science ®Google Scholar
• Bickel, P. J., and Sarkar, P. (2016), “Hypothesis Testing for Automated Community Detection in Networks,” Journal of the Royal Statistical Society, Series B, 78, 253–273. DOI: 10.1111/rssb.12117.
   Google Scholar
• Chen, K., and Lei, J. (2018), “Network Cross-Validation for Determining the Number of Communities in Network Data,” Journal of the American Statistical Association, 113, 241–251. DOI: 10.1080/01621459.2016.1246365.
   Web of Science ®Google Scholar
• Chien, I. E., Lin, C. Y., and Wang, I. H. (2019), “On the Minimax Misclassification Ratio of Hypergraph Community Detection,” IEEE Transactions on Information Theory, 65, 8095–8118. DOI: 10.1109/TIT.2019.2928301.
   Web of Science ®Google Scholar
• Chung, F. R. K., and Graham, F. C. (1997), Spectral Graph Theory (No. 92), Providence, RI: American Mathematical Society.
   Google Scholar
• Cui, P., Wang, X., Pei, J., and Zhu, W. (2018), “A Survey on Network Embedding,” IEEE Transactions on Knowledge and Data Engineering, 31, 833–852. DOI: 10.1109/TKDE.2018.2849727.
   Web of Science ®Google Scholar
• Dhillon, I. S. (2001), “Co-Clustering Documents and Words Using Bipartite Spectral Graph Partitioning,” in Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 269–274. DOI: 10.1145/502512.502550.
   Google Scholar
• Fienberg, S. E. (2012), “A Brief History of Statistical Models for Network Analysis and Open Challenges,” Journal of Computational and Graphical Statistics, 21, 825–839. DOI: 10.1080/10618600.2012.738106.
   Web of Science ®Google Scholar
• Girvan, M., and Newman, M. E. J. (2002), “Community Structure in Social and Biological Networks,” Proceedings of the National Academy of Sciences of the United States of America, 99, 7821–7826. DOI: 10.1073/pnas.122653799.
   PubMed Web of Science ®Google Scholar
• Gorski, J., Pfeuffer, F., and Klamroth, K. (2007), “Biconvex Sets and Optimization With Biconvex Functions: A Survey and Extensions,” Mathematical Methods of Operations Research, 66, 373–407. DOI: 10.1007/s00186-007-0161-1.
   Web of Science ®Google Scholar
• Guimerà, R., Sales-Pardo, M., and Amaral, L. A. N. (2007), “Module Identification in Bipartite and Directed Networks,” Physical Review E, 76, 036102. DOI: 10.1103/PhysRevE.76.036102.
   Web of Science ®Google Scholar
• Guo, X., Qiu, Y., Zhang, H., and Chang, X. (2020), “Randomized Spectral Co-Clustering for Large-Scale Directed Networks,” arXiv no. 2004.12164v2.
   Google Scholar
• Hoff, P. D., Raftery, A. E., and Handcock, M. S. (2002), “Latent Space Approaches to Social Network Analysis,” Journal of the American Statistical Association, 97, 1090–1098. DOI: 10.1198/016214502388618906.
   Web of Science ®Google Scholar
• Holland, P. W., Laskey, K. B., and Leinhardt, S. (1983), “Stochastic Blockmodels: First Steps,” Social Networks, 5, 109–137. DOI: 10.1016/0378-8733(83)90021-7.
   Web of Science ®Google Scholar
• Ji, P., and Jin, J. (2016), “Coauthorship and Citation Networks for Statisticians,” The Annals of Applied Statistics, 10, 1779–1812. DOI: 10.1214/15-AOAS896.
   Web of Science ®Google Scholar
• Joe, H., and Ward, J. (1963), “Hierarchical Grouping to Optimize an Objective Function,” Journal of the American Statistical Association, 58, 236–244. DOI: 10.1080/01621459.1963.10500845.
   Web of Science ®Google Scholar
• Jure, L., and Andrej, K. (2014), “SNAP Datasets: Stanford Large Network Dataset Collection,” available at http://snap.stanford.edu/data.
   Google Scholar
• Kaufman, L., and Rousseeuw, P. J. (2009), Finding Groups in Data: An Introduction to Cluster Analysis (Vol. 344), Hoboken, NJ: Wiley.
   Google Scholar
• Ke, Z. T., Shi, F., and Xia, D. (2020), “Community Detection for Hypergraph Networks via Regularized Tensor Power Iteration,” arXiv no. 1909.06503.
   Google Scholar
• Klein, T., and Rio, E. (2005), “Concentration Around the Mean for Maxima of Empirical Processes,” The Annals of Probability, 33, 1060–1077. DOI: 10.1214/009117905000000044.
   Web of Science ®Google Scholar
• Kluger, Y., Basri, R., Chang, J. T., and Gerstein, M. (2003), “Spectral Biclustering of Microarray Data: Coclustering Genes and Conditions,” Genome Research, 13, 703–716. DOI: 10.1101/gr.648603.
   PubMed Web of Science ®Google Scholar
• Koltchinskii, V. (2011), Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems: Ecole d’Eté de Probabilités de Saint-Flour XXXVIII-2008 (Vol. 2033), Berlin, Heidelberg: Springer-Verlag.
   Google Scholar
• Kossinets, G., and Watts, D. J. (2006), “Empirical Analysis of an Evolving Social Network,” Science, 311, 88–90. DOI: 10.1126/science.1116869.
   PubMed Web of Science ®Google Scholar
• Lei, J., and Rinaldo, A. (2015), “Consistency of Spectral Clustering in Stochastic Block Models,” The Annals of Statistics, 43, 215–237. DOI: 10.1214/14-AOS1274.
   Web of Science ®Google Scholar
• Leicht, E. A., and Newman, M. E. J. (2008), “Community Structure in Directed Networks,” Physical Review Letters, 100, 118703. DOI: 10.1103/PhysRevLett.100.118703.
   PubMed Web of Science ®Google Scholar
• Leskovec, J., Lang, K. J., Dasgupta, A., and Mahoney, M. W. (2008), “Statistical Properties of Community Structure in Large Social and Information Networks,” in Proceedings of the Seventeenth International Conference on World Wide Web, ACM, pp. 695–704. DOI: 10.1145/1367497.1367591.
   Google Scholar
• Li, T., Levina, E., and Zhu, J. (2020), “Network Cross-Validation by Edge Sampling,” Biometrika, 107, 257–276. DOI: 10.1093/biomet/asaa006.
   Web of Science ®Google Scholar
• Lin, Y. (2004), “A Note on Margin-Based Loss Functions in Classification,” Statistics & Probability Letters, 68, 73–82.
   Web of Science ®Google Scholar
• Ma, Z., Ma, Z., and Yuan, H. (2020), “Universal Latent Space Model Fitting for Large Networks With Edge Covariates,” Journal of Machine Learning Research, 21, 1–67.
   PubMed Web of Science ®Google Scholar
• Mariadassou, M., Robin, S., and Vacher, C. (2010), “Uncovering Latent Structure in Valued Graphs: A Variational Approach,” The Annals of Applied Statistics, 4, 715–742. DOI: 10.1214/10-AOAS361.
   Web of Science ®Google Scholar
• Morrison, D., Jacobson, S., Sauppe, J., and Sewell, E. (2016), “Branch-and-Bound Algorithms: A Survey of Recent Advances in Searching, Branching, and Pruning,” Discrete Optimization, 19, 79–102. DOI: 10.1016/j.disopt.2016.01.005.
   Web of Science ®Google Scholar
• Nepusz, T., Yu, H., and Paccanaro, A. (2012), “Detecting Overlapping Protein Complexes in Protein-Protein Interaction Networks,” Nature Methods, 9, 471. DOI: 10.1038/nmeth.1938.
   PubMed Web of Science ®Google Scholar
• Newman, M. E. J. (2006), “Modularity and Community Structure in Networks,” Proceedings of the National Academy of Sciences of the United States of America, 103, 8577–8582. DOI: 10.1073/pnas.0601602103.
   PubMed Web of Science ®Google Scholar
• Perozzi, B., Al-Rfou, R., and Skiena, S. (2014), “Deepwalk: Online Learning of Social Representations,” in Proceedings of the Twentieth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710.
   Google Scholar
• Rohe, K., Qin, T., and Yu, B. (2016), “Co-Clustering Directed Graphs to Discover Asymmetries and Directional Communities,” Proceedings of the National Academy of Sciences of the United States of America, 113, 12679–12684. DOI: 10.1073/pnas.1525793113.
   PubMed Web of Science ®Google Scholar
• Satuluri, V., and Parthasarathy, S. (2011), “Symmetrizations for Clustering Directed Graphs,” in Proceedings of the Fourteenth International Conference on Extending Database Technology, pp. 343–354. ACM.
   Google Scholar
• Sengupta, S., and Chen, Y. (2018), “A Block Model for Node Popularity in Networks With Community Structure,” Journal of the Royal Statistical Society, Series B, 80, 365–386. DOI: 10.1111/rssb.12245.
   Google Scholar
• Stanton-Salazar, R. D., and Dornbusch, S. M. (1995), “Social Capital and the Reproduction of Inequality: Information Networks Among Mexican-Origin High School Students,” Sociology of Education, 68, 116–135. DOI: 10.2307/2112778.
   Web of Science ®Google Scholar
• Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., and Mei, Q. (2015), “Line: Large-scale Information Network Embedding,” in Proceedings of the Twenty-Fourth International Conference on World Wide Web, pp. 1067–1077.
   Google Scholar
• Tang, X., Xue, F., and Qu, A. (2020), “Individualized Multidirectional Variable Selection,” Journal of the American Statistical Association, 0, 1–17.
   Web of Science ®Google Scholar
• Von Luxburg, U. (2007), “A Tutorial on Spectral Clustering,” Statistics and Computing, 17, 395–416. DOI: 10.1007/s11222-007-9033-z.
   Web of Science ®Google Scholar
• Wang, D., Cui, P., and Zhu, W. (2016), “Structural Deep Network Embedding,” in Proceedings of the Twenty-Second ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225–1234.
   Google Scholar
• Wang, J. (2010), “Consistent Selection of the Number of Clusters via Crossvalidation,” Biometrika, 97, 893–904. DOI: 10.1093/biomet/asq061.
   Web of Science ®Google Scholar
• Wang, X., Cui, P., Wang, J., Pei, J., Zhu, W., and Yang, S. (2017), “Community Preserving Network Embedding,” in Thirty-first AAAI Conference on Artificial Intelligence.
   Google Scholar
• Witten, D. M., Shojaie, A., and Zhang, F. (2014), “The Cluster Elastic Net for High-Dimensional Regression With Unknown Variable Grouping,” Technometrics, 56, 112–122. DOI: 10.1080/00401706.2013.810174.
   PubMed Web of Science ®Google Scholar
• Zhang, Y., Levina, E., and Zhu, J. (2017), “Estimating Network Edge Probabilities by Neighbourhood Smoothing,” Biometrika, 104, 771–783. DOI: 10.1093/biomet/asx042.
   Web of Science ®Google Scholar
• Zhao, Y., Levina, E., and Zhu, J. (2012), “Consistency of Community Detection in Networks Under Degree-Corrected Stochastic Block Models,” The Annals of Statistics, 40, 2266–2292. DOI: 10.1214/12-AOS1036.
   Web of Science ®Google Scholar
• Zhu, Y., Shen, X., and Ye, C. (2016), “Personalized Prediction and Sparsity Pursuit in Latent Factor Models,” Journal of the American Statistical Association, 111, 241–252. DOI: 10.1080/01621459.2014.999158.
   Web of Science ®Google Scholar