Model-Based Edge Clustering

References

• Adamic, L. A. , and Glance, N. (2005), “The Political Blogosphere and the 2004 U.S. Election: Divided They Blog,” in Proceedings of the 3rd International Workshop on Link Discovery, LinkKDD’05, ACM, New York, NY, USA, pp. 36–43.
   Google Scholar
• Ahn, Y.-Y. , Bagrow, J. P. , and Lehmann, S. (2010), “Link Communities Reveal Multiscale Complexity in Networks,” Nature , 466, 761. DOI: 10.1038/nature09182.
   PubMed Web of Science ®Google Scholar
• Airoldi, E. M. , Blei, D. M. , Fienberg, S. E. , and Xing, E. P. (2008), “Mixed Membership Stochastic Blockmodels,” Journal of Machine Learning Research , 9, 1981–2014.
   PubMed Web of Science ®Google Scholar
• Ball, B. , Karrer, B. , and Newman, M. E. J. (2011), “Efficient and Principled Method for Detecting Communities in Networks,” Physical Review E , 84, 036103. DOI: 10.1103/PhysRevE.84.036103.
   PubMed Web of Science ®Google Scholar
• Bello-Orgaz, G. , Salcedo-Sanz, S. , and Camacho, D. (2018), “A Multi-Objective Genetic Algorithm for Overlapping Community Detection Based on Edge Encoding,” Information Sciences , 462, 290–314. DOI: 10.1016/j.ins.2018.06.015.
   Web of Science ®Google Scholar
• Biernacki, C. , Celeux, G. , and Govaert, G. (2000), “Assessing a Mixture Model for Clustering With the Integrated Completed Likelihood,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 22, 719–725.
   Web of Science ®Google Scholar
• Borg, I. , and Groenen, P. J. (2005), Modern Multidimensional Scaling: Theory and Applications , New York: Springer.
   Google Scholar
• Broderick, T. , and Cai, D. (2015), “Edge-Exchangeable Graphs, Sparsity, and Power Laws,” in NIPS 2015 Workshop on Bayesian Nonparametrics: The Next Generation .
   Google Scholar
• Cai, Q. , Ma, L. , Gong, M. , and Tian, D. (2016), “A Survey on Network Community Detection Based on Evolutionary Computation,” International Journal of Bio-Inspired Computation , 8, 84–98. DOI: 10.1504/IJBIC.2016.076329.
   Web of Science ®Google Scholar
• Celeux, G. , and Soromenho, G. (1996), “An Entropy Criterion for Assessing the Number of Clusters in a Mixture Model,” Journal of Classification , 13, 195–212. DOI: 10.1007/BF01246098.
   Web of Science ®Google Scholar
• Crane, H. , and Dempsey, W. (2018), “Edge Exchangeable Models for Interaction Networks,” Journal of the American Statistical Association , 113, 1311–1326. DOI: 10.1080/01621459.2017.1341413.
   PubMed Web of Science ®Google Scholar
• Danon, L. , Díaz-Guilera, A. , Duch, J. , and Arenas, A. (2005), “Comparing Community Structure Identification,” Journal of Statistical Mechanics: Theory and Experiment , 2005, P09008.
   Web of Science ®Google Scholar
• Dempster, A. P. , Laird, N. M. , and Rubin, D. B. (1977), “Maximum Likelihood From Incomplete Data via the EM Algorithm,” Journal of the Royal Statistical Society, Series B, 39, 1–38.
   Google Scholar
• Deng, X. , Li, G. , Dong, M. , and Ota, K. (2017), “Finding Overlapping Communities Based on Markov Chain and Link Clustering,” Peer-to-Peer Networking and Applications , 10, 411–420. DOI: 10.1007/s12083-016-0457-0.
   Web of Science ®Google Scholar
• Dhumal, A. , and Kamde, P. (2015), “Survey on Community Detection in Online Social Networks,” International Journal of Computer Applications , 9, 35–41. DOI: 10.5120/21571-4609.
   Google Scholar
• Eddelbuettel, D. , and Balamuta, J. J. (2017), “Extending extitR With extitC++: A Brief Introduction to extitRcpp,” PeerJ Preprints , 5, e3188v1.
   Google Scholar
• Enugala, R. , Rajamani, L. , Ali, K. , and Kurapati, S. (2015), “Community Detection in Dynamic Social Networks: A Survey,” International Journal of Research and Applications , 2, 278–285. DOI: 10.17812/IJRA/2(6)/50.
   Google Scholar
• Evans, T. S. , and Lambiotte, R. (2009), “Line Graphs, Link Partitions, and Overlapping Communities,” Physical Review E , 80, 016105. DOI: 10.1103/PhysRevE.80.016105.
   PubMed Web of Science ®Google Scholar
• Evans, T. S. , and Lambiotte, R. (2010), “Line Graphs of Weighted Networks for Overlapping Communities,” The European Physical Journal B , 77, 265–272.
   Web of Science ®Google Scholar
• Fortunato, S. (2010), “Community Detection in Graphs,” Physics Reports , 486, 75–174. DOI: 10.1016/j.physrep.2009.11.002.
   Web of Science ®Google Scholar
• Fraley, C. , and Raftery, A. E. (2007), “Bayesian Regularization for Normal Mixture Estimation and Model-Based Clustering,” Journal of Classification , 24, 155–181. DOI: 10.1007/s00357-007-0004-5.
   Web of Science ®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
• Hubert, L. , and Arabie, P. (1985), “Comparing Partitions,” Journal of Classification , 2, 193–218. DOI: 10.1007/BF01908075.
   Web of Science ®Google Scholar
• Janson, S. (2018), “On Edge Exchangeable Random Graphs,” Journal of Statistical Physics , 173, 448–484. DOI: 10.1007/s10955-017-1832-9.
   PubMed Web of Science ®Google Scholar
• Karkada, U. , Adamic, L. A. , Kahn, J. , and Iwashyna, T. (2011), “Limiting the Spread of Highly Resistant Hospital-Acquired Microorganisms via Critical Care Transfers: A Simulation Study,” Intensive Care Medicine , 37, 1633–1640. DOI: 10.1007/s00134-011-2341-y.
   PubMed Web of Science ®Google Scholar
• Kim, P. , and Kim, S. (2015), “Detecting Overlapping and Hierarchical Communities in Complex Network Using Interaction-Based Edge Clustering,” Physica A: Statistical Mechanics and its Applications , 417, 46–56. DOI: 10.1016/j.physa.2014.09.035.
   Web of Science ®Google Scholar
• Kim, Y. , and Jeong, H. (2011), “Map Equation for Link Communities,” Physical Review E , 84, 026110.
   Web of Science ®Google Scholar
• Malliaros, F. D. , and Vazirgiannis, M. (2013), “Clustering and Community Detection in Directed Networks: A Survey,” Physics Reports , 533, 95–142. DOI: 10.1016/j.physrep.2013.08.002.
   Web of Science ®Google Scholar
• Meilă, M. (2003), “Comparing Clusterings by the Variation of Information,” in Learning Theory and Kernel Machines , eds. B. Schölkopf and M. K. Warmuth , Berlin, Heidelberg: Springer, pp. 173–187.
   Google Scholar
• Nepusz, T. , Petróczi, A. , Négyessy, L. , and Bazsó, F. (2008), “Fuzzy Communities and the Concept of Bridgeness in Complex Networks,” Physical Review E , 77, 016107. DOI: 10.1103/PhysRevE.77.016107.
   Web of Science ®Google Scholar
• O’Connor, L. , Médard, M. , and Feizi, S. (2015), “Maximum Likelihood Latent Space Embedding of Logistic Random Dot Product Graphs,” arXiv no. 1510.00850.
   Google Scholar
• Papastamoulis, P. , and Iliopoulos, G. (2010), “An Artificial Allocations Based Solution to the Label Switching Problem in Bayesian Analysis of Mixtures of Distributions,” Journal of Computational and Graphical Statistics , 19, 313–331. DOI: 10.1198/jcgs.2010.09008.
   Web of Science ®Google Scholar
• Pereira-Leal, J. B. , Enright, A. J. , and Ouzounis, C. A. (2004), “Detection of Functional Modules From Protein Interaction Networks,” Proteins: Structure, Function, and Bioinformatics , 54, 49–57. DOI: 10.1002/prot.10505.
   PubMed Web of Science ®Google Scholar
• Pizzuti, C. (2018), “Evolutionary Computation for Community Detection in Networks: A Review,” IEEE Transactions on Evolutionary Computation , 22, 464–483. DOI: 10.1109/TEVC.2017.2737600.
   Web of Science ®Google Scholar
• Raftery, A. E. , Niu, X. , Hoff, P. D. , and Yeung, K. Y. (2012), “Fast Inference for the Latent Space Network Model Using A Case-Control Approximate Likelihood,” Journal of Computational and Graphical Statistics , 21, 901–919. DOI: 10.1080/10618600.2012.679240.
   PubMed Web of Science ®Google Scholar
• Rastelli, R. , Maire, F. , and Friel, N. (2018), “Computationally Efficient Inference for Latent Position Network Models,” arXiv no. 1804.02274.
   Google Scholar
• Roberts, G. O. , and Rosenthal, J. S. (1998), “Optimal Scaling of Discrete Approximations to Langevin Diffusions,” Journal of the Royal Statistical Society, Series B, 60, 255–268. DOI: 10.1111/1467-9868.00123.
   Google Scholar
• Salter-Townshend, M. , and Murphy, T. B. (2013), “Variational Bayesian Inference for the Latent Position Cluster Model for Network Data,” Computational Statistics & Data Analysis , 57, 661–671.
   Web of Science ®Google Scholar
• Sampson, S. F. (1968), “A Novitiate in a Period of Change: An Experimental and Case Study of Relationships,” unpublished Ph.D. dissertation, Department of Sociology, Cornell University.
   Google Scholar
• Sewell, D. K. , Simmering, J. E. , Justice, S. , Pemmaraju, S. V. , Segre, A. M. , and Polgreen, P. M. (2019), “Estimating the Attributable Disease Burden and Effects of Inter-Hospital Patient Sharing on Clostridium Difficile Infections,” Infection Control and Hospital Epidemiology , 40, 656–661. DOI: 10.1017/ice.2019.73.
   PubMed Web of Science ®Google Scholar
• Shi, C. , Cai, Y. , Fu, D. , Dong, Y. , and Wu, B. (2013), “A Link Clustering Based Overlapping Community Detection Algorithm,” Data & Knowledge Engineering , 87, 394–404.
   Web of Science ®Google Scholar
• Svoboda, T. , Henry, B. , Shulman, L. , Kennedy, E. , Rea, E. , Ng, W. , Wallington, T. , Yaffe, B. , Gournis, E. , Vicencio, E. , Basrur, S. , and Glazier, R. H. (2004), “Public Health Measures to Control the Spread of the Severe Acute Respiratory Syndrome During the Outbreak in Toronto,” New England Journal of Medicine , 350, 2352–2361. DOI: 10.1056/NEJMoa032111.
   PubMed Web of Science ®Google Scholar
• Wu, Z. , Lin, Y. , Wan, H. , and Tian, S. (2010), “A Fast and Reasonable Method for Community Detection With Adjustable Extent of Overlapping ,” in 2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering , pp. 376–379.
   Google Scholar
• Xie, J. , Kelley, S. , and Szymanski, B. K. (2013), “Overlapping Community Detection in Networks: The State-of-the-Art and Comparative Study,” ACM Computing Survey , 45, 43. DOI: 10.1145/2501654.2501657.
   Web of Science ®Google Scholar
• Young, S. J. , and Scheinerman, E. R. (2007), “Random Dot Product Graph Models for Social Networks,” in Algorithms and Models for the Web-Graph , eds. A. Bonato and F. R. K. Chung , Berlin, Heidelberg: Springer, pp. 138–149.
   Google Scholar
• Zhang, Y. , Zhang, Y. , Chen, Q. , Ai, Z. , and Gong, Z. (2018), “True-Link Clustering Through Signaling Process and Subcommunity Merge in Overlapping Community Detection,” Neural Computing and Applications , 30, 3613–3621. DOI: 10.1007/s00521-017-2946-3.
   Web of Science ®Google Scholar