Mobile QR Code QR CODE

2024

Acceptance Ratio

21%

※ The user interface design of www.ieiespc.org has been recently revised and updated. Please contact inter@theieie.org for any inquiries regarding paper submission.

Journal Search

  1. Home
  2. Archive
  3. 2025-02 (Vol.14 No.01)
  4. 10.5573/IEIESPC.2025.14.1.1
XML PDF INFO REF

REFERENCES

1 
S. Fortunato, ``Community detection in graphs,'' Physics Reports, vol. 486, no. 3-5, pp. 75-174 2010.DOI
2 
L .Tang and H. Liu, ``Community detection and mining in social media,'' Synthesis Lectures on Data Mining and Knowledge Discovery, vol. 2, no. 1, pp. 1-137, 2010.DOI
3 
R Diestel, Random Graphs in Graph Theory, Springer, Berlin, Heidelberg, pp. 323-345, 2017.URL
4 
B. Bollobás, Modern Graph Theory, vol. 184 of Graduate Texts in Mathematics, Springer, New York, NY, p. 4, 1998.DOI
5 
C. C Aggarwal and H. Wang, Managing and Mining Graph Data, Springer, New York, vol. 40, 2010.URL
6 
V. E. Lee, et al., ``A survey of algorithms for dense subgraph discovery,'' Managing and Mining Graph Data, Springer, Boston, MA, pp. 303-336, 2010.DOI
7 
A Clauset, et al., ``Finding community structure in very large networks,'' Physical Review E, vol. 70, no. 6, 066111, 2004.DOI
8 
D. Gibson, et al., ``Discovering large dense subgraphs in massive graphs,'' Proc. of the 31st International Conference on Very Large Data Bases, pp. 721-732, August 2005.URL
9 
M. E. Newman, ``Modularity and community structure in networks,'' Proceedings of the National Academy of Sciences, vol. 103, no. 23, pp. 8577-8582, 2006.DOI
10 
U. N. Raghavan, et al., ``Near linear time algorithm to detect community structures in large-scale networks,'' Physical Review E, vol. 76, no. 3, 036106, 2007.DOI
11 
J. M, Kumpula, et al., ``Sequential algorithm for fast clique percolation,'' Physical Review E, vol. 78, no. 2, 026109, 2008.DOI
12 
F. Zhao and A. K. Tung, ``Large scale cohesive subgraphs discovery for social network visual analysis,'' Proceedings of the VLDB Endowment, vol. 6, no. 2, pp. 85-96, 2012.DOI
13 
J. Saad, ``Dense subgraph extraction with application to community detection,'' IEEE Transactions on Knowledge and Data Engineering, vol. 24, no. 7, pp. 1216-1230, 2010.DOI
14 
J. Huang, et al., ``Revealing density-based clustering structure from the core-connected tree of a network,'' IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 8, pp. 1876-1889, 2012.DOI
15 
M. C. Nascimento and A. C. de Carvalho, ``Spectral methods for graph clustering - A survey,'' European Journal of Operational Research, vol. 211, no. 2, pp. 221-231, 2011.DOI
16 
L. C. Freeman, et al., ``Centrality in valued graphs: A measure of betweenness based on network flow,'' Social Networks, vol. 13, no. 2, pp. 141-154, 1991.DOI
17 
M. M. Iqbal and K. Latha, ``An effective community-based link prediction model for improving accuracy in social networks,'' Journal of Intelligent & Fuzzy Systems, (Preprint), pp. 1-17, 2022.DOI
18 
A. Rusinowska, R. Berghammer, H. D. Swart, and M. Grabisch, ``Social networks: Prestige, centrality, and influence,'' Proc. of International Conference on Relational and Algebraic Methods in Computer Science, Springer, Berlin, Heidelberg, pp. 22-39, May 2011.DOI