Skip to main content
SpringerLink
Log in

Searching Graph Communities by Modularity Maximization via Convex Optimization

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9486))

Abstract

Communities in networks are the densely knit groups of individuals. Newman suggested modularity - a natural measure of the quality of community partition, and several community detection strategies aiming on maximizing the modularity have been proposed. In this paper, we give a new combinatorial model for modularity maximization problem, and introduce a convex optimization based rounding algorithm. Importantly, even given the maximum number of wanted communities, our solution is still capable of maximizing the modularity and obtaining the upper bound on the best possible solution.

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

Access this chapter

Log in via an institution
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. Agarwal, G., Kempe, D.: Modularity-maximizing graph communities via mathematical programming. Eur. Phys. J. B 66(3), 409–418 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bi, Y., Weili, W., Zhu, Y., Fan, L., Wang, A.: A nature-inspired influence propagation model for the community expansion problem. J. Comb. Optim. 28(3), 513–528 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)

    Article  MATH  Google Scholar 

  4. Lu, Z., Zhu, Y., Li, W., Wu, W., Cheng, X.: Influence-based community partition for social networks. Comput. Soc. Netw. 1(1) (2014)

    Google Scholar 

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

    Article  Google Scholar 

  6. Zhang, X.-S., Li, Z., Wang, R.-S., Wang, Y.: A combinatorial model and algorithm for globally searching community structure in complex networks. J. Comb. Optim. 23(4), 425–442 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Zhu, Y., Li, D., Wen, X., Weili, W., Fan, L., Willson, J.: Mutual-relationship-based community partitioning for social networks. IEEE Trans. Emerg. Top. Comput. 2(4), 436–447 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, California State University, Los Angeles, CA, 90032, USA

    Yuqing Zhu & Chengyu Sun

  2. School of Information, Renmin University of China, Beijing, 100872, People’s Republic of China

    Deying Li

  3. School of Management, Xi’an Jiaotong University, Xi’an, 710049, Shaanxi, People’s Republic of China

    Cong Chen & Yinfeng Xu

Authors
  1. Yuqing Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chengyu Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Deying Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yinfeng Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuqing Zhu .

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Marywood University, Scranton, Pennsylvania, USA

    Zaixin Lu

  2. North Carolina Central University, Durham, North Carolina, USA

    Donghyun Kim

  3. University of Texas at Dallas, Richardson, Texas, USA

    Weili Wu

  4. Texas Southern University, Houston, Texas, USA

    Wei Li

  5. University of Texas at Dallas, Richardson, Texas, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhu, Y., Sun, C., Li, D., Chen, C., Xu, Y. (2015). Searching Graph Communities by Modularity Maximization via Convex Optimization. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26626-8_51

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26625-1

  • Online ISBN: 978-3-319-26626-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation