Skip to main content

Heterogeneous Network Community Detection Algorithm Based on Maximum Bipartite Clique

  • Conference paper
  • First Online:
Data Science (ICPCSEE 2018)

Abstract

The community mining of heterogeneous networks is a hot issue to study the big data of the network, and the original structure of the heterogeneous network and its information can fully exploit the community structure in the network. However, the existing algorithms mainly analysis one type of objects in the heterogeneous network, and the algorithms about the heterogeneous nodes which constitute the community structure is rarely studied. Therefore, this paper introduces the theory about maximum bipartite clique: Firstly, regarding the largest maximum bipartite clique that the key node belongs to as initial community. Then, the community is expanded based on the similarity between the neighbor node of the community and the initial community in quantitative. Finally, a reasonable community structure is mined and the simulation experiments are carried out on artificial networks and real heterogeneous networks. The experimental results show that the algorithm has relatively high community accuracy and modularity in community detection, which proves the rationality and validity of the algorithm.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Chopade, P., Zhan, J.: Community detection in large-scale big data networks. In: ASE International Conference, pp. 1–7 (2014)

    Google Scholar 

  2. Guo, G., Qian, Y., Zhang, X., et al.: Algorithm of detecting community in bipartite network with autonomous determination of the number of communities. Pattern Recogn. Artif. Intell. 28(11), 969–975 (2015)

    Google Scholar 

  3. Liwei, H., Deyi, L., Yutao, M., et al.: A meta path-based link prediction model for heterogeneous information networks. Chin. J. Comput. 37(4), 848–858 (2014)

    Google Scholar 

  4. Hu, J., Wang, B., Lee, D.: Research on centrality of node importance in scale-free complex networks. In: Proceedings of the 31st Chinese Control Conference, China, pp. 1073–1077 (2012)

    Google Scholar 

  5. Huang, R., Wu, Q., Zhu, Y., et al.: Community detection in dynamic heterogeneous network with joint nonnegative matrix factorization. Appl. Res. Comput. 34(10), 2989–2992 (2017)

    Google Scholar 

  6. Kitsak, M., Havlin, S., Paul, G., et al.: Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks. Phys. Rev. E 75(5), 056115 (2007)

    Article  Google Scholar 

  7. Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure of complex networks. New J. Phys. 11(3), 19–44 (2018)

    Google Scholar 

  8. Li, X., Zhang, P., Di, Z., et al.: Community structure in complex networks. Complex Syst. Complex. Sci. 5(3), 19–42 (2008)

    Article  Google Scholar 

  9. Scott, J., Hughes, M., Mackenzie, J.: The anatomy of Scottish capital: Scottish companies and Scottish capital, 1900–1979. Econ. Hist. Rev. 33(4) (1980)

    Google Scholar 

  10. Sun, Y., Norick, B., Han, J., et al.: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1348–1356. ACM (2012)

    Google Scholar 

  11. Tang, L., Liu, H.: Community Detection and Mining in Social Media, p. 137. Morgan & Claypool (2010)

    Google Scholar 

  12. Wei, D., Li, Y., Zhang, Y., et al.: Degree centrality based on the weighted network. In: 2012 24th Chinese Control and Decision Conference (CCDC), pp. 3976–3979. IEEE, China (2012)

    Google Scholar 

  13. Wu, Q., Chen, F., Huang, R., et al.: Community detection in heterogeneous network with semantic paths. Acta Electronica Sinica 44(6), 1465–1471 (2016)

    Google Scholar 

  14. Wu, Y., Di, Z., Fan, Y.: A clustering algorithm for bipartite network based on distribution matrix of resources. J. Beijing Normal Univ. Nat. Sci. 5, 643–646 (2010)

    Google Scholar 

  15. Wang, Y., Jin, X., Cheng, X.: Network big data; present and future. Chin. J. Comput. 36(6), 1125–1138 (2013)

    Article  Google Scholar 

  16. Wang, T., Liu, Y., Xi, Y., et al.: Identifying community in bipartite networks using graph regularized-based non-negative matrix factorization. J. Electron. Inf. Technol. 37(9), 2238–2245 (2015)

    Google Scholar 

  17. Zhang, P., Wang, J., Li, X., et al.: Clustering coefficient and community structure of bipartite networks. Phys. A: Stat. Mech. Appl. 387(27), 6869–6875 (2007)

    Article  Google Scholar 

Download references

Acknowledgement

This article is supported by National Natural Science Foundation of China under grant No. 71461017.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaodong Qian .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Qian, X., Yang, L., Fang, J. (2018). Heterogeneous Network Community Detection Algorithm Based on Maximum Bipartite Clique. In: Zhou, Q., Gan, Y., Jing, W., Song, X., Wang, Y., Lu, Z. (eds) Data Science. ICPCSEE 2018. Communications in Computer and Information Science, vol 901. Springer, Singapore. https://doi.org/10.1007/978-981-13-2203-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2203-7_19

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2202-0

  • Online ISBN: 978-981-13-2203-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics