Skip to main content

Community Clustering Based on Weighted Informative Graph

  • Conference paper
  • First Online:
Frontier Computing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 375))

  • 1906 Accesses

Abstract

Community clustering means the vertices in networks are often used to cluster into tightly-knit group with a high density of within-group edges and a lower density of between-group edges. However, most community clustering algorithms do not involve the node attributes and relationship, and these approaches lead to inaccuracy clustering. In this paper, we propose two algorithms which involve both node attributes and link structure in social networks based on Girvan-Newman algorithm (GN) and Weighted Informative Graph (WIG). The related experimental results verify the effectiveness of our proposed 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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291–307

    Article  MATH  Google Scholar 

  2. Newman MEJ (2004) Fast Algorithm for detecting community structure in networks. Phys Rev E 69:066133

    Article  Google Scholar 

  3. Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large network. Phys Rev E 70(6):066111

    Article  Google Scholar 

  4. Pascal P, Matthieu L (2006) Computing communities in large networks using random walks. J Graph Algorithms Appl 10(2):191–218

    Article  MathSciNet  MATH  Google Scholar 

  5. Xu X, Yuruk N, Feng Z et al (2007) SCAN: a structural clustering algorithm for networks. KDD 2007, pp 824–833

    Google Scholar 

  6. Dang TA, Viennet E (2012) Community detection based on structural and attribute similarities. 978-1-61208-176

    Google Scholar 

  7. Girvan M, Newman MEJ (2002) Community structure in social and biological networks. PNAS 99(12):7821–7826

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weimin Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Xu, Y., Gao, Y., Li, W. (2016). Community Clustering Based on Weighted Informative Graph. In: Hung, J., Yen, N., Li, KC. (eds) Frontier Computing. Lecture Notes in Electrical Engineering, vol 375. Springer, Singapore. https://doi.org/10.1007/978-981-10-0539-8_22

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0539-8_22

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0538-1

  • Online ISBN: 978-981-10-0539-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics