Triangular Concordance Learning of Networks

References

• Airoldi, E. M., Blei, D. M., Fienberg, S. E., and Xing, E. P. (2009), “Mixed Membership Stochastic Blockmodels,” in Advances in Neural Information Processing Systems, 21 eds. D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou, pp. 33–40, Curran Associates, Inc.
   Google Scholar
• Bickel, P. J., and Chen, A. (2009), “A Nonparametric View of Network Models and Newman–Girvan and other Modularities,” Proceedings of the National Academy of Sciences, 106, 21068–21073.
   Google Scholar
• Binkiewicz, N., Vogelstein, J. T., and Rohe, K. (2017), “Covariate-Assisted Spectral Clustering,” Biometrika, 104, 361–377. DOI: 10.1093/biomet/asx008.
   PubMed Web of Science ®Google Scholar
• Buccini, A., Dell’Acqua, P., and Donatelli, M. (2019), “A General Framework for ADMM Acceleration,” Numerical Algorithms, 85, 829–848. DOI: 10.1007/s11075-019-00839-y.
   Web of Science ®Google Scholar
• Chen, H., Yu, Z., Yang, Q., and Shao, J. (2020), “Attributed Graph Clustering with Subspace Stochastic Block Model,” Information Sciences, 535, 130–141. DOI: 10.1016/j.ins.2020.05.044.
   Web of Science ®Google Scholar
• Chi, E. C., and Lange, K. (2015), “Splitting Methods for Convex Clustering,” Journal of Computational and Graphical Statistics, 24, 994–1013. DOI: 10.1080/10618600.2014.948181.
   PubMed Web of Science ®Google Scholar
• Fan, J., and Li, R. (2001), “Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties,” Journal of the American Statistical Association, 96, 1348–1360. DOI: 10.1198/016214501753382273.
   Web of Science ®Google Scholar
• Fraley, C., and Raftery, A. E. (2002), “Model-based Clustering, Discriminant Analysis, and Density Estimation,” Journal of the American Statistical Association, 97, 611–631. DOI: 10.1198/016214502760047131.
   Web of Science ®Google Scholar
• Gehler, P. V., and Chapelle, O. (2007), “Deterministic Annealing for Multiple-Instance Learning,” in Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, AISTATS 2007, San Juan, Puerto Rico, March 21-24, 2007, volume 2 of JMLR Proceedings, eds. M. Meila and X. Shen, pp. 123–130. JMLR.org.
   Google Scholar
• Grund, T. U., and Densley, J. A. (2014), “Ethnic Homophily and Triad Closure,” Journal of Contemporary Criminal Justice, 31, 354–370. DOI: 10.1177/1043986214553377.
   Google Scholar
• Handcock, M. S., Raftery, A. E., and Tantrum, J. M. (2007), “Model-based Clustering for Social Networks,” Journal of the Royal Statistical Society, Series A, 170, 301–354. DOI: 10.1111/j.1467-985X.2007.00471.x.
   Web of Science ®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
• Hubert, L., and Arabie, P. (1985), “Comparing Partitions,” Journal of Classification, 2, 193–218. DOI: 10.1007/BF01908075.
   Web of Science ®Google Scholar
• Karrer, B., and Newman, M. E. J. (2011), “Stochastic Blockmodels and Community Structure in Networks,” Physical Review E, 83, 016107. DOI: 10.1103/PhysRevE.83.016107.
   PubMed Web of Science ®Google Scholar
• Lazega, E. (2001), The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership, Oxford: Oxford University Press.
   Google Scholar
• Ma, S., and Huang, J. (2017), “A Concave Pairwise Fusion Approach to Subgroup Analysis,” Journal of the American Statistical Association, 112, 410–423. DOI: 10.1080/01621459.2016.1148039.
   Web of Science ®Google Scholar
• Newman, M. E. J. (2001), “The Structure of Scientific Collaboration Networks,” Proceedings of the National Academy of Sciences, 98, 404–409.
   Google Scholar
• Ng, A. Y., Jordan, M. I., and Weiss, Y. (2001), “On Spectral Clustering: Analysis and an Algorithm,” in Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic, NIPS’01, pp. 849–856, Cambridge, MA: MIT Press.
   Google Scholar
• Ouyang, G., Dey, D. K., and Zhang, P. (2019), “Clique-based Method for Social Network Clustering,” Journal of Classification, 37, 254–274. DOI: 10.1007/s00357-019-9310-5.
   Web of Science ®Google Scholar
• Rose, K. (1998), “Deterministic Annealing for Clustering, Compression, Classification, Regression, and Related Optimization Problems,” Proceedings of the IEEE, 86, 2210–2239. DOI: 10.1109/5.726788.
   Web of Science ®Google Scholar
• Shi, J., and Malik, J. (2000), “Normalized Cuts and Image Segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 22, 888–905. DOI: 10.1109/34.868688.
   Web of Science ®Google Scholar
• Snijders, T. A., and Nowicki, K. (1997), “Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure,” Journal of Classification, 14, 75–100. DOI: 10.1007/s003579900004.
   Web of Science ®Google Scholar
• Tallberg, C. (2004), “A Bayesian Approach to Modeling Stochastic Blockstructures with Covariates,” The Journal of Mathematical Sociology, 29, 1–23. DOI: 10.1080/00222500590889703.
   Web of Science ®Google Scholar
• Tang, F., Wang, C., Su, J., and Wang, Y. (2019), “Spectral Clustering-based Community Detection using Graph Distance and Node Attributes,” Computational Statistics, 35, 69–94. DOI: 10.1007/s00180-019-00909-8.
   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, Y. J., and Wong, G. Y. (1987), “Stochastic Blockmodels for Directed Graphs,” Journal of the American Statistical Association, 82, 8–19. DOI: 10.1080/01621459.1987.10478385.
   Web of Science ®Google Scholar
• Xu, Y., Liu, M., Lin, Q., and Yang, T. (2017), “Admm Without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization,” in Advances in Neural Information Processing Systems, eds. I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Vol. 30), Curran Associates, Inc.
   Google Scholar
• Yang, X., and Yan, X. (2019), “Mechanism and a New Algorithm for Nonconvex Clustering,” Journal of Statistical Computation and Simulation, 90, 719–746. DOI: 10.1080/00949655.2019.1700986.
   Web of Science ®Google Scholar
• Zhang, C. H. (2010), “Nearly Unbiased Variable Selection under Minimax Concave Penalty,” The Annals of Statistics, 38, 894–942. DOI: 10.1214/09-AOS729.
   Web of Science ®Google Scholar