Skip to main content

Label Propagation Algorithm Based on Adaptive H Index

  • Conference paper
  • First Online:
Data Mining and Big Data (DMBD 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10943))

Included in the following conference series:

Abstract

Label propagation algorithm is a part of semi-supervised learning method, which is widely applied in the field of community partition. The algorithm is simple and fast, especially in the large complex community network. The algorithm shows nearly linear time complexity, but it has great instability and randomness. Many scholars make their improvements on the original label propagation, but most of them are not suitable for large community network discovery, which usually have higher time complexity. Therefore, we propose a label propagation algorithm based on adaptive H index, which improves the stability and accuracy of LPA by using the refined H index as a measure of node importance. Finally, the algorithm is tested by public standard dataset and synthetic benchmark network dataset, and the test result shows that the proposed algorithm has better stability and accuracy than some existing classic algorithms.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004)

    Google Scholar 

  2. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech., 155–168 (2008)

    Google Scholar 

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

    Google Scholar 

  4. Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)

    Article  Google Scholar 

  5. Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)

    Google Scholar 

  6. Leung, I.X., Hui, P., Liò, P., Crowcroft, J.: Towards real-time community detection in large networks. Phys. Rev. E 79(6), 066107 (2009)

    Google Scholar 

  7. Xie, J.R., Szymanski, B.K., Liu, X.M.: SLPA: uncovering overlapping communities in social networks via a speaker listener interaction dynamic process. In: Proceedings of the 11th IEEE International Conference on Data Mining Workshops, pp. 344–349, December 2011

    Google Scholar 

  8. Zhang, X.-K., Fei, S., Song, C., Tian, X., Ao, Y.-Y.: Label propagation algorithm based on local cycles for community detection. Int. J. Modern Phys. B 29, 1550029 (2015)

    Article  MathSciNet  Google Scholar 

  9. Xing, Y., et al.: A node influence based label propagation algorithm for community detection in networks. Sci. World J. 2014, 627581 (2014)

    Google Scholar 

  10. Su, C., Jia, X., Xie, X., Yu, Y.: A new random-walk based label propagation community detection algorithm, pp. 137–140. IEEE (2016)

    Google Scholar 

  11. Kitsak, M., et al.: Identification of influential spreaders in complex networks. Nat. Phys. 6, 888–893 (2010)

    Article  Google Scholar 

  12. Sohn, J., Kang, D., Park, H., Joo, B.-G., Chung, I.-J.: An improved social network analysis method for social networks. In: Huang, Y.-M., Chao, H.-C., Deng, D.-J., Park, J.J.H. (eds.) Advanced Technologies, Embedded and Multimedia for Human-centric Computing. LNEE, vol. 260, pp. 115–123. Springer, Dordrecht (2014). https://doi.org/10.1007/978-94-007-7262-5_13

    Chapter  Google Scholar 

  13. Green, O., Bader, D.A.: Faster betweenness centrality based on data structure experimentation. Procedia Comput. Sci. 18, 399–408 (2013)

    Article  Google Scholar 

  14. Subelj, L., Bajec, M.: Group detection in complex networks: an algorithm and comparison of the state of the art. Physica A 397, 144–156 (2014)

    Article  MathSciNet  Google Scholar 

  15. Lyu, L., et al.: The H-index of a network node and its relation to degree and coreness. Nat. Commun. 7 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhengyou Xia .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhu, X., Xia, Z. (2018). Label Propagation Algorithm Based on Adaptive H Index. In: Tan, Y., Shi, Y., Tang, Q. (eds) Data Mining and Big Data. DMBD 2018. Lecture Notes in Computer Science(), vol 10943. Springer, Cham. https://doi.org/10.1007/978-3-319-93803-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93803-5_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93802-8

  • Online ISBN: 978-3-319-93803-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics