Skip to main content
Log in

A community detection algorithm based on multi-similarity method

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Social network detection and identification constitute an important topic in the field of sociology. Previous graph similarity has focus on either the topological structure of graph or the feature value of vertex. In this work, a multi-similarity measure method for community is described. The approach devised by using multi-similarity properties based on vertex features, relationship density and topology structure, and therefore is can be formulated and extended to practical implementation. The framework of community detection combines K-means clustering, spectral clustering and modularity algorithm-making it an effective basis for the realization of a social network interpretation. With this scheme, three evaluation criteria are proposed for methodology determination. The experimental results show a better working performance of the recommended method than traditional algorithms via statistical analysis.

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

Access this article

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

Similar content being viewed by others

References

  1. Hechter, M.: Principles of Group Solidarity. University of California Press, Berkeley (1988)

    Google Scholar 

  2. Liu, C., Liu, J., Jiang, Z.: A multiobjective evolutionary algorithm based on similarity for community detection from signed social networks. IEEE Transact. Cybern. 44(12), 2274–2287 (2014)

    Article  Google Scholar 

  3. Alhajj, R.: Introduction to the second issue of Social Network Analysis and Mining journal: scientific computing for social network analysis and dynamicity. Soc. Netw. Anal. Mining 1, 73–74 (2011)

    Article  Google Scholar 

  4. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6638), 440–442 (1998)

    Article  Google Scholar 

  5. Adamic, L.A., Huberman, B.A.: Power-law distribution of the world wide web. Science 287(5461), 2115 (2000)

    Article  Google Scholar 

  6. Devinatz, V.G.: Introduction to social networking, management responsibilities, and employee rights: the evolving role of social networking in employment decisions. Empl. Responsib. Rights J. 27, 305–306 (2015)

    Article  Google Scholar 

  7. Lee, S.-H., Kim, J.-M., Choi, Y.-K.: Similarity measure construction using fuzzy entropy and distance measure. LNAI 4114, 952–958 (2006)

    Google Scholar 

  8. Ronald, R.Y.: Monitored heavy fuzzy measures and their role in decision making under uncertainty. Fuzzy Sets Syst. 139(3), 491–513 (2003)

    Article  MathSciNet  Google Scholar 

  9. Rbill, Y.: Decision making over necessity measures through the Choquet integral criterion. Fuzzy Sets Syst. 157(23), 3025–3039 (2006)

    Article  MathSciNet  Google Scholar 

  10. Hsieh, C.H., Chen, S.H.: Similarity of generalized fuzzy numbers with graded mean integration representation. In: Proceedings of the Eighth International Fuzzy Systems Association World Congress, pp. 551–555 (1999)

  11. Chen, S.-M., Chen, J.-H.: Fuzzy risk analysis based on similarity measures of generalized fuzzy numbers. IEEE Transact. Fuzzy Syst. 11(1), 450–56 (2003)

    Google Scholar 

  12. Tan, P.N., Steinback, M., Kumar, V.: Introduction to data mining. Data Anal. Cloud 22(6), 1–25 (2006)

    Google Scholar 

  13. Jeh, G., Widom J.: SimRank.: a measure of structural-context similarity. In: Proceedings of the eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, pp. 538–543 (2002)

  14. Yu, W., Lin, X., Zhang, W., et al.: More is simpler: effectively and efficiently assessing vertexpair similarities based on hyperlinks. Proc. Vldb Endow. 7(1), 13–24 (2013)

    Article  Google Scholar 

  15. Zhao, P., Han, J., Sun, Y.: P-Rank.: a comprehensive structural similarity measure over information networks[C]. In: Proceedings of the ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November pp. 553–562 (2009)

  16. Antonellis, I., Molina, H.G., Chang, C.C.: Simrank++: Query rewriting through link analysis of the click graph. Comput. Sci. 1, 1177–1178 (2007)

    Google Scholar 

  17. MacKay, D.C.: Information Theory, Inference, and Learning Algorithms. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  18. Ding, S., Jia, H., Zhang, L.: Research of semi-supervised spectral clustering algorithm based on pairwise constraints. Neural Comput. Appl. 24(1), 211–219 (2014)

    Article  Google Scholar 

  19. Nawaz, W., et al.: Intra graph clustering using collaborative similarity measure. Distrib. Parallel Databases 33(4), 583–603 (2015)

    Article  MathSciNet  Google Scholar 

  20. Sun, Y., Han, J., Yan, X., et al.: PathSim: meta path-based top-K similarity search in heterogeneous information networks. Proc. Vldb Endow. 4(11), 992–1003 (2011)

    Google Scholar 

  21. Qin, X., Dai, W., Jiao, P., et al.: A multi-similarity spectral clustering method for community detection in dynamic networks. Sci. Rep. 6, 31454 (2016)

    Article  Google Scholar 

  22. Niknam, T., Amiri, B., OlamaeI, J., AREFI, A.: An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering. J. Zhejiang Univ. 10(4), 512–519 (2009)

    Article  Google Scholar 

  23. Page, L.: The PageRank Citation Ranking: Bringing Order to the Web, pp. 1–14. Stanford InfoLab, Stanford (1998)

    Google Scholar 

  24. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E: Stat. 69(2), 026113 (2003)

    Article  Google Scholar 

  25. Macqueen J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297 (1967)

  26. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transact. Pattern Anal. Mach. Intell. 22(8), 888–905 (2002)

    Google Scholar 

  27. Park, E.J., Dollinger, A., Huether, L., et al.: The nano-fractal structured tungsten oxides films with high thermal stability prepared by the deposition of size-selected W clusters. Appl. Phys. A 123(6), 418 (2017)

    Article  Google Scholar 

  28. Tian, Y., Hankins, RA., Patel, JM.: Efficient aggregation for graph summarization. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 567–580 (2008)

Download references

Acknowledgements

The research was partially funded by the Key Program of National Natural Science Foundation of China (Grant Nos. 61133005, 61432005), the National Natural Science Foundation of China (Grant Nos. 61370095, 61472124, 61572175), International Science & Technology Cooperation Program of China (2015DFA11240). The work was supported by research Project of the Education Department of Hunan Province (Grant No. 14c0210).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pen ManMan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ni, L., ManMan, P., Wenjun, J. et al. A community detection algorithm based on multi-similarity method. Cluster Comput 22 (Suppl 2), 2865–2874 (2019). https://doi.org/10.1007/s10586-017-1610-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-1610-0

Keywords

Navigation