Community structure extraction in directed network using triads

References

• Bastian, M., S. Hetmann, and M. Jacomy. 2009. “Gephi: An Open Source Software for Exploring and Manipulating Networks” Proceedings of the Third International ICWSM Conference. DOI: 10.13140/2.1.1341.1520
   Google Scholar
• Blondel, V. D., J. L. Guillaume, R. Lambiotte, and E. Lefebvre. 2008. “Fast Unfolding of Communities in Large Networks.” Journal of Statistical Mechanics: Theory and Experiment 10: P10008.
   Web of Science ®Google Scholar
• Brandes, U., D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner. 2008. “On Modularity Clustering.” IEEE Transactions on Knowledge and Data Engineering 20: 172–188. doi: 10.1109/TKDE.2007.190689.
   Web of Science ®Google Scholar
• Clemente, G. P., and R. Grassi. 2018. “Directed Clustering in Weighted Networks: A New Perspective.” Chaos, Solitons and Fractals 107: 26–38.
   Web of Science ®Google Scholar
• Dz̃amić, D., D. Aloise, and N. Mladenovic. 2019. “Ascent–Descent Variable Neighborhood Decomposition Search for Community Detection by Modularity Maximization.” Annals of Operations Research 272: 1–15. doi: 10.1007/s10479-017-2553-9.
   Web of Science ®Google Scholar
• Durak, N., A. Pinar, and T. Kolda. 2012. “Degree Relations of Triangles in Real-world Networks and Graph Models.” Proceedings of the 21st ACM International Conference on Information and Knowledge Management 96: 1712–1716.
   Google Scholar
• Ester, M., H. Kriegel, and J. Sander. 1996. “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise.” Computer Communications 96: 226–231.
   Google Scholar
• Fortunato, S.. 2010. “Community Detection in Graphs.” Physics Reports 486 (3): 75–174.
   Web of Science ®Google Scholar
• Kanawati, S. R.. 2014. “Seed-Centric Approaches For Community Detection In Complex Networks.” In International Conference on Social Computing and Social Media, 197–208. Springer International.
   Google Scholar
• Kim, Y., S. W. Son, and H. Jeong. 2010. “Finding Communities in Directed Networks.” Physical Review E 81 (1).
   Web of Science ®Google Scholar
• Klymko, C., D. F. Gleich, and T. G. Kolda. 2014. “Using Triangles to Improve Community Detection in Directed Networks.” Conference Stanford University.
   Google Scholar
• Krings, G., and V. D. Blondel. 2011. An Upper Bound on Community Size in Scalable Community Detection.” arXiv preprint:1103.5569.
   Google Scholar
• Lancichinetti, A., and S. Fortunato. 2009. “Community Detection Algorithms: A Comparative Analysis.” Physical Review E 80 (5): 056–117.
   Web of Science ®Google Scholar
• Latapy, M., C. Magnien, and N. Del Vecchio. 2008. “Basic Notions for the Analysis of Large Two-mode Networks.” Social Networks 30 (1): 31–48.
   Web of Science ®Google Scholar
• Leskovec, J., J. Kleinberg, and C. Faloutsos. 2005. “Graphs Over Time: Densification Laws, Shrinking Diameters and Possible Explanations.” In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. 177–187.
   Google Scholar
• Li, X. 2019. “Directed LPA: Propagating Labels in Directed Networks.” Physics Letters A 383 (8): 732–737.
   Web of Science ®Google Scholar
• Maliaros, F. D.. 2013. “Clustering and Community Detection in Directed Networks: A Survey.” arXiv 1308.0971.
   Google Scholar
• Newman, M. E.. 2004. “Detecting Community Structure in Networks.” The European Physical Journal B-Condensed Matter and Complex Systems 38 (2): 321–330.
   Web of Science ®Google Scholar
• Nicosia, V., G. Mangioni, and M. Malgeri. 2009. “Extending the Definition of Modularity to Directed Graphs With Overlapping Communities.” Journal of Statistical Mechanics: Theory and Experiment.
   Google Scholar
• Pang-Ning, T., M. Steinbach, and V. Kumar. 2005. Introduction to Data Mining. ISBN 0-321-32136-7.
   Google Scholar
• Pons, P., and M. Latapy. 2005. “Computing Communities in Large Networks Using Random Walks.” International Symposium on Computer and Information Sciences 284–293.
   Google Scholar
• Raghavan, U. N., and R. Albert. 2007. “Near Linear Time Algorithm to Detect Community Structures in Large-scale Networks.” Physical Review E 96: 36–106.
   Google Scholar
• Santiago, R., and L. C. Lamb. 2017. “Efficient Modularity Density Heuristics for Large Graphs.” European Journal of Operational Research 258 (3): 844–865.
   Web of Science ®Google Scholar
• Satuluri, V., and S. Parthasarathy. 2011. “Symmetrizations for Clustering Directed Graphs.” In Proceedings of the 14th International Conference on Extending Database Technology. 343–354. ACM.
   Google Scholar
• Serrour, B., and S. Arenas. 2011. “Detecting Communities of Triangles in Complex Networks Using Spectral Optimization.” Computer Communications 34: 629–634.
   Web of Science ®Google Scholar
• Shaojie, Q., H. Nan, G. Yunjun, L. Rong-Hua, H. Jianbin, G. Jun, A. G. Louis, and W. Xindong. 2018. “A Fast Parallel Community Discovery Model on Complex Networks Through Approximate Optimization.” IEEE Transactions on Knowledge and Data Engineering 30 (09): 1638–1651.
   Google Scholar
• Souravlas, S., A. Sifaleras, and S. Katsavounis. 2019. “A parallel algorithm for community detection in social networks, based on path analysis and threaded binary trees.” IEEE Access 7 (1): 20 499–20 519.
   Google Scholar
• Steinhaeuser, K., and N. Chawla. 2008. “Community Detection in a Large Real-world Social Network.” In Social Computing, Behavioral Modeling, and Prediction 42: 168–175.
   Google Scholar
• Steven, L., and M. Martin. 2016. “Close Communities in Social Networks: Boroughs and 2-clubs.” Social Network Analysis Mining 6: 20:1–20:16.
   Web of Science ®Google Scholar
• Team, R. Core. 2013. “R: A Language and Environment for Statistical Computing.” R Foundation for Statistical Computing.
   Google Scholar
• Tianbao, Y., C. Yun, and Z. Shenghuo. 2010. “Directed Network Community Detection: A Popularity and Productivity Link Model.” In SIAM Data Mining'10.
   Google Scholar
• Tsourakakis, C. E.. 2008. “Fast Counting of Triangles in Large Real Networks Without Counting: Algorithms and Laws.” In 2008 Eighth IEEE International Conference on Data Mining. 784–793.
   Google Scholar
• Wang, L.. 2011. “Detecting Community Kernels in Large Social Networks.” IEEE 11th International Conference on Data Mining. 608–617.
   Google Scholar
• Wasserman, S., and F. Katerin. 1994. “Social Networks Analysis : Methods and Applications.” Physics Reports 486: 75–174.
   Google Scholar
• Xu, Y., H. Xu, and D. Zhang. 2015. “A Novel Disjoint Community Detection Algorithm for Social Networks Based on Backbone Degree and Expansion.” Expert Systems with Applications 42: 8349–8360.
   Web of Science ®Google Scholar
• Zhou, D., T. Hofman, and B. Schlkopf. 2005. “Semi-Supervised Learning on Directed Graphs.” In Advances in Neural Information Processing Systems (NIPS), pp. 1633–1640.
   Google Scholar