Comparative analysis of sequential community detection algorithms based on internal and external quality measure

References

• Rahul, Kumar, Rohitash Kumar Banyal, and Puneet Goswami. “Analysis and processing aspects of data in big data applications.” Journal of Discrete Mathematical Sciences and Cryptography 23.2 (2020): 385-393.
   Web of Science ®Google Scholar
• Pramanik, L. K., and M. R. Adhikari. “Factors of Inserted Graphs.” Journal of Dynamical Systems and Geometric Theories 4.2 (2006): 159-165.
   Google Scholar
• Fortunato, Santo. “Community detection in graphs.” Physics reports 486.3-5 (2010): 75-174.
   Web of Science ®Google Scholar
• Barman, Debaditya, et al. “Personalized query recommendation system: A genetic algorithm approach.” Journal of Interdisciplinary Mathematics 23.2 (2020): 523-535.
   Web of Science ®Google Scholar
• Dubes, Richard, and Anil K. Jain. “Validity studies in clustering methodologies.” Pattern recognition 11.4 (1979): 235-254.
   Web of Science ®Google Scholar
• Danon, Leon, et al. “Comparing community structure identification.” Journal of Statistical Mechanics: Theory and Experiment 2005.09 (2005): P09008.
   Google Scholar
• Lancichinetti, Andrea, and Santo Fortunato. “Community detection algorithms: a comparative analysis.” Physical review E 80.5 (2009): 056117.
   PubMed Web of Science ®Google Scholar
• Yang, Zhao, René Algesheimer, and Claudio J. Tessone. “A comparative analysis of community detection algorithms on artificial networks.” Scientific reports 6 (2016): 30750.
   PubMed Web of Science ®Google Scholar
• Csardi, Maintainer Gabor. “Package ‘igraph’.”
   Google Scholar
• Csardi, Gabor, Maintainer Gabor Csardi, and License CC BY-SA. “Package ‘igraphdata’.” yeast 13 (2015): 1.
   Google Scholar
• Csardi, Gabor, and Tamas Nepusz. “The igraph software package for complex network research.” Inter Journal, Complex Systems 1695.5 (2006): 1-9.
   Google Scholar
• Brandes, Ulrik, et al. “On finding graph clusterings with maximum modularity.” International Workshop on Graph-Theoretic Concepts in Computer Science. Springer, Berlin, Heidelberg, 2007.
   Google Scholar
• Newman, Mark EJ. “A measure of betweenness centrality based on random walks.” Social networks 27.1 (2005): 39-54.
   Web of Science ®Google Scholar
• Raghavan, Usha Nandini, Réka Albert, and Soundar Kumara. “Near linear time algorithm to detect community structures in large-scale networks.” Physical review E 76.3 (2007): 036106.
   Web of Science ®Google Scholar
• Newman, Mark EJ. “Finding community structure in networks using the eigenvectors of matrices.” Physical review E 74.3 (2006): 036104.
   Web of Science ®Google Scholar
• Blondel, Vincent D., et al. “Fast unfolding of communities in large networks.” Journal of statistical mechanics: theory and experiment 2008.10 (2008): P10008.
   Google Scholar
• Clauset, Aaron, Mark EJ Newman, and Cristopher Moore. “Finding community structure in very large networks.” Physical review E 70.6 (2004): 066111.
   PubMed Web of Science ®Google Scholar
• Reichardt, Jörg, and Stefan Bornholdt. “Statistical mechanics of community detection.” Physical Review E 74.1 (2006): 016110.
   Web of Science ®Google Scholar
• Pons, Pascal, and Matthieu Latapy. “Computing communities in large networks using random walks.” J. Graph Algorithms Appl. 10.2 (2006): 191-218.
   Google Scholar
• Rosvall, Martin, and Carl T. Bergstrom. “Maps of random walks on complex networks reveal community structure.” Proceedings of the National Academy of Sciences 105.4 (2008): 1118-1123.
   PubMed Web of Science ®Google Scholar
• Hopkins, Brian, and Robin J. Wilson. “The truth about Königsberg.” The College Mathematics Journal 35.3 (2004): 198-207.
   Google Scholar
• Assessing the Political Landscape: Structure, Cognition, and Power in Organizations. David Krackhardt. Admin. Sci. Quart. 35, 342-369, 1990.
   Google Scholar
• Wayne W. Zachary. An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research Vol. 33, No. 4 452-473.
   Web of Science ®Google Scholar
• Negyessy L., Nepusz T., Kocsis L., Bazso F.: Prediction of the main cortical areas and connections involved in the tactile function of the visual cortex by network analysis. European Journal of Neuroscience, 23(7): 1919-1930, 2006.
   PubMed Web of Science ®Google Scholar
• Nepusz T., Petroczi A., Negyessy L., Bazso F.: Fuzzy communities and the concept of bridgeness in complex networks. Physical Review E 77:016107, 2008.
   Google Scholar
• C.E. Priebe, J.M. Conroy, D.J. Marchette, and Y. Park, Scan Statistics on Enron Graphs Computational and Mathematical Organization Theory, Volume 11, Number 3, p229-247, October 2005, Springer Science+Business Media B.V.
   Google Scholar
• Sarkis, Joseph, and Srinivas Talluri. “Performance based clustering for benchmarking of US airports.” Transportation Research Part A: Policy and Practice 38.5 (2004): 329-346.
   Web of Science ®Google Scholar
• D. Gfeller, Simplifying complex networks: from a clustering to a coarse graining strategy, PhD Thesis EPFL, no 3888, 2007.
   Google Scholar
• Comparative assessment of large-scale data sets of protein-protein interactions. Christian von Mering, Roland Krause, Berend Snel, Michael Cornell, Stephen G. Oliver, Stanley Fields and Peer Bork. Nature 417, 399-403 (2002)
   Google Scholar
• Rendón, Eréndira, et al. “Internal versus external cluster validation indexes.” International Journal of computers and communications 5.1 (2011): 27-34.
   Google Scholar
• Yeung, Ka Yee, and Walter L. Ruzzo. “Details of the adjusted rand index and clustering algorithms, supplement to the paper an empirical study on principal component analysis for clustering gene expression data.” Bioinformatics 17.9 (2001): 763-774.
   PubMed Web of Science ®Google Scholar
• Recasens, Marta, and Eduard Hovy. “BLANC: Implementing the Rand index for coreference evaluation.” Natural Language Engineering 17.4 (2011): 485-510.
   Google Scholar
• Steinley, Douglas. “Properties of the Hubert-Arable Adjusted Rand Index.” Psychological methods 9.3 (2004): 386.
   PubMed Web of Science ®Google Scholar
• Meilă, Marina. “Comparing clusterings—an information based distance.” Journal of multivariate analysis 98.5 (2007): 873-895.
   Web of Science ®Google Scholar
• Rendón, Eréndira, et al. “Internal versus external cluster validation indexes.” International Journal of computers and communications 5.1 (2011): 27-34.
   Google Scholar
• Newman, Mark EJ. “Modularity and community structure in networks.” Proceedings of the national academy of sciences 103.23 (2006): 8577-8582.
   PubMed Web of Science ®Google Scholar
• Newman, Mark EJ. “Detecting community structure in networks.” The European Physical Journal B 38.2 (2004): 321-330.
   Web of Science ®Google Scholar
• Gupta, B. M., and S. M. Dhawan. “Parallel computing research in India: A scientometric assessment of Indian publications output during 1998-2017.” COLLNET Journal of Scientometrics and Information Management 13.1 (2019): 111-126.
   Web of Science ®Google Scholar