Skip to main content

OHC: Uncovering Overlapping Heterogeneous Communities

  • Conference paper
  • First Online:
AI 2018: Advances in Artificial Intelligence (AI 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11320))

Included in the following conference series:

  • 2339 Accesses

Abstract

A heterogeneous correlation network represents relationships (edges) among source-typed and attribute-typed objects (nodes). It can be used to model an academic collaboration network, describing connections among authors and published papers. To date, there has been little research into mining communities in heterogeneous networks. The objective of our research is to discover overlapping communities that include all node and edge types in a heterogeneous correlation network. We describe an algorithm, OHC, that detects overlapping communities in heterogeneous correlation networks. Inspired by a homogeneous community scoring function, Triangle Participation Ratio (TPR), OHC finds target heterogeneous communities then expands them recursively with triangle-forming nodes. Experiments on different real world networks demonstrate that OHC identifies heterogeneous communities that are tightly connected internally according to two traditional scoring functions. Additionally, analyzing the top ranking heterogeneous communities in a case study, we evaluate the results qualitatively.

Funded by New Zealand Callaghan Innovation and Pingar, under an R&D Student Fellowship Grant (Contract Number: PTERN1502).

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. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 10, P10008 (2008)

    Article  Google Scholar 

  2. Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of web communities. In: KDD, pp. 150–160 (2000)

    Google Scholar 

  3. Harenberg, S., et al.: Community detection in large-scale networks: a survey and empirical evaluation. Interdiscip. Rev. Comput. Stat. 6(6), 426–439 (2014)

    Article  Google Scholar 

  4. Kong, X., Cao, B., Yu, P.S.: Multi-label classification by mining label and instance correlations from heterogeneous information networks. In: KDD, pp. 614–622 (2013)

    Google Scholar 

  5. Lancichinetti, A., Fortunato, S.: Community detection algorithms: a comparative analysis. Phys. Rev. E 80, 056117 (2009)

    Article  Google Scholar 

  6. Leskovec, J., Lang, K.J., Mahoney, M.: Empirical comparison of algorithms for network community detection. In: WWW, pp. 631–640 (2010)

    Google Scholar 

  7. Long, B., Zhang, Z.M., Yu, P.S.: Co-clustering by block value decomposition. In: KDD, pp. 635–640 (2005)

    Google Scholar 

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

    Article  Google Scholar 

  9. Radev, D.R., Muthukrishnan, P., Qazvinian, V., Abu-Jbara, A.: The ACL anthology network corpus. Lang. Resour. Eval. 47(4), 919–944 (2009)

    Article  Google Scholar 

  10. Shi, C., Li, Y., Zhang, J., Sun, Y., Yu, P.S.: A survey of heterogeneous information network analysis. IEEE TKDE 29(1), 17–37 (2017)

    Google Scholar 

  11. Sun, Y., Yu, Y., Han, J.: Ranking-based clustering of heterogeneous information networks with star network schema. In: KDD, pp. 797–806 (2009)

    Google Scholar 

  12. Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: Arnetminer: extraction and mining of academic social networks. In: KDD, pp. 990–998 (2008)

    Google Scholar 

  13. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393(6684), 440 (1998)

    Article  Google Scholar 

  14. Xie, J., Szymanski, B.K., Liu, X.: SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: ICDM Workshops, pp. 344–349 (2011)

    Google Scholar 

  15. Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput. Surv. 45(4), 43:1–43:35 (2013)

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. Zhong, E., Fan, W., Zhu, Y., Yang, Q.: Modeling the dynamics of composite social networks. In: KDD, pp. 937–945 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ranran Bian .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bian, R., Koh, Y.S., Dobbie, G., Divoli, A. (2018). OHC: Uncovering Overlapping Heterogeneous Communities. In: Mitrovic, T., Xue, B., Li, X. (eds) AI 2018: Advances in Artificial Intelligence. AI 2018. Lecture Notes in Computer Science(), vol 11320. Springer, Cham. https://doi.org/10.1007/978-3-030-03991-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03991-2_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03990-5

  • Online ISBN: 978-3-030-03991-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics