Skip to main content
SpringerLink
Log in

Local community detection with hints

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Local community detection is a widely used method for identifying groups of nodes starting from seeding nodes. The seed(s) are usually selected either randomly or based only on structural properties of the network. However, in many cases the choice of seed(s) incorporates external knowledge that attaches to these nodes an additional importance for their community. This knowledge, may be derived from an expert on the domain, or may arise from the network’s side information and it constitutes our motivation for the present work; this additional information about the importance of seed(s) can be exploited for detection of better and more relevant communities. We call such biased seed(s), hint(s). Our approach, is to reflect the importance of hints by changing appropriately the network in their vicinity. To the best of our knowledge, no such viewpoint of the seeding nodes in local community detection has been considered before. The aim of this study is to identify a single community which contains the hint(s). Our key contribution is the proposed Hint Enhancement Framework(HEF) that applies a two-step procedure to discover the community of the hint(s): 1) it changes the network by amplifying the hint(s) using re-weighting or re-wiring strategies so as to materialize the bias towards them and 2) it applies local community detection algorithms on the altered network of step 1. We experimentally evaluate HEF in synthetic and real datasets, and demonstrate the positive aspects of the framework in identifying better communities, in comparison with plain local community detection algorithms as well as a global one.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. It is believed that the communities in biological networks are relatively small i.e. 3 − 150 nodes [76, 82].

  2. Number of unique user id’s appearing in any link. Otherwise, n = 1157827.

References

  1. Aghdam NH, Ashtiani M, Azgomi MA (2020) An uncertainty-aware computational trust model considering the co-existence of trust and distrust in social networks. Inf Sci 513:465–503

    Article  MathSciNet  Google Scholar 

  2. Andersen R, Chung F, Lang K (2006) Local graph partitioning using pagerank vectors. In: 2006 47Th annual IEEE symposium on foundations of computer science (FOCS’06). IEEE, pp 475–486

  3. Arenas A, Fernandez A, Gomez S (2008) Analysis of the structure of complex networks at different resolution levels. j Phys 10(5):053039

  4. Bagrow JP, Bollt EM (2005) Local method for detecting communities. Phys Rev E 72(4):046108

  5. Balakrishnan H, Deo N (2006) Discovering communities in complex networks. In: Proceedings of the 44th annual Southeast regional conference. ACM, pp 280–285

  6. Berry JW, Hendrickson B, LaViolette RA, Phillips CA (2011) Tolerating the community detection resolution limit with edge weighting. Phys Rev E 83(5):056119

  7. Bohlin L, Edler D, Lancichinetti A, Rosvall M (2014) Community detection and visualization of networks with the map equation framework. In: Measuring scholarly impact. Springer, pp 3–34

  8. Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Mathematical Sociol 2(1):113–120

    Article  Google Scholar 

  9. Chakraborty T, Dalmia A, Mukherjee A, Ganguly N (2017) Metrics for community analysis: A survey. ACM Comput Surv (CSUR) 50(4):1–37

    Article  Google Scholar 

  10. Chakraborty T, Srinivasan S, Ganguly N, Mukherjee A, Bhowmick S (2016) Permanence and community structure in complex networks. ACM Trans Knowl Discov Data (TKDD) 11(2):14

    Google Scholar 

  11. Chen D, Lü L, Shang M-S, Zhang Y-C, Zhou T (2012) Identifying influential nodes in complex networks. Physica: Stat Mech Appl 391(4):1777–1787

    Article  Google Scholar 

  12. Chen J, Zaïane O, Goebel R (2009) Local community identification in social networks. In: 2009 International conference on advances in social network analysis and mining. IEEE, pp 237–242

  13. Chen Q, Fang M (2011) Community detection based on local central vertices of complex networks. In: 2011 International conference on machine learning and cybernetics, vol 2. IEEE, pp 920–925

  14. Chen S, Wang Z-Z, Tang L, Tang Y-N, Gao Y-Y, Li H-J, Xiang J, Zhang Y (2018) Global vs local modularity for network community detection. Plos one 13(10):e0205284

  15. Choumane A, Awada A, Harkous A (2020) Core expansion: a new community detection algorithm based on neighborhood overlap. Soc Netw Anal Min 10(1):30

    Article  Google Scholar 

  16. Chunaev P (2020) Community detection in node-attributed social networks: a survey. Comput Sci Rev 37:100286

    Article  MathSciNet  MATH  Google Scholar 

  17. Ciglan M, Laclavík M, Nørvåg K (2013) On community detection in real-world networks and the importance of degree assortativity. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 1007–1015

  18. Clauset A (2005) Finding local community structure in networks. Phys Rev E 72(2):026132

  19. Edler D., Eriksson A., Rosvall M (2020) The mapequation software package

  20. De Meo P, Ferrara E, Fiumara G, Provetti A (2013) Enhancing community detection using a network weighting strategy. Inf Sci 222:648–668

    Article  MathSciNet  MATH  Google Scholar 

  21. De Meo P, Ferrara E, Fiumara G, Provetti A (2014) Mixing local and global information for community detection in large networks. J Comput Syst Sci 80(1):72–87

    Article  MathSciNet  MATH  Google Scholar 

  22. De Meo P, Ferrara E, Fiumara G, Ricciardello A (2012) A novel measure of edge centrality in social networks. Knowl-based Syst 30:136–150

    Article  Google Scholar 

  23. Derrible S, Kennedy C (2009) Network analysis of world subway systems using updated graph theory. Transp Res Rec 2112(1):17–25

    Article  Google Scholar 

  24. F1 score lemma (2020) F1 score lemma — Wikipedia, the free encyclopedia

  25. Fortunato S (2010) Community detection in graphs. Phys Rep 486(3-5):75–174

    Article  MathSciNet  Google Scholar 

  26. Fortunato S, Hric D (2016) Community detection in networks: A user guide. Phys Repx 659:1–44

    Article  MathSciNet  Google Scholar 

  27. Friedkin NE (1983) Horizons of observability and limits of informal control in organizations. Social Forces 62(1):54–77

    Article  Google Scholar 

  28. Hamann M, Röhrs E, Wagner D (2017) Local community detection based on small cliques. Algorithms 10(3):90

    Article  MathSciNet  MATH  Google Scholar 

  29. He K, Shi P, Hopcroft JE, Bindel D (2016) Local spectral diffusion for robust community detection. In: Twelfth workshop on mining and learning with graphs

  30. Huang J, Sun H, Liu Y, Song Q, Weninger T (2011) Towards online multiresolution community detection in large-scale networks. PloS one 6(8):e23829

    Article  Google Scholar 

  31. Huang W-Q, Zhuang X-T, Yao S (2009) A network analysis of the chinese stock market. Physica A: Stat Mech Appl 388(14):2956–2964

    Article  Google Scholar 

  32. Jaccard Index lemma (2016) Jaccard index lemma —

  33. Jarukasemratana S, Murata T, Liu X (2014) Community detection algorithm based on centrality and node closeness in scale-free networks. Trans Japan Soc Artif Intell 29(2):234–244

    Article  Google Scholar 

  34. Jiang C, Liu S, Lin Z, Zhao G, Duan R, Liang K (2016) Domain-aware trust network extraction for trust propagation in large-scale heterogeneous trust networks. Knowl-Based Syst 111:237– 247

    Article  Google Scholar 

  35. Jin H, Huang X, Shao K, Li G, Wang J, Yang H, Hou Y (2019) Integrated bioinformatics analysis to identify 15 hub genes in breast cancer. Oncol Lett 18(2):1023–1034

    Google Scholar 

  36. Kakisim A, Sogukpinar I (2017) Weighting links based on co-occurrence relationship for community detection enhancement. In: Proceedings of the 2017 International Conference on Data Mining, Communications and Information Technology. ACM, pp 34

  37. Khadivi A, Rad AA, Hasler M (2011) Network community-detection enhancement by proper weighting. Phys Rev E 83(4):046104

  38. Kloster K, Gleich DF (2014) Heat kernel based community detection. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 1386–1395

  39. Labatut V, Cherifi H (2011) Accuracy measures for the comparison of classifiers. In: The 5th international conference on information technology, pp 1–5. Al-zaytoonah University of Jordan

  40. Lai D, Lu H, Nardini C (2010) Enhanced modularity-based community detection by random walk network preprocessing. Phys Rev E 81(6):066118

  41. Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78(4):046110

  42. Lanczos C (1950) An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. United states governm, Press Office, Los Angeles

  43. Leicht EA, Holme P, Newman MEJ (2006) Vertex similarity in networks. Phys Rev E 73(2):026120

  44. LFR benchmark graph generator (2019) Returns the lfr benchmark graph

  45. Li X, Tian Q, Tang M, Chen X, Yang X (2020) Local community detection for multi-layer mobile network based on the trust relation. Wirel Netw 26(8):5503–5515

    Article  Google Scholar 

  46. Li Y, He K, Bindel D, Hopcroft JE (2015) Uncovering the small community structure in large networks: A local spectral approach. In: Proceedings of the 24th international conference on world wide web, pp 658–668. International World Wide Web Conferences Steering Committee

  47. Li Y, He K, Kloster K, Bindel Dx, Hopcroft J (2018) Local spectral clustering for overlapping community detection. ACM Trans Knowl Discov Data (TKDD) 12(2):17

    Google Scholar 

  48. Luo F, Wang JZ, Promislow E (2006) Exploring local community structures in large networks. In: 2006 IEEE/WIC/ACM International conference on web intelligence (WI 2006 main conference proceedings)(WI’s06). IEEE, pp 233–239

  49. Ma L, Huang H, He Q, Chiew K, Wu J, Che Y (2013) Gmac: a seed-insensitive approach to local community detection. In: International conference on data warehousing and knowledge discovery. Springer, pp 297–308

  50. Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, pp 29–42

  51. Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and Analysis of Online Social Networks. In: Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC’07), San Diego

  52. Moradi B, Shakeri H, Poggi-Corradini P, Higgins M (2018) New methods for incorporating network cyclic structures to improve community detection. CoRR, arXiv:1805.07484

  53. Newman MEJ (2001) Scientific collaboration networks. ii. shortest paths, weighted networks, and centrality. Phys Rev E 64(1):016132

  54. Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036104

  55. Newman MEJ (2006) Modularity and community structure in networks. Proc Ntl Acad Sci 103 (23):8577–8582

    Article  Google Scholar 

  56. Nicosia V, Criado R, Romance M, Russo G, Latora V (2012) Controlling centrality in complex networks. Sci Rep 2:218

    Article  Google Scholar 

  57. Opsahl, Agneessens F, Skvoretz J (2010) Node centrality in weighted networks Generalizing degree and shortest paths. Soc Netw 32(3):245–251

    Article  Google Scholar 

  58. Orman GK, Labatut V, Cherifi H (2011) Qualitative comparison of community detection algorithms. In: International conference on digital information and communication technology and its applications. Springer, pp 265–279

  59. Otte E, Rousseau R (2002) Social network analysis: a powerful strategy, also for the information sciences. J Inf Sci 28(6):441–453

    Article  Google Scholar 

  60. Palla G, Derényi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society, vol 435

  61. Panagiotakis C, Papadakis H, Fragopoulou P (2015) Local community detection via flow propagation. In: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015. ACM, pp 81–88

  62. Pearson correlation coefficient lemma (2020) Pearson correlation coefficient lemma — Wikipedia, the free encyclopedia

  63. Peel L, Larremore DB, Clauset A (2017) The ground truth about metadata and community detection in networks. Sci Adv 3(5):e1602548

  64. Radicchi F, Castellano C, Cecconi F, Loreto V, Parisi D (2004) Defining and identifying communities in networks. Proc Ntl Acad Sci 101(9):2658–2663

    Article  Google Scholar 

  65. Ringnér M, Fredlund E, Häkkinen J, Borg Å, Staaf J (2011) Gobo: gene expression-based outcome for breast cancer online. PloS one 6(3)

  66. Rossetti G, Cazabet R (2018) Community discovery in dynamic networks: a survey. ACM Comput Surv (CSUR) 51(2):1–37

    Article  Google Scholar 

  67. Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. Eur Phys J Special Top 178(1):13–23

    Article  Google Scholar 

  68. Ruan J, Dean AK, Zhang W (2010) A general co-expression network-based approach to gene expression analysis: comparison and applications. BMC Syst Biol 4(1):8

    Article  Google Scholar 

  69. Shakeri H, Poggi-Corradini P, Albin N, Scoglio C (2017) Network clustering and community detection using modulus of families of loops. Phys Rev E 95(1):012316

  70. Sharan R, Ulitsky I, Shamir R (2007) Network-based prediction of protein function. Mol Syst Biol 88(02):3

    Google Scholar 

  71. Sharma GN, Dave R, Sanadya J, Sharma P, Sharma KK (2010) Various types and management of breast cancer: an overview. J Adv Pharma Technol Res 1(2):109

    Google Scholar 

  72. Shen H-W (2013) Community structure of complex networks. Springer Science & Business Media

  73. Shi P, He K, Bindel D, Hopcroft JE (2019) Locally-biased spectral approximation for community detection. Knowl-Based Syst 164:459–472

    Article  Google Scholar 

  74. Stanford University Network Datasets (2012) Stanford university network datasets

  75. Sun PG (2014) Weighting links based on edge centrality for community detection. Physica: Stat Mech Appl 394:346–357

    Article  Google Scholar 

  76. Tripathi B, Parthasarathy S, Sinha H, Raman K, Ravindran B (2019) Adapting community detection algorithms for disease module identification in heterogeneous biological networks. Front Gen 10:164

    Article  Google Scholar 

  77. Tsourakakis CE, Pachocki J, Mitzenmacher M (2017) Scalable motif-aware graph clustering. In: Proceedings of the 26th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, pp 1451–1460

  78. University of North Carolina TCGA genomic characterization center (2016) The cancer genome atlas

  79. Wang X, Liu G, Li J, Nees JP (2017) Locating structural centers: A density-based clustering method for community detection. PloS one 12(1)

  80. Wang Y, Di Z, Fan Y (2011) Identifying and characterizing nodes important to community structure using the spectrum of the graph. PloS one 6(11)

  81. Wang Z, Li Z, Yuan G, Sun Y, Rui X, Xiang X (2018) Tracking the evolution of overlapping communities in dynamic social networks. Knowl-Based Syst 157:81–97

    Article  Google Scholar 

  82. Wilber AW, Doye JPK, Louis AA, Lewis ECF (2009) Monodisperse self-assembly in a model with protein-like interactions. J Chem Phys 131(17):11B602

  83. Wu Y, Jin R, Li J, Zhang X (2015) Robust local community detection: on free rider effect and its elimination. Proc VLDB Endowment 8(7):798–809

    Article  Google Scholar 

  84. Xiang J, Hu K, Zhang Y, Bao M-H, Tang L, Tang Y-N, Gao Y-Y, Li J-M, Chen B, Hu J-B (2016) Enhancing community detection by using local structural information. J Stat Mech: Theory Exper 2016(3):033405

  85. Yan B, Gregory S (2012) Detecting community structure in networks using edge prediction methods. J Stat Mech: Theory Exper 2012(09):P09008

    Article  Google Scholar 

  86. Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181–213

    Article  Google Scholar 

  87. Yoo A, Sanders G, Henson V, Vassilevski P (2015) Enhancing community detection by affinity-based edge weighting scheme. Technical report, Lawrence Livermore National lab.(LLNL), Livermore

  88. Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452–473

    Article  Google Scholar 

  89. Zhang H, Zhou C, Liang X, Xi Z, Li Y (2015) A novel edge weighting method to enhance network community detection. In: 2015 IEEE International conference on systems, man, and cybernetics. IEEE, pp 167–172

  90. Zhang J-X, Chen D-B, Dong Q, Zhao Z-D (2016) Identifying a set of influential spreaders in complex networks. Sci Rep 6:27823

    Article  Google Scholar 

  91. Zhang T, Wu B (2012) A method for local community detection by finding core nodes. In: 2012 IEEE/ACM International conference on advances in social networks analysis and mining. IEEE, pp 1171–1176

  92. Zhang X, Ji Z, Qi W, Zhao H (2013) Identifying influential nodes in complex networks with community structure. Knowl-Based Syst 42:74–84

    Article  Google Scholar 

  93. Zhang Y, Wu B, Yu L, Lv J (2019) Local community detection based on network motifs. Tsinghua Sci Technol 24(6):716–727

    Article  Google Scholar 

  94. Zhang Y, Wang J, Yi W, Zhou L (2009) Parallel community detection on large networks with propinquity dynamics. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 997–1006

  95. Zhou Y, Sun G, Xing Y, Zhou R, Wang Z (2016) Local community detection algorithm based on minimal cluster. Appl Comput Intell Soft Comput 2016:11. https://doi.org/10.1155/2016/3217612

    Google Scholar 

Download references

Acknowledgements

Georgia Baltsou states that: This research is co-financed by Greece and the European Union (European Social Fund-ESF) through the Operational Programme “Human Resources Development, Education and Lifelong Learning” in the context of the project “Strengthening Human Resources Research Potential via Doctorate Research - 2nd Cycle” (MIS-5000432), implemented by the State Scholarships Foundation (IKY).

figure d

Author information

Authors and Affiliations

  1. Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece

    Georgia Baltsou & Athena Vakali

  2. Department of Computer Engineering and Informatics, University of Patras, Patras, Greece

    Konstantinos Tsichlas

Authors
  1. Georgia Baltsou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantinos Tsichlas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Athena Vakali
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Georgia Baltsou.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Baltsou, G., Tsichlas, K. & Vakali, A. Local community detection with hints. Appl Intell 52, 9599–9620 (2022). https://doi.org/10.1007/s10489-021-02946-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02946-7

Keywords

Search

Navigation